25 February 2022 in IEEE Transactions on Mobile Computing
Cooperative Driving requires ultra-reliable communications, and it is now clear that no single technology will ever be able to satisfy such stringent requirements, if only because active jamming can kill (almost) any wireless technology. Cooperative driving with multiple communication technologies which complement each other opens new spaces for research and development, but also poses several challenges. The work we present tackles the fallback and recovery mechanisms that the longitudinal controlling system of a platoon of vehicles can implement as a distributed system with multiple communication interfaces. We present a protocol and procedure to correctly compute the safe transition between different controlling algorithms, down to autonomous (or manual) driving when no communication is possible. To empower the study, we also develop a new version of Plexe , which is an integral part of this contribution as the only Open Source, free simulation tool that enables the study of such systems with a modular approach, and that we deem offers the community the possibility of boosting research in this field. The results we present demonstrate the feasibility of safe fallback, but also highlight that such complex systems require careful design choices, as naïve approaches can lead to instabilities or even collisions, and that such design can only be done with appropriate in-silico experiments.
18 May 2023 in IEEE Transactions on Vehicular Technology
Cooperative adaptive cruise control presents an opportunity to improve road transportation through increase in road capacity and reduction in energy use and accidents. Clever design of control algorithms and communication systems is required to ensure that the vehicle platoon is stable and meets desired safety requirements. In this paper, we propose a centralized model predictive controller for a heterogeneous platoon of vehicles to reach a desired platoon velocity and individual inter-vehicle distances with driver-selected headway time. As a novel concept, we allow for interruption from a human driver in the platoon that temporarily takes control of their vehicle with the assumption that the driver will, at minimum, obey legal velocity limits and the physical performance constraints of their vehicle. The finite horizon cost function of our proposed platoon controller is inspired from the infinite horizon design. To the best of our knowledge, this is the first platoon controller that integrates human-driven vehicles. We illustrate the performance of our proposed design with a numerical study, demonstrating that the safety distance, velocity, and actuation constraints are obeyed. Additionally, in simulation we illustrate a key property of string stability where the impact of a disturbance is reduced through the platoon.
25 July 2024 in IEEE Transactions on Intelligent Transportation Systems
Platooning is a promising cooperative driving application for future intelligent transportation systems. In order to assign vehicles to platoons, some algorithm for platoon formation is required. Such assignments have to be computed on-demand, e.g., when vehicles join or leave the freeways. In order to get best results from platooning, individual properties of involved vehicles have to be considered during the assignment computation. In this paper, we explore the computation of assignments as an optimization problem based on similarity between vehicles. We define the similarity and, vice versa, the deviation among vehicles based on the desired driving speed of vehicles and their position on the road. We create three approaches to solve this assignment problem:, and, using a Mixed Integer Programming (MIP) solver and greedy heuristics, respectively. Conceptually, the approaches differ in both knowledge about vehicles as well as methodology. We perform a large-scale simulation study using to compare all approaches. While the approach seems to have disadvantages due to the limited local knowledge, it performs as good as the approach across most metrics. Both outperform the approach, which suffers from synchronization and greedy selection effects. The approach however assumes global knowledge and requires a complex MIP solver to compute assignments. Overall, the approach achieves close to optimal results but requires the least assumptions and complexity. Therefore, we consider the approach the best approach among all presented approaches.
1 June 2018 in Computer Communications