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

Journal: Sensors (Basel, Switzerland)
PMID: 35161979

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-saving CPP algorithms. Likewise, we aim to present a comparison between energy efficient CPP algorithms and directions for future research.

Authors

  • Georgios Fevgas
    Department of Computer Science, International Hellenic University, 65404 Kavala, Greece.
  • Thomas Lagkas
    Department of Computer Science, Kavala Campus, International Hellenic University, 654 04 Kavala, Greece.
  • Vasileios Argyriou
    Department of Networks and Digital Media, Kingston University, London KT1 1LQ, UK.
  • Panagiotis Sarigiannidis
    Department of Electrical and Computer Engineering, University of Western Macedonia, 501 31 Kozani, Greece.

Keywords

External Resources

Popular Topics
Recent Journals