We consider a graph-theoretic approach to the performance and robustness of a platoon of vehicles, in which each vehicle communicates with its $k$ -nearest neighbors. In particular, we quantify the platoon’s stability margin, robustness to disturbances (in terms of system $\mathcal {H}_{\infty }$ norm), and maximum delay tolerance via graph-theoretic notions, such as nodal degrees and (grounded) Laplacian matrix eigenvalues. The results show that there is a trade-off between robustness to time delay and robustness to disturbances. Both first-order dynamics (reference velocity tracking) and second-order dynamics (controlling inter-vehicular distance) are analyzed in this direction. Theoretical contributions are confirmed via simulation results.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Graph Theoretic Approach to the Robustness of $k$ -Nearest Neighbor Vehicle Platoons


    Contributors:


    Publication date :

    2017-11-01


    Size :

    874470 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Control of Vehicular Platoons using Nearest Neighbor Interactions

    Talukdar, Saurav | SAE Technical Papers | 2015


    Vibration-Theoretic Approach to Vulnerability Analysis of Nonlinear Vehicle Platoons

    Wang, Pengcheng / Wu, Xinkai / He, Xiaozheng | IEEE | 2023


    Constant-Spacing Connected Platoons With Robustness to Communication Delays

    Lin, Yudong / Tiwari, Anuj / Fabien, Brian et al. | IEEE | 2023

    Free access

    Game Theoretic Models for Profit-Sharing in Multi-fleet Platoons

    Johansson, Alexander / Martensson, Jonas | IEEE | 2019