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

    Access via TIB

    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




    Publication date :

    2017




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    55.84 Straßenverkehr / 55.24 / 55.84 / 55.24 Fahrzeugführung, Fahrtechnik



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

    Pirani, Mohammad / Hashemi, Ehsan / Simpson-Porco, John W. et al. | IEEE | 2017


    Control of Vehicular Platoons using Nearest Neighbor Interactions

    Talukdar, Saurav | SAE Technical Papers | 2015


    Control of Vehicular Platoons using Nearest Neighbor Interactions

    Talukdar, Saurav | British Library Conference Proceedings | 2015


    Vibration-Theoretic Approach to Vulnerability Analysis of Nonlinear Vehicle Platoons

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


    Handling Driver Cut-Ins for Vehicle Platoons with a Game Theoretic Approach

    Meng, Qunyao / Lu, Yun / Su, Rong et al. | IEEE | 2024