Cooperative Path Planning of UAVs & UGVs for a Persistent Surveillance Task in Urban Environments

There have been many applications of drones in urban environments, such as delivery, rescue, and surveillance. In a persistent surveillance task, the drones sometimes cannot complete it independently when some regions are required to be covered on the ground. For this purpose, unmanned aerial vehicles and unmanned ground vehicles (UAVs & UGVs) system is introduced to perform such a task in this article, and the goal is to generate the circular paths for the drones and the UGVs, respectively, to minimize their travel time of realizing a complete coverage. First, the cooperative path planning problem of UAVs & UGVs is formulated into a large-scale 0-1 optimization problem, in which the on–off states of the discrete points are to be optimized. Second, a hybrid algorithm integrating the estimation of distribution algorithm (EDA) and the genetic algorithm (GA) algorithm is proposed to solve the problem. The advantages of EDA and GA in the global and local search are fully taken considering the demands in different phases of the iterative process. A simple sweep-based approach is employed to determine the optimal sequence of passing the open points. Then, an online local adjustment strategy is also applied to address the changes of the requirements on covering the ground area. Simulation results demonstrate that the UAVs & UGVs system can enhance the effi- ciency of the task. The hybrid EDA-GA algorithm can greatly improve the performance of EDA and GA in terms of the quality and the stability of solutions. The online adjustment strategy is effective to maintain a complete coverage while minimizing the impact on the circular paths.

PDF
No code implementations yet. Submit your code now

Tasks


Datasets


  Add Datasets introduced or used in this paper

Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods


No methods listed for this paper. Add relevant methods here