Voronoi-based coverage control of heterogeneous disk-shaped robots
Authors:
- 1 May 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4259-4266
Abstract
In distributed mobile sensing applications, networks of agents that are heterogeneous, respecting both actuation as well as body and sensory footprint, are often modelled by recourse to power diagrams - generalized Voronoi diagrams with additive weights. In this paper, we adapt the body power diagram to introduce its “free subdiagram,” generating a vector field planner that solves the combined sensory coverage and collision avoidance problem via continuous evaluation of an associated constrained optimization problem. We propose practical extensions (a heuristic congestion manager that speeds convergence and a lift of the point particle controller to the more practical differential drive kinematics) that maintain the convergence and collision guarantees.Keywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Unifying geometric, probabilistic, and potential field approaches to multi-robot deploymentThe International Journal of Robotics Research, 2010
- Deployment algorithms for a power‐constrained mobile sensor networkInternational Journal of Robust and Nonlinear Control, 2009
- Coverage Control for Mobile Sensing NetworksIEEE Transactions on Robotics and Automation, 2004
- Centroidal Voronoi Tessellations: Applications and AlgorithmsSIAM Review, 1999
- Sensitivity Analysis in Nonlinear Programs and Variational Inequalities via Continuous SelectionsSIAM Journal on Control and Optimization, 1995
- Structural Analysis of Nonsmooth Mappings, Inverse Functions, and Metric ProjectionsJournal of Mathematical Analysis and Applications, 1994
- Piecewise Ck functions in nonsmooth analysisNonlinear Analysis, 1990
- Sensitivity Analysis of Nonlinear Programs and Differentiability Properties of Metric ProjectionsSIAM Journal on Control and Optimization, 1988
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982
- The polynomial solvability of convex quadratic programmingUSSR Computational Mathematics and Mathematical Physics, 1980