Distributed and proximity-constrained C-means for discrete coverage control

In this paper we present a novel distributed coverage control framework for a network of mobile agents, in charge of covering a finite set of points of interest (PoI), such as people in danger, geographically dispersed equipment or environmental landmarks. The proposed algorithm is inspired by c-Means, an unsupervised learning algorithm originally proposed for non-exclusive clustering and for identification of cluster centroids from a set of observations. To cope with the agents' limited sensing range and avoid infeasible coverage solutions, traditional c-Means needs to be enhanced with proximity constraints, ensuring that each agent takes into account only neighboring PoIs. The proposed coverage control framework provides useful information concerning the ranking or importance of the different PoIs to the agents, which can be exploited in further application-dependent data fusion processes, patrolling, or disaster relief applications.

[1]  J. Cortes,et al.  From geometric optimization and nonsmooth analysis to distributed coordination algorithms , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[2]  Michael M. Zavlanos,et al.  Distributed communication-aware coverage control by mobile sensor networks , 2016, Autom..

[3]  R. Kannan,et al.  Convex Sets and their Applications , 2006 .

[4]  J. Sherman,et al.  Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix , 1950 .

[5]  James C. Bezdek,et al.  Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.

[6]  J. C. Dunn,et al.  A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters , 1973 .

[7]  Devesh C. Jinwala,et al.  Privacy Preserving Distributed K-Means Clustering in Malicious Model Using Zero Knowledge Proof , 2013, ICDCIT.

[8]  Zhiyong Sun,et al.  Higher order mobile coverage control with application to localization , 2017, ArXiv.

[9]  Sung G. Lee,et al.  Multirobot Control Using Time-Varying Density Functions , 2014, IEEE Transactions on Robotics.

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

[11]  António Manuel Santos Pascoal,et al.  A Decentralized Strategy for Multirobot Sampling/Patrolling: Theory and Experiments , 2015, IEEE Transactions on Control Systems Technology.

[12]  Jorge Cortés,et al.  Coverage control by multi-robot networks with limited-range anisotropic sensory , 2009, Int. J. Control.

[13]  Christoforos N. Hadjicostis,et al.  Distributed C-means data clustering algorithm , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[14]  Anthony Tzes,et al.  Distributed coverage control for concave areas by a heterogeneous Robot-Swarm with visibility sensing constraints , 2015, Autom..

[15]  Himansu Sekhar Behera,et al.  Fuzzy C-Means (FCM) Clustering Algorithm: A Decade Review from 2000 to 2014 , 2015 .

[16]  Eduardo Montijano,et al.  Efficient multi-robot formations using distributed optimization , 2014, 53rd IEEE Conference on Decision and Control.

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

[18]  Mac Schwager,et al.  Adaptive Inter-Robot Trust for Robust Multi-Robot Sensor Coverage , 2013, ISRR.

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

[20]  Wei Xing Zheng,et al.  Distributed $k$ -Means Algorithm and Fuzzy $c$ -Means Algorithm for Sensor Networks Based on Multiagent Consensus Theory , 2017, IEEE Transactions on Cybernetics.

[21]  Carlos Sagüés,et al.  Distributed Coverage Estimation and Control for Multirobot Persistent Tasks , 2016, IEEE Transactions on Robotics.

[22]  Gabriele Oliva,et al.  Distributed k-means algorithm , 2013, ArXiv.