Survey on UAV Coverage Path Planning Problem

Abstract

The advanced and highly mobile design of UAVs has led to a wide range of applications in fields such as battlefield monitoring, intelligent agriculture, photogrammetry, and disaster management, all of which are based on the coverage path planning problem (CPP). In recent years, there have been numerous researches on UAV coverage path planning problem. It is very important to plan an effective flight path for UAV to cover the whole target area completely. The purpose of this paper is to summarize and analysis of the existing literature involving different methods to solve the problem of UAV coverage path planning, we will survey the coverage path planning algorithm is mainly divided into two categories: one is geometric algorithm based on polygon region decomposition, and the second is heuristic algorithm for variant TSP and GTSP problems based on grid division and gives out the summary and analysis method for every type of coverage.