Finite-time consensus for multi-agent systems with fixed topologies
Author:
- 1 March 2012
- journal article
- research article
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 43 (3) , 499-506
Abstract
In this article, we study finite-time state consensus problems for continuous multi-agent systems with nonlinear protocols. Building on the theory of finite-time Lyapunov stability, we propose sufficient criteria which guarantee the system to reach a consensus in finite time, provided that the underlying directed network contains a spanning tree. Novel finite-time consensus protocols are introduced as examples for applying the criteria. Simulations are also presented to illustrate our theoretical results.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Synchronisation in complex networks of coupled systems with directed topologiesInternational Journal of Systems Science, 2009
- Finite-Time Semistability and Consensus for Nonlinear Dynamical NetworksIEEE Transactions on Automatic Control, 2008
- Semistability theory for differential inclusions with applications to consensus problems in dynamical networks with switching topology2008
- Distributed algorithms for reaching consensus on general functionsAutomatica, 2008
- Finite-time convergent gradient flows with applications to network consensusAutomatica, 2006
- Agreement over random networksIEEE Transactions on Automatic Control, 2005
- Coordination of groups of mobile autonomous agents using nearest neighbor rulesIEEE Transactions on Automatic Control, 2003
- Algebraic Graph Theory2001
- Finite-Time Stability of Continuous Autonomous SystemsSIAM Journal on Control and Optimization, 2000
- Finite Time ControllersSIAM Journal on Control and Optimization, 1986