Multi-agent coordination in directed moving neighbourhood random networks
Author:
- 1 July 2010
- journal article
- general
- Published by IOP Publishing in Chinese Physics B
- Vol. 19 (7) , 070201
Abstract
This paper considers the consensus problem of dynamical multiple agents that communicate via a directed moving neighbourhood random network. Each agent performs random walk on a weighted directed network. Agents interact with each other through random unidirectional information flow when they coincide in the underlying network at a given instant. For such a framework, we present sufficient conditions for almost sure asymptotic consensus. Numerical examples are taken to show the effectiveness of the obtained results.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Automatic generation of min-weighted persistent formationsChinese Physics B, 2009
- Consensus protocol for multi-agent continuous systemsChinese Physics B, 2008
- A Necessary and Sufficient Condition for Consensus Over Random NetworksIEEE Transactions on Automatic Control, 2008
- Consensus Seeking Over Random Weighted Directed GraphsIEEE Transactions on Automatic Control, 2007
- Consensus and Cooperation in Networked Multi-Agent SystemsProceedings of the IEEE, 2007
- Agreement over random networksIEEE Transactions on Automatic Control, 2005
- Communication and Synchronization in Disconnected Networks with Dynamic Topology: Moving Neighborhood NetworksMathematical Biosciences and Engineering, 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
- Reaching a ConsensusJournal of the American Statistical Association, 1974