Consensus problems for linear time-invariant multi-agent systems with saturation constraints
Authors:
- 14 April 2011
- journal article
- Published by Institution of Engineering and Technology (IET) in IET Control Theory & Applications
- Vol. 5 (6) , 823-829
Abstract
A class of networked multi-agent systems is studied in this study where each agent has an identical dynamics of a simple integrator and the topology of the connections is fixed. It is proved that, when there are saturation constraints, a general consensus protocol widely used in the literatures for this class of multi-agent systems remains valid. As an extension, a ‘bang-bang’ type of consensus protocol is proposed to achieve the finite-time consensus, which relaxes the previous undirected connection assumption.Keywords
This publication has 18 references indexed in Scilit:
- Consensus protocols for discrete-time multi-agent systems with time-varying delaysAutomatica, 2008
- Agreeing AsynchronouslyIEEE Transactions on Automatic Control, 2008
- Motion Coordination with Distributed InformationIEEE Control Systems, 2007
- Information consensus in multivehicle cooperative controlIEEE Control Systems, 2007
- Consensus and Cooperation in Networked Multi-Agent SystemsProceedings of the IEEE, 2007
- Consensus seeking in multiagent systems under dynamically changing interaction topologiesIEEE Transactions on Automatic Control, 2005
- Consensus Problems in Networks of Agents With Switching Topology and Time-DelaysIEEE Transactions on Automatic Control, 2004
- Fast linear iterations for distributed averagingSystems & Control Letters, 2004
- Coordination of groups of mobile autonomous agents using nearest neighbor rulesIEEE Transactions on Automatic Control, 2003
- Novel Type of Phase Transition in a System of Self-Driven ParticlesPhysical Review Letters, 1995