Papers
Topics
Authors
Recent
Search
2000 character limit reached

Towards a comprehensive impossibility result for string stability

Published 13 Apr 2018 in math.OC | (1804.04858v2)

Abstract: We provide a comprehensive impossibility result towards achieving string stability, i.e. keeping local relative errors in check with local controllers independently of the size of a chain of subsystems. We significantly extend existing results, from the LTI setting to any homogeneous controllers that can be nonlinear, time-varying, and locally communicating. We prove this impossibility for a set of definitions with various norm choices, including the $L_2$-type which is more standard in the literature and a BIBO type criterion. All results hold for a general discrete-time controller which should cover most applications.

Authors (2)
Citations (9)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.