Sensitivity Function Trade-offs for Networks with a String Topology
Richard Pates, Kaoru Yamamoto

TL;DR
This paper investigates the fundamental trade-offs in sensitivity functions for networks with string topology, revealing how network growth influences regulation and stability, especially in vehicle platoons.
Contribution
It introduces two sensitivity function trade-offs specific to string topology networks, linking network growth to regulation limitations and stability issues.
Findings
Lower bounds on H-infinity norm established
Bode sensitivity relations derived for network families
Explains poor regulation in long vehicle platoons
Abstract
We present two sensitivity function trade-offs that apply to a class of networks with a string topology. In particular we show that a lower bound on the H-infinity norm and a Bode sensitivity relation hold for an entire family of sensitivity functions associated with growing the network. The trade-offs we identify are a direct consequence of growing the network, and can be used to explain why poorly regulated low frequency behaviours emerge in long vehicle platoons even when using dynamic feedback.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTraffic control and management · Nonlinear Dynamics and Pattern Formation · Chaos control and synchronization
