Coverage Control for Mobile Sensor Networks on a Circle
Keyword(s):
This paper investigates the coverage problem for mobile sensor networks on a circle. The goal is to minimize the largest distance from any point on the circle to its nearest sensor while preserving the mobile sensors' order. The coverage problem is translated into a multi-agent consensus problem by showing that the largest distance from any point to its nearest sensor is minimized if the counterclockwise distance between each sensor and its right neighbor reaches a consensus. Distributed control laws are also developed to drive the mobile agents to the optimal configuration with order preservation. Simulation results illustrate the effectiveness of the proposed control laws.
Keyword(s):
Keyword(s):
Keyword(s):
2019 ◽
Vol 35
(4)
◽
pp. 889-908
◽
Keyword(s):