Improved Consensus ADMM for Cooperative Motion Planning of Large-Scale Connected Autonomous Vehicles with Limited Communication
This paper investigates a cooperative motion planning problem for large-scale connected autonomous vehicles (CAVs) under limited communications, which addresses the challenges of high communication and computing resource requirements. Our proposed methodology incorporates a parallel optimization alg...
Gespeichert in:
Hauptverfasser: | , , , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This paper investigates a cooperative motion planning problem for large-scale
connected autonomous vehicles (CAVs) under limited communications, which
addresses the challenges of high communication and computing resource
requirements. Our proposed methodology incorporates a parallel optimization
algorithm with improved consensus ADMM considering a more realistic locally
connected topology network, and time complexity of O(N) is achieved by
exploiting the sparsity in the dual update process. To further enhance the
computational efficiency, we employ a lightweight evolution strategy for the
dynamic connectivity graph of CAVs, and each sub-problem split from the
consensus ADMM only requires managing a small group of CAVs. The proposed
method implemented with the receding horizon scheme is validated thoroughly,
and comparisons with existing numerical solvers and approaches demonstrate the
efficiency of our proposed algorithm. Also, simulations on large-scale
cooperative driving tasks involving 80 vehicles are performed in the
high-fidelity CARLA simulator, which highlights the remarkable computational
efficiency, scalability, and effectiveness of our proposed development.
Demonstration videos are available at
https://henryhcliu.github.io/icadmm_cmp_carla. |
---|---|
DOI: | 10.48550/arxiv.2401.09032 |