Sensitivity Function Trade-Offs for Networks with a String Topology

Richard Pates, Kaoru Yamamoto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publication2018 IEEE Conference on Decision and Control, CDC 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages5869-5873
Number of pages5
ISBN (Electronic)9781538613955
DOIs
Publication statusPublished - Jan 18 2019
Event57th IEEE Conference on Decision and Control, CDC 2018 - Miami, United States
Duration: Dec 17 2018Dec 19 2018

Publication series

NameProceedings of the IEEE Conference on Decision and Control
Volume2018-December
ISSN (Print)0743-1546

Conference

Conference57th IEEE Conference on Decision and Control, CDC 2018
CountryUnited States
CityMiami
Period12/17/1812/19/18

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modelling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'Sensitivity Function Trade-Offs for Networks with a String Topology'. Together they form a unique fingerprint.

Cite this