Potential of genetic algorithms in multi-UAV coverage problem

Abstract

For a rapid area coverage multiple UAVs are often used simultaneously. However, a path planning for a UAVs group during an area coverage task is computationally challenging. In practice, heuristic algorithms are applied to solve this problem. This paper overviews approaches to an area coverage problem with a group of UAVs using genetic algorithms. The article explores modifications that may be useful for a genetic algorithm for solving the coverage problem as well as representation methods for chromosomes that reflect a path of multi-UAV. Additionally, UAV group collision avoidance strategies during area coverage are considered.