Discretized optimal control approach for dynamic multi-agent decentralized coverage

This paper presents a novel discrete-time decentralized control law for the Voronoi-based self-deployment of a Multi-Agent dynamical system. The basic control objective is to let the agents deploy into a bounded convex polyhedral region and maximize the coverage quality by computing locally the control action for each agent. The Voronoi tessellation algorithm is employed to partition dynamically the deployed region and to allocate each agent to a corresponding bounded functioning zone at each time instant. The control synthesis is then locally computed based on an optimal formulation framework related to the Lloyd's algorithm but according to the discrete-time agent's dynamics equation. The performance of the discretized optimal solution will be demonstrated via an illustrative example.

[1]  Georges Voronoi Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs. , 1908 .

[2]  Sonia Martinez,et al.  Deployment algorithms for a power‐constrained mobile sensor network , 2010 .

[3]  R Bellman,et al.  DYNAMIC PROGRAMMING AND A NEW FORMALISM IN THE CALCULUS OF VARIATIONS. , 1954, Proceedings of the National Academy of Sciences of the United States of America.

[4]  Richard M. Murray,et al.  Recent Research in Cooperative Control of Multivehicle Systems , 2007 .

[5]  P. Olver Nonlinear Systems , 2013 .

[6]  Francesco Bullo,et al.  Esaim: Control, Optimisation and Calculus of Variations Spatially-distributed Coverage Optimization and Control with Limited-range Interactions , 2022 .

[7]  Luis Rodrigues,et al.  An Optimal Control Approach to Decentralized Energy-Efficient Coverage Problems , 2014 .

[8]  Richard M. Murray,et al.  Flocking with obstacle avoidance: cooperation with limited communication in mobile networks , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[9]  Mac Schwager,et al.  Unifying Geometric, Probabilistic, and Potential Field Approaches to Multi-robot Coverage Control , 2009, ISRR.

[10]  Kokichi Sugihara,et al.  Voronoi diagrams in a river , 1992, Int. J. Comput. Geom. Appl..

[11]  Yasamin Mostofi,et al.  Utilizing Mobility to Minimize the Total Communication and Motion Energy Consumption of a Robotic Operation , 2012 .

[12]  Krishna R. Pattipati,et al.  Distributed Algorithms for Energy-Efficient Even Self-Deployment in Mobile Sensor Networks , 2014, IEEE Transactions on Mobile Computing.

[13]  Efstathios Bakolas,et al.  Optimal partitioning for spatiotemporal coverage in a drift field , 2013, Autom..

[14]  Herbert G. Tanner Flocking with obstacle avoidance in switching networks of interconnected vehicles , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

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

[16]  Qiang Du,et al.  Centroidal Voronoi Tessellations: Applications and Algorithms , 1999, SIAM Rev..

[17]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.