Skip to Main Content
We study a problem of blanket coverage by employing a network of self-deployed, autonomous mobile sensors or agents. The coverage problem is to drive the mobile sensor network to form a sensor lattice that completely covers a two-dimensional (2-D) region between two boundaries. In particular, the sensors form into the so-called triangular lattice pattern, and it is optimal in terms of the minimum number of sensors required for complete coverage of a bounded 2-D set. A distributed motion coordination algorithm is proposed for the mobile sensors to address the coverage problem. The algorithm is developed based on some simple consensus algorithms that only rely on local information. To illustrate the proposed algorithm, numerical simulations have been carried out for a number of scenarios.