Title: Topology simplification strategy for connected multi-agent systems

Authors: Xiaoli Li, Yugeng Xi, Xiaojun Geng

Addresses: Department of Automation, Shanghai Jiao Tong University, 800 Dong Chuan Road, Shanghai 200240, China. ' Department of Automation, Shanghai Jiao Tong University, 800 Dong Chuan Road, Shanghai 200240, China. ' Department of Electrical and Computer Engineering, California State University, Northridge, CA 91330, USA

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.

Keywords: multi-agent systems; connected MAS; agent-based systems; topology; group connectedness; distributed control; dispersion; simulation.

DOI: 10.1504/IJMIC.2011.040079

International Journal of Modelling, Identification and Control, 2011 Vol.12 No.4, pp.348 - 362

Published online: 21 Mar 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article