A coverage algorithm for a class of non-convex regions
Authors:
- 1 December 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01912216,p. 4244-4249
Abstract
The paper describes a framework for solving the coverage problem for a class of non-convex domains. In we have shown how a diffeomorphism can be used to transform a non-convex coverage problem to a convex one to which the Lloyd¿s algorithm can be applied. In this paper we show how a diffeomorphism can be constructed for convex regions with obstacles in its interior, so that the solution of the transformed problem yields the solution of the original non-convex problem. As part of this investigation we also identify stationary points of the Lloyd¿s algorithm in non-convex domains. We provide the formal analysis of the approach and demonstrate its effectiveness through simulations.Keywords
This publication has 13 references indexed in Scilit:
- Performing coverage on nonconvex domains2008
- On Synchronous Robotic Networks—Part I: Models, Tasks, and ComplexityIEEE Transactions on Automatic Control, 2007
- Consensus of information in distributed control of a diffusion process using centroidal Voronoi tessellations2007
- Task Switching in Mobile Wireless Sensor Networks2006
- Distributed deployment of asynchronous guards in art galleries2006
- Coverage Control for Mobile Sensing NetworksIEEE Transactions on Robotics and Automation, 2004
- Spatial Tessellations2000
- Centroidal Voronoi Tessellations: Applications and AlgorithmsSIAM Review, 1999
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982
- A combinatorial theorem in plane geometryJournal of Combinatorial Theory, Series B, 1975