Abstract

Formation stability is now analyzed under a new prism using input-to-state stability (ISS). Formation ISS relates leader input to internal state of the formation and characterizes the way this input affects stability performance. Compared to other notions of stability for interconnected systems, formation ISS does not require attenuation of errors as they propagate, but instead quantifies the amplification and provides worst case bounds. The control interconnections that give rise to the formation are represented by a graph. The formation graphs considered are built from a small number of primitive graphs, the stability properties of which are used to reason about the composite. For the case of linear dynamics, a recursive expression allows the calculation of the bounds using the graph theoretic representation of the formation via the adjacency matrix. Illustrative examples demonstrate how formation ISS can be used as an analysis and a design tool.

Keywords

Adjacency matrixStability (learning theory)Representation (politics)GraphComputer scienceState (computer science)Control theory (sociology)AlgorithmTheoretical computer scienceControl (management)Artificial intelligence

Affiliated Institutions

Related Publications

Publication Info

Year
2003
Type
article
Volume
3
Pages
2439-2444
Citations
69
Access
Closed

External Links

View on DOI.org

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

69
OpenAlex

Cite This

Herbert G. Tanner, George J. Pappas, Vijay Kumar (2003). Input-to-state stability on formation graphs. , 3 , 2439-2444. https://doi.org/10.1109/cdc.2002.1184201

Identifiers

DOI
10.1109/cdc.2002.1184201