A novel consensus protocol using facility location algorithms

This paper introduces a new consensus protocol whose features are different from known consensus protocols available in the literature. The relation between discrete coverage algorithms over a convex polygon for solving a facility location problem (n-median problem) along with some notions in agreement over acyclic digraphs have been used to establish a novel constrained consensus protocol. Its convergence for the special case of acyclic digraphs with switching topology is presented. Extension of the results for other graph topologies and communication links are left for future works.

[1]  Masafumi Yamashita,et al.  Distributed memoryless point convergence algorithm for mobile robots with limited visibility , 1999, IEEE Trans. Robotics Autom..

[2]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.

[3]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.

[4]  F. Bullo,et al.  On collective motion in sensor networks: sample problems and distributed algorithms , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[5]  Suresh Venkatasubramanian,et al.  Robust statistics on Riemannian manifolds via the geometric median , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[6]  Francesco Bullo,et al.  Coordination and Geometric Optimization via Distributed Dynamical Systems , 2003, SIAM J. Control. Optim..

[7]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[8]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[9]  F. Bullo,et al.  Motion Coordination with Distributed Information , 2007 .

[10]  Reza Olfati-Saber,et al.  Flocking for multi-agent dynamic systems: algorithms and theory , 2006, IEEE Transactions on Automatic Control.

[11]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[12]  Miad Moarref,et al.  Facility Location Optimization via Multi-Agent Robotic Systems , 2008, 2008 IEEE International Conference on Networking, Sensing and Control.

[13]  Prosenjit Bose,et al.  Fast approximations for sums of distances, clustering and the Fermat-Weber problem , 2003, Computational geometry.

[14]  Francesco Bullo,et al.  Notes on averaging over acyclic digraphs and discrete coverage control , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.