首页|Distributed collaborative complete coverage path planning based on hybrid strategy
Distributed collaborative complete coverage path planning based on hybrid strategy
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
万方数据
维普
Collaborative coverage path planning(CCPP)refers to obtaining the shortest paths passing over all places except obstacles in a certain area or space.A multi-unmanned aerial vehicle(UAV)collaborative CCPP algorithm is proposed for the urban rescue search or military search in outdoor environment.Due to flexible control of small UAVs,it can be considered that all UAVs fly at the same altitude,that is,they perform search tasks on a two-dimensional plane.Based on the agents'motion characteristics and environmental information,a mathematical model of CCPP problem is established.The minimum time for UAVs to complete the CCPP is the objective function,and com-plete coverage constraint,no-fly constraint,collision avoidance constraint,and communication constraint are considered.Four motion strategies and two communication strategies are designed.Then a distributed CCPP algorithm is designed based on hybrid strategies.Simulation results compared with pattern-based genetic algorithm(PBGA)and random search method show that the proposed method has stronger real-time perfor-mance and better scalability and can complete the complete CCPP task more efficiently and stably.
NETL
NSTL
万方数据
维普
