A distributed self-clustering algorithm for autonomous multi-agent systems

In this paper, we consider clustering in autonomous multi-agent systems where the agents, assumed to belong to either `blue' or `red' type, engage in local location-swaps to physically separate the network into two connected clusters. The groupings (red/blue) may reflect hardware differences or some other distinguishing factor that differs across groups. We present a randomized algorithm, Naïve Swap, where the agents randomly swap their locations with an arbitrary neighbor. We then provide two modifications to this naïve strategy, Intelligent Swap and Stable Marriage Swap, that are based on truncated average-consensus and the Gale-Shapley algorithm for solving the stable marriage problem, respectively. These modifications serve as an improvement upon the randomized (naïve) location-swaps by using information on the group association of neighbors to guide swapping decisions. We provide a sketch for the analysis of the proposed schemes via an irreducible Markov chain analogy. We further show the effectiveness of the proposed strategies via simulations.

[1]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[2]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.

[3]  Usman A. Khany,et al.  A decentralized algorithm for the preferred assignment problem in multi-agent systems , 2013, 2013 European Control Conference (ECC).

[4]  Stephen P. Boyd,et al.  A scheme for robust distributed sensor fusion based on average consensus , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[5]  George J. Pappas,et al.  Flocking in Fixed and Switching Networks , 2007, IEEE Transactions on Automatic Control.

[6]  David Gale,et al.  Some remarks on the stable matching problem , 1985, Discret. Appl. Math..

[7]  Paul J. M. Havinga,et al.  Enabling mobility in heterogeneous wireless sensor networks cooperating with UAVs for mission-critical management , 2008, IEEE Wireless Communications.

[8]  Catherine Rosenberg,et al.  Homogeneous vs heterogeneous clustered sensor networks: a comparative study , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[9]  W. Marsden.  I and J , 2012 .

[10]  Valentin Polishchuk,et al.  Almost Stable Matchings by Truncating the Gale–Shapley Algorithm , 2009, Algorithmica.

[11]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.