Name
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/CDC.2018.8619555 | 2018 IEEE CONFERENCE ON DECISION AND CONTROL (CDC) |
Field | DocType | ISSN |
Mathematical optimization,Upper and lower bounds,Computer science,Trade offs,Sensitivity (control systems),String topology | Conference | 0743-1546 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Richard Pates | 1 | 0 | 2.37 |
| Kaoru Yamamoto | 2 | 240 | 15.20 |