109 research outputs found

    A Survey on platoon-based vehicular cyber-physical systems

    Get PDF
    Vehicles on the road with some common interests can cooperatively form a platoon-based driving pattern, in which a vehicle follows another one and maintains a small and nearly constant distance to the preceding vehicle. It has been proved that, compared to driving individually, such a platoon-based driving pattern can significantly improve the road capacity and energy efficiency. Moreover, with the emerging vehicular adhoc network (VANET), the performance of platoon in terms of road capacity, safety and energy efficiency, etc., can be further improved. On the other hand, the physical dynamics of vehicles inside the platoon can also affect the performance of VANET. Such a complex system can be considered as a platoon-based vehicular cyber-physical system (VCPS), which has attracted significant attention recently. In this paper, we present a comprehensive survey on platoon-based VCPS. We first review the related work of platoon-based VCPS. We then introduce two elementary techniques involved in platoon-based VCPS: the vehicular networking architecture and standards, and traffic dynamics, respectively. We further discuss the fundamental issues in platoon-based VCPS, including vehicle platooning/clustering, cooperative adaptive cruise control (CACC), platoon-based vehicular communications, etc., and all of which are characterized by the tight coupled relationship between traffic dynamics and VANET behaviors. Since system verification is critical to VCPS development, we also give an overview of VCPS simulation tools. Finally, we share our view on some open issues that may lead to new research directions

    Resilience in Platoons of Cooperative Heterogeneous Vehicles: Self-organization Strategies and Provably-correct Design

    Full text link
    This work proposes provably-correct self-organizing strategies for platoons of heterogeneous vehicles. We refer to self-organization as the capability of a platoon to autonomously homogenize to a common group behavior. We show that self-organization promotes resilience to acceleration limits and communication failures, i.e., homogenizing to a common group behavior makes the platoon recover from these causes of impairments. In the presence of acceleration limits, resilience is achieved by self-organizing to a common constrained group behavior that prevents the vehicles from hitting their acceleration limits. In the presence of communication failures, resilience is achieved by self-organizing to a common group observer to estimate the missing information. Stability of the self-organization mechanism is studied analytically, and correctness with respect to traffic actions (e.g. emergency braking, cut-in, merging) is realized through a provably-correct safety layer. Numerical validations via the platooning toolbox OpenCDA in CARLA and via the CommonRoad platform confirm improved performance through self-organization and the provably-correct safety layer

    230501

    Get PDF
    Cooperative Vehicular Platooning (Co-VP) is a paradigmatic example of a Cooperative Cyber-Physical System (Co-CPS), which holds the potential to vastly improve road safety by partially removing humans from the driving task. However, the challenges are substantial, as the domain involves several topics, such as control theory, communications, vehicle dynamics, security, and traffic engineering, that must be coupled to describe, develop and validate these systems of systems accurately. This work presents a comprehensive survey of significant and recent advances in Co-VP relevant fields. We start by overviewing the work on control strategies and underlying communication infrastructures, focusing on their interplay. We also address a fundamental concern by presenting a cyber-security overview regarding these systems. Furthermore, we present and compare the primary initiatives to test and validate those systems, including simulation tools, hardware-in-the-loop setups, and vehicular testbeds. Finally, we highlight a few open challenges in the Co-VP domain. This work aims to provide a fundamental overview of highly relevant works on Co-VP topics, particularly by exposing their inter-dependencies, facilitating a guide that will support further developments in this challenging field.info:eu-repo/semantics/publishedVersio

    A survey on vehicular communication for cooperative truck platooning application

    Get PDF
    Platooning is an application where a group of vehicles move one after each other in close proximity, acting jointly as a single physical system. The scope of platooning is to improve safety, reduce fuel consumption, and increase road use efficiency. Even if conceived several decades ago as a concept, based on the new progress in automation and vehicular networking platooning has attracted particular attention in the latest years and is expected to become of common implementation in the next future, at least for trucks.The platoon system is the result of a combination of multiple disciplines, from transportation, to automation, to electronics, to telecommunications. In this survey, we consider the platooning, and more specifically the platooning of trucks, from the point of view of wireless communications. Wireless communications are indeed a key element, since they allow the information to propagate within the convoy with an almost negligible delay and really making all vehicles acting as one. Scope of this paper is to present a comprehensive survey on connected vehicles for the platooning application, starting with an overview of the projects that are driving the development of this technology, followed by a brief overview of the current and upcoming vehicular networking architecture and standards, by a review of the main open issues related to wireless communications applied to platooning, and a discussion of security threats and privacy concerns. The survey will conclude with a discussion of the main areas that we consider still open and that can drive future research directions.(c) 2022 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/)

    Security of Vehicular Platooning

    Get PDF
    Platooning concept involves a group of vehicles acting as a single unit through coordination of movements. While Platooning as an evolving trend in mobility and transportation diminishes the individual and manual driving concerns, it creates new risks. New technologies and passenger’s safety and security further complicate matters and make platooning attractive target for the malicious minds. To improve the security of the vehicular platooning, threats and their potential impacts on vehicular platooning should be identified to protect the system against security risks. Furthermore, algorithms should be proposed to detect intrusions and mitigate the effects in case of attack. This dissertation introduces a new vulnerability in vehicular platooning from the control systems perspective and presents the detection and mitigation algorithms to protect vehicles and passengers in the event of the attack

    Adaptive Cooperative Highway Platooning and Merging

    Get PDF
    As low-cost reliable sensors are introduced to market, research efforts in autonomous driving are increasing. Traffic congestion is a major problem for nearly all metropolis'. Assistive driving technologies like cruise control and adaptive cruise control are widely available today. While these control systems ease the task of driving, the driver still needs to be fully alert at all times. While these existing structures are helpful in alleviating the stress of driving to a certain extent, they are not enough to improve traffic flow. Two main causes of congestion are slow response of drivers to their surroundings, and situations like highway ramp merges or lane closures. This thesis will address both of these issues. A modified version of the widely available adaptive cruise control systems, known as cooperative adaptive cruise control, can work at all speeds with additional wireless communication that improves stability of the controller. These structures can tolerate much smaller desired spacing and can safely work in stop and go traffic. This thesis proposes a new control structure that combines conventional cooperative adaptive cruise control with rear end collision check. This approach is capable of avoiding rear end collisions with the following car, as long as it can still maintain the safe distance with the preceding vehicle. This control structure is mainly intended for use with partially automated highways, where there is a risk of being rear-ended while following a car with adaptive cruise control. Simulation results also shows that use of bidirectional cooperative adaptive cruise control also helps to strengthen the string stability of the platoon. Two different control structures are used to accomplish this task: MPC and PD based switching controller. Model predictive control (MPC) structure works well for the purpose of bidirectional platoon control. This control structure can adapt to the changes in the plant with the use of a parameter estimator. Constraints are set to make sure that the controller outputs are always within the boundaries of the plant. Also these constraints assures that a certain gap will always be kept with the preceding vehicle. PD based switching controller offers an alternative to the MPC structure. Main advantage of this control structure is that it is designed to be robust to certain level of sensor noise. Both these control structures gave good simulation results. The thesis makes use of the control structures developed in the earlier chapters to continue developing structures to alleviate traffic congestions. Two merging schemes are proposed to find a solution to un-signaled merging and lane closures. First problem deals with situations where necessary levels of communication is not present to inform surrounding drivers of merging intention. Second structure proposes a merging protocol for cases where two platoons are approaching a lane closure. This structure makes use of the modified cooperative adaptive cruise control structures proposed earlier in the thesis

    Distributed Model Reference Adaptive Control for Vehicle Platoons with Uncertain Dynamics

    Get PDF
    This paper proposes a distributed model reference adaptive controller (DMRAC) for vehicle platoons with constant spacing policy, subjected to uncertainty in control effectiveness and inertial time lag. It formulates the uncertain vehicle dynamics as a matched uncertainty, and is applicable for both directed and undirected topologies. The directed topology must contain at least one spanning tree with the leader as a root node, while the undirected topology must be static and connected with at least one follower receiving information from the leader. The proposed control structure consists of a reference model and a main control system. The reference model is a closed-loop system constructed from the nominal model of each follower vehicle and a reference control signal. The main control system consists of a nominal control signal based on cooperative state feedback and an adaptive term. The nominal control signal allows the followers cooperatively track the leader, while the adaptive term suppresses the effects of uncertainties. Stability analysis shows that global tracking errors with respect to the reference model and with respect to the leader are asymptotically stable. The states of all followers synchronize to both the reference and leader states. Moreover, with the existence of unknown external disturbances, the global tracking errors remain uniformly ultimately bounded. The performance of the controlled system is verified through the simulations and validates the efficacy of the proposed controller

    Distributed, decentralised and compensational mechanisms for platoon formation

    Get PDF
    Verkehrsprobleme nehmen mit der weltweiten Urbanisierung und der Zunahme der Anzahl der Fahrzeuge pro Kopf zu. Platoons, eine Formation von eng hintereinander fahrenden Fahrzeugen, stellen sich als mögliche Lösung dar, da bestehende Forschungen darauf hinweisen, dass sie zu einer besseren Straßenauslastung beitragen, den Kraftstoffverbrauch und die Emissionen reduzieren und Engpässe schneller entlasten können. Rund um das Thema Platooning gibt es viele Aspekte zu erforschen: Sicherheit, Stabilität, Kommunikation, Steuerung und Betrieb, die allesamt notwendig sind, um den Einsatz von Platooning im Alltagsverkehr näher zu bringen. Während in allen genannten Bereichen bereits umfangreiche Forschungen durchgeführt wurden, gibt es bisher nur wenige Arbeiten, die sich mit der logischen Gruppierung von Fahrzeugen in Platoons beschäftigen. Daher befasst sich diese Arbeit mit dem noch wenig erforschten Problem der Platoonbildung, wobei sich die vorhandenen Beispiele mit auf Autobahnen fahrenden Lastkraftwagen beschäftigen. Diese Fälle befinden sich auf der strategischen und taktischen Ebene der Planung, da sie von einem großen Zeithorizont profitieren und die Gruppierung entsprechend optimiert werden kann. Die hier vorgestellten Ansätze befinden sich hingegen auf der operativen Ebene, indem Fahrzeuge aufgrund der verteilten und dezentralen Natur dieser Ansätze spontan und organisch gruppiert und gesteuert werden. Dadurch entstehen sogenannte opportunistische Platoons, die aufgrund ihrer Flexibilität eine vielversprechende Voraussetzung für alle Netzwerkarte bieten könnten. Insofern werden in dieser Arbeit zwei neuartige Algorithmen zur Bildung von Platoons vorgestellt: ein verteilter Ansatz, der von klassischen Routing-Problemen abgeleitet wurde, und ein ergänzender dezentraler kompensatorischer Ansatz. Letzteres nutzt automatisierte Verhandlungen, um es den Fahrzeugen zu erleichtern, sich auf der Basis eines monetären Austausches in einem Platoon zu organisieren. In Anbetracht der Tatsache, dass alle Verkehrsteilnehmer über eine Reihe von Präferenzen, Einschränkungen und Zielen verfügen, muss das vorgeschlagene System sicherstellen, dass jede angebotene Lösung für die einzelnen Fahrzeuge akzeptabel und vorteilhaft ist und den möglichen Aufwand, die Kosten und die Opfer überwiegt. Dies wird erreicht, indem den Platooning-Fahrzeugen eine Form von Anreiz geboten wird, im Sinne von entweder Kostensenkung oder Ampelpriorisierung. Um die vorgeschlagenen Algorithmen zu testen, wurde eine Verkehrssimulation unter Verwendung realer Netzwerke mit realistischer Verkehrsnachfrage entwickelt. Die Verkehrsteilnehmer wurden in Agenten umgewandelt und mit der notwendigen Funktionalität ausgestattet, um Platoons zu bilden und innerhalb dieser zu operieren. Die Anwendbarkeit und Eignung beider Ansätze wurde zusammen mit verschiedenen anderen Aspekten untersucht, die den Betrieb von Platoons betreffen, wie Größe, Verkehrszustand, Netzwerkpositionierung und Anreizmethoden. Die Ergebnisse zeigen, dass die vorgeschlagenen Mechanismen die Bildung von spontanen Platoons ermöglichen. Darüber hinaus profitierten die teilnehmenden Fahrzeuge mit dem auf verteilter Optimierung basierenden Ansatz und unter Verwendung kostensenkender Anreize unabhängig von der Platoon-Größe, dem Verkehrszustand und der Positionierung, mit Nutzenverbesserungen von 20% bis über 50% im Vergleich zur untersuchten Baseline. Bei zeitbasierten Anreizen waren die Ergebnisse uneinheitlich, wobei sich der Nutzen einiger Fahrzeuge verbesserte, bei einigen keine Veränderung eintrat und bei anderen eine Verschlechterung zu verzeichnen war. Daher wird die Verwendung solcher Anreize aufgrund ihrer mangelnden Pareto-Effizienz nicht empfohlen. Der kompensatorische und vollständig dezentralisierte Ansatz weißt einige Vorteile auf, aber die daraus resultierende Verbesserung war insgesamt vernachlässigbar. Die vorgestellten Mechanismen stellen einen neuartigen Ansatz zur Bildung von Platoons dar und geben einen aussagekräftigen Einblick in die Mechanik und Anwendbarkeit von Platoons. Dies schafft die Voraussetzungen für zukünftige Erweiterungen in der Planung, Konzeption und Implementierung effektiverer Infrastrukturen und Verkehrssysteme.Traffic problems have been on the rise corresponding with the increase in worldwide urbanisation and the number of vehicles per capita. Platoons, which are a formation of vehicles travelling close together, present themselves as a possible solution, as existing research indicates that they can contribute to better road usage, reduce fuel consumption and emissions and decongest bottlenecks faster. There are many aspects to be explored pertaining to the topic of platooning: safety, stability, communication, controllers and operations, all of which are necessary to bring platoons closer to use in everyday traffic. While extensive research has already made substantial strides in all the aforementioned fields, there is so far little work on the logical grouping of vehicles in platoons. Therefore, this work addresses the platoon formation problem, which has not been heavily researched, with existing examples being focused on large, freight vehicles travelling on highways. These cases find themselves on the strategic and tactical level of planning since they benefit from a large time horizon and the grouping can be optimised accordingly. The approaches presented here, however, are on the operational level, grouping and routing vehicles spontaneously and organically thanks to their distributed and decentralised nature. This creates so-called opportunistic platoons which could provide a promising premise for all networks given their flexibility. To this extent, this thesis presents two novel platoon forming algorithms: a distributed approach derived from classical routing problems, and a supplementary decentralised compensational approach. The latter uses automated negotiation to facilitate vehicles organising themselves in a platoon based on monetary exchanges. Considering that all traffic participants have a set of preferences, limitations and goals, the proposed system must ensure that any solution provided is acceptable and beneficial for the individual vehicles, outweighing any potential effort, cost and sacrifices. This is achieved by offering platooning vehicles some form of incentivisation, either cost reductions or traffic light prioritisation. To test the proposed algorithms, a traffic simulation was developed using real networks with realistic traffic demand. The traffic participants were transformed into agents and given the necessary functionality to build platoons and operate within them. The applicability and suitability of both approaches were investigated along with several other aspects pertaining to platoon operations such as size, traffic state, network positioning and incentivisation methods. The results indicate that the mechanisms proposed allow for spontaneous platoons to be created. Moreover, with the distributed optimisation-based approach and using cost-reducing incentives, participating vehicles benefited regardless of the platoon size, traffic state and positioning, with utility improvements ranging from 20% to over 50% compared to the studied baseline. For time-based incentives the results were mixed, with the utility of some vehicles improving, some seeing no change and for others, deteriorating. Therefore, the usage of such incentives would not be recommended due to their lack of Pareto-efficiency. The compensational and completely decentralised approach shows some benefits, but the resulting improvement was overall negligible. The presented mechanisms are a novel approach to platoon formation and provide meaningful insight into the mechanics and applicability of platoons. This sets the stage for future expansions into planning, designing and implementing more effective infrastructures and traffic systems

    Safety in Vehicular Networks—On the Inevitability of Short-Range Directional Communications

    Get PDF
    Mobile Ad Hoc NetworksInternational audienceSafety implies high dependability and strict timeliness under worst-case conditions. These requirements are not met with existing standards aimed at inter-vehicular communications (V2V) in vehicular networks. Ongoing research targets medium-range omnidirectional V2V communications and short-range directional communications, which we refer to as neighbor-to-neighbor (N2N) communications. Focusing on the latter, we investigate the time-bounded message dissemination (TBMD) problem as it arises in platoons and ad hoc vehicle strings, referred to as cohorts. Informal specifications of TBMD, of a solution, are given. We show how to guarantee cohort-wide dissemination of any N2N message generated by a cohort member, either spontaneously or upon receipt of a V2V message. Dissemination time bounds are given for worst-case conditions regarding N2N channel contention and N2N message losses. These results add to previously demonstrated merits of short-range directional communications as regards safety in vehicular networks
    • …
    corecore