English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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 H&#x221E; 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 lurst-order dynamics (reference velocity tracking) and second-order dynamics (controlling inter-vehicular distance) are analyzed in this direction. Theoretical contributions are conlurmed via simulation results.

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