Abstract
In this paper, semistability and stochastic semistability for switched discrete-time nonlinear systems are considered. The main results of this paper involve sufficient conditions for (stochastic) semistability of discrete-time nonlinear/linear dynamical systems under time-varying or random switching by means of Fixed Point Theory, that has not been considered in the literature. As an application of the results, an iterative algorithm is derived for constrained distributed consensus over random multi-agent networks. The algorithm is a totally asynchronous algorithm without requiring B-connectivity or distribution dependency of switching graphs. The algorithm is able to converge even if the weighted matrix of the graph is periodic and irreducible under synchronous protocol.
| Original language | English |
|---|---|
| Pages (from-to) | 560-565 |
| Number of pages | 6 |
| Journal | IFAC-PapersOnLine |
| Volume | 54 |
| Issue number | 20 |
| DOIs | |
| State | Published - Nov 1 2021 |
| Event | 2021 Modeling, Estimation and Control Conference, MECC 2021 - Austin, United States Duration: Oct 24 2021 → Oct 27 2021 |
Keywords
- Multi-agent systems
- Randomized methods
- Stability of nonlinear systems
- Switching stability and control
- Synthesis of stochastic systems
Fingerprint
Dive into the research topics of 'Semistability and Stochastic Semistability for Switched Nonlinear Systems by Means of Fixed Point Theory: Application to Constrained Distributed Consensus over Random Networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver