2022
DOI: 10.3390/s22031235
|View full text |Cite
|
Sign up to set email alerts
|

Coverage Path Planning Methods Focusing on Energy Efficient and Cooperative Strategies for Unmanned Aerial Vehicles

Abstract: The coverage path planning (CPP) algorithms aim to cover the total area of interest with minimum overlapping. The goal of the CPP algorithms is to minimize the total covering path and execution time. Significant research has been done in robotics, particularly for multi-unmanned unmanned aerial vehicles (UAVs) cooperation and energy efficiency in CPP problems. This paper presents a review of the early-stage CPP methods in the robotics field. Furthermore, we discuss multi-UAV CPP strategies and focus on energy-… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 45 publications
(20 citation statements)
references
References 81 publications
0
13
0
Order By: Relevance
“…Collisions and forbidden areas were outlined in [ 44 ]. In [ 45 , 46 ], the authors proposed a hybrid decomposition method and estimated a cellular decomposition method for dividing the coverage area into triangular shapes. A spiral design was proposed in [ 47 ] to facilitate path planning in areas with complex coverage.…”
Section: Preliminariesmentioning
confidence: 99%
“…Collisions and forbidden areas were outlined in [ 44 ]. In [ 45 , 46 ], the authors proposed a hybrid decomposition method and estimated a cellular decomposition method for dividing the coverage area into triangular shapes. A spiral design was proposed in [ 47 ] to facilitate path planning in areas with complex coverage.…”
Section: Preliminariesmentioning
confidence: 99%
“…There are two different approaches: (global) planning of all movements before execution and situation-dependent movements -possible with local plans for a few next steps. A good overview of algorithms for movement planning for many mobile systems can be found for example in [4], [5]. There are algorithms based on multiagent reinforcement learning [6], on Multi-Agent Path Planning (MAPF) [11], with evolutionary algorithms [9], graph [4] and grid-based [7] solutions, combinations of algorithms for solving partial problems [12].…”
Section: State Of the Artmentioning
confidence: 99%
“…For multi-UAV path planning, some researchers [ 10 , 11 ] have proposed solutions for multi-UAV collision avoidance systems based on centralized algorithms. Centralized algorithms rely on a central server, which is used to communicate with each agent and generate global control commands based on the observations of all UAVs.…”
Section: Introductionmentioning
confidence: 99%