Persistent Covering With Latency and Energy Constraints
- 2 February 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 6 (2) , 998-1003
Abstract
Most consumer-level low-cost unmanned aerial vehicles (UAVs) have limited battery power and long charging time. Thus, they cannot accomplish some practical tasks such as providing service to cover an area for an extended time, also known as persistent covering. Algorithmic approaches are limited mostly due to the computational complexity and intractability of the problem. Approximation algorithms that assume unlimited energy have been considered to segment a large area into smaller cells that require periodic visits under the latency constraints. In this letter, we explore geometric and topological properties that allow us to significantly reduce the size of the optimization problem. Consequently, the proposed method can efficiently determine the minimum number of UAVs needed and schedule their routes to cover an area persistently. We experimentally demonstrate that the proposed algorithm has better performance than the baseline.Keywords
All Related Versions
Funding Information
- Academia Mexicana de Cultura A.C. (AFOSR FA9550-17-1-0075)
This publication has 19 references indexed in Scilit:
- Battery-constrained coverage2016
- Energy-Aware Coverage Path Planning of UAVs2015
- Persistent monitoring in discrete environments: Minimizing the maximum weighted latency between observationsThe International Journal of Robotics Research, 2013
- A graph-based approach to multi-robot rendezvous for recharging in persistent tasks2013
- Smooth coverage path planning and control of mobile robots based on high-resolution grid map representationRobotics and Autonomous Systems, 2011
- Energy-aware coverage control with docking for robot teams2011
- Energy constrained multi-robot sensor-based coverage path planning using capacitated arc routing approachRobotics and Autonomous Systems, 2010
- Near-Optimal Mobile Robot Recharging with the Rate-Maximizing Forager2007
- Mobile robotics in the long term-exploring the fourth dimension2002
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996