Abstract
Unmanned aerial vehicles (UAVs) have become key tools in automated area coverage tasks due to the fact that they are not limited by obstacles on the ground and are able to quickly complete tasks. However, when planning routes for UAVs covering an area, difficulties arise in finding optimal solutions due to the computational complexity of the problem. Therefore, when solving problems with a group of UAVs over large areas, heuristic algorithms are used to find coverage paths that are close to optimal. one popular algorithm for that is the genetic algorithm. The article studies the potential of using genetic algorithms in the context of solving the problem of covering an area using a group of UAVs. The article provides a review of methods for developing and optimizing modified genetic algorithms that take into account the unique features of the coverage problem. The characteristics of the genetic algorithm and the representation of chromosomes when solving the coverage problem are analyzed, depending on the different types of representation of territories. The article considers features of applying genetic operations to chromosomes that reflect the trajectory of the UAV, as well as the features of the task when working with a group of UAVs. In addition, it also discusses collision avoidance techniques in UAV swarm missions, their advantages and limitations.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call