Topology simplification strategy for connected multi-agent systems Online publication date: Sat, 21-Mar-2015
by Xiaoli Li, Yugeng Xi, Xiaojun Geng
International Journal of Modelling, Identification and Control (IJMIC), Vol. 12, No. 4, 2011
Abstract: Some applications of multi-agent systems require the whole group of agents to be spread into the environment from initially compact connection configurations; as a result, the group connection topology tends to be sparser as the agents move. On the other hand, preserving group connectedness is often regarded as a fundamental necessity for networked operations. To take requirements of both dispersion and connectedness into consideration, a distributed algorithm of 'cutting off' redundant edges based on local information is developed in this paper. With this algorithm, a simplified connection graph is extracted from the actual communication topology, which keeps the connectedness of the actual topology with less but robust communication links. The performance of the algorithm is analysed and simulated. Finally, we apply this distributed algorithm in solving a connected dispersion problem which spreads out the agents while simultaneously maintaining their connectedness; and its effectiveness is shown by simulations.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook