Coverage Control for Mobile Sensor Networks on a Circle
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 243-248 |
| Journal / Publication | Unmanned Systems |
| Volume | 2 |
| Issue number | 3 |
| Online published | 1 Jul 2014 |
| Publication status | Published - Jul 2014 |
Link(s)
Abstract
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.
Research Area(s)
- Coverage control, mobile sensor networks, order preservation
Citation Format(s)
Coverage Control for Mobile Sensor Networks on a Circle. / Song, Cheng; Feng, Gang.
In: Unmanned Systems, Vol. 2, No. 3, 07.2014, p. 243-248.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
