Simultaneously Stabilizing Networked Systems With Minimal Communication
Open Access
- 28 August 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (6) , 3589-3601
Abstract
Self-triggered feedback control is used as a means to reduce the energy and communication requirements of networked systems. Triggered-control schemes result in aperiodic communications, with a potential for communication conflicts when multiple feedback loops are closed over a shared network. In this paper, we analyze the necessary/sufficient conditions for simultaneous stabilizability of a set of nonlinear systems over a network from the perspective of scheduling theory, using Lyapunov functions and input to state stability. We then propose a recursively feasible self-triggering scheme that minimizes the usage of the communication channel while ensuring the stability of all systems.Keywords
This publication has 31 references indexed in Scilit:
- Networked stabilization of multi-input systems over shared channels with scheduling/control co-designAutomatica, 2019
- An ISS self-triggered implementation of linear controllersAutomatica, 2010
- On the Benefits of Relaxing the Periodicity Assumption for Networked Control Systems over CAN2009
- Data Rate Theorem for Stabilization Over Time-Varying Feedback ChannelsIEEE Transactions on Automatic Control, 2009
- Event-Triggered Real-Time Scheduling of Stabilizing Control TasksIEEE Transactions on Automatic Control, 2007
- A Lyapunov Proof of an Improved Maximum Allowable Transfer Interval for Networked Control SystemsIEEE Transactions on Automatic Control, 2007
- Maximizing the stability radius of a set of systems under real-time scheduling constraintsIEEE Transactions on Automatic Control, 2005
- Input–Output Stability Properties of Networked Control SystemsIEEE Transactions on Automatic Control, 2004
- Scheduling of a limited communication channel for optimal controlAutomatica, 2004
- Pinwheel Scheduling: Achievable DensitiesAlgorithmica, 2002