Distributed nonuniform coverage with limited scalar measurements

In this paper we demonstrate a distributed coverage control method for a network of mobile agents moving in one dimension along a scalar information density field. The method requires each agent to take a finite number of measurements of the density field in the interval between its two neighbors and calculate its next position in order to drive the network nearer to the configuration for optimal coverage. We derive several results relating to the equilibrium properties of the sensor network and the convergence properties near fixed points. We illustrate with simulations of the algorithm.

[1]  Naomi Ehrich Leonard,et al.  Nonuniform coverage control on the line , 2011, IEEE Conference on Decision and Control and European Control Conference.

[2]  Carlos H. Caicedo-Nunez,et al.  Symmetric coverage of dynamic mapping error for mobile sensor networks , 2011, Proceedings of the 2011 American Control Conference.

[3]  Gaurav S. Sukhatme,et al.  Constrained coverage for mobile sensor networks , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[4]  Wei Li,et al.  Distributed Cooperative coverage Control of Sensor Networks , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

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

[6]  J. Miller.  Numerical Analysis , 1966, Nature.

[7]  Kanti B. Datta,et al.  Matrix and linear algebra , 1991 .

[8]  Naomi Ehrich Leonard,et al.  Nonuniform coverage and cartograms , 2009, 49th IEEE Conference on Decision and Control (CDC).

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

[10]  J. Douglas Faires,et al.  Numerical Analysis , 1981 .

[11]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.