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

preprint2016arXivOpen access

Abstract

We consider a graph theoretic approach to the performance and robustness of a platoon of vehicles, where each vehicle communicates with its kk-nearest neighbors. In particular, we quantify the platoon's stability margin, robustness to disturbances (in terms of system H∞\mathcal{H}_{\infty} norm), and maximum delay tolerance via graph-theoretic notions such as nodal degrees and (grounded) Laplacian matrix eigenvalues. Our 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.