UAV Coverage Path Planning under Varying Power Constraints using Deep Reinforcement Learning

Mirco Theile, Harald Bayerlein, Richard Nai, David Gesbert, Marco Caccamo
3/5/2020
cs.ROeess.SY

Official code: theilem/uavSim (165 stars, BSD-3-Clause, last commit 2025-05-26).

Abstract

Coverage path planning (CPP) is the task of designing a trajectory that enables a mobile agent to travel over every point of an area of interest. We propose a new method to control an unmanned aerial vehicle (UAV) carrying a camera on a CPP mission with random start positions and multiple options for landing positions in an environment containing no-fly zones. While numerous approaches have been proposed to solve similar CPP problems, we leverage end-to-end reinforcement learning (RL) to learn a control policy that generalizes over varying power constraints for the UAV. Despite recent improvements in battery technology, the maximum flying range of small UAVs is still a severe constraint, which is exacerbated by variations in the UAV's power consumption that are hard to predict. By using map-like input channels to feed spatial information through convolutional network layers to the agent, we are able to train a double deep Q-network (DDQN) to make control decisions for the UAV, balancing limited power budget and coverage goal. The proposed method can be applied to a wide variety of environments and harmonizes complex goal structures with system constraints.

View on arXivView PDF

Code Implementations(1)

theilem/uavSimOfficial100%
BSD-3-Clause
16530PythonOct 20, 20201 years agoBSD-3-Clause

Similar Papers

Cite this paper

@article{theile2020coverage,
  title  = {UAV Coverage Path Planning under Varying Power Constraints using Deep Reinforcement Learning},
  author = {Mirco Theile and Harald Bayerlein and Richard Nai and David Gesbert and Marco Caccamo},
  year   = {2020},
  eprint = {2003.02609},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2003.02609}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2003.02609.svg)](https://codeofpaper.com/paper/2003.02609)

Discussion