홈 › Papers

Connected and Automated Vehicle Platoon Formation Control via Differential Games

In this study, the connected and automated vehicles (CAVs) platooning problem is resolved under a differential game framework. Three information topologies are considered here. Firstly, Predecessor-following (PF) topology is utilized where the vehicles control the distance with respect to the merely nearest predecessor via a sensor link-based information flow. Secondly, Two-predecessor-following topology (TPF) is exploited where each vehicle controls the distance with respect to the two nearest predecessors. In this topology, the second predecessor is communicated via a Vehicle-to-vehicle (V2V) link. The individual trajectories of CAVs under the Nash equilibrium are derived in closed-form for these two information topologies. Finally, general information topology is examined and the differential game is formulated in this context. In all these options, Pontryagin's principle is employed to investigate the existence and uniqueness of the Nash equilibrium and obtain its corresponding trajectories. In the general topology, we suppose numerical computation of eigenvalues and eigenvectors. All these approaches represent promising and powerful analytical representations of the CAV platoons under the differential games. Simulation experiments have verified the efficiency of the proposed models and their solutions.

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반