Area-constrained coverage optimization by robotic sensor networks

This paper studies robotic sensor networks performing coverage optimization tasks with area constraints. The network coverage of the environment is a function of the robot locations and the partition of the space. The area of the region assigned to each robot is constrained to be a pre-specified amount. We characterize the optimal configurations as center generalized Voronoi configurations. The generalized Voronoi partition depends on a set of weights, one per robot, assigned to the network. We design a Jacobi iterative algorithm to find the weight assignment whose corresponding generalized Voronoi partition satisfies the area constraints. This algorithm is distributed over the generalized Delaunay graph. We also design the ¿move-to-center-and-compute-weight¿ coordination algorithm that steers the robotic network towards the set of center generalized Voronoi configurations while monotonically optimizing coverage. Various simulations illustrate our results.

[1]  Godfried T. Toussaint,et al.  Relative neighborhood graphs and their relatives , 1992, Proc. IEEE.

[2]  Matthew J. Katz,et al.  Minimum-cost load-balancing partitions , 2006, SCG '06.

[3]  Dusan M. Stipanovic,et al.  Effective Coverage Control for Mobile Sensor Networks With Guaranteed Collision Avoidance , 2007, IEEE Transactions on Control Systems Technology.

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

[5]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

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

[7]  Emilio Frazzoli,et al.  Decentralized algorithms for stochastic and dynamic vehicle routing with general demand distribution , 2007, 2007 46th IEEE Conference on Decision and Control.

[8]  Emilio Frazzoli,et al.  Efficient routing of multiple vehicles with no explicit communications , 2008 .

[9]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[10]  V. G. Bolti︠a︡nskiĭ,et al.  Geometric Methods and Optimization Problems , 1998 .

[11]  Sonia Martínez,et al.  Energy-balancing cooperative strategies for sensor deployment , 2007, 2007 46th IEEE Conference on Decision and Control.

[12]  Franz Aurenhammer,et al.  Minkowski-Type Theorems and Least-Squares Clustering , 1998, Algorithmica.

[13]  A. Arsie,et al.  Efficient routing of multiple vehicles with no communication , 2007, 2007 American Control Conference.

[14]  E. Bolker,et al.  Generalized Dirichlet tessellations , 1986 .

[15]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[16]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[17]  Eric N. Mortensen,et al.  Weight-proportional Space Partitioning Using Adaptive Voronoi Diagrams , 2007, GeoInformatica.

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

[19]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[20]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .