4.7 Article

A Clustering-Based Coverage Path Planning Method for Autonomous Heterogeneous UAVs

期刊

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TITS.2021.3066240

关键词

Path planning; Task analysis; Unmanned aerial vehicles; Planning; Training; Clustering algorithms; Search problems; Coverage path planning; unmanned aerial vehicle; clustering-base method; autonomous heterogeneous UAVs

资金

  1. National Key Research and Development Program [2017YFB1001900, 2018YFB2101304]

向作者/读者索取更多资源

Unmanned aerial vehicles (UAVs) are widely utilized in civilian and military applications for their high autonomy and strong adaptability. This paper addresses the coverage path planning problem of autonomous heterogeneous UAVs on a bounded number of regions by proposing an exact formulation based on mixed integer linear programming and a clustering-based algorithm inspired from density-based clustering methods to achieve optimal flight paths and efficient coverage tasks. Experiments demonstrating the efficiency and effectiveness of the proposed approach with randomly generated regions are conducted.
Unmanned aerial vehicles (UAVs) have been widely applied in civilian and military applications due to their high autonomy and strong adaptability. Although UAVs can achieve effective cost reduction and flexibility enhancement in the development of large-scale systems, they result in a serious path planning and task allocation problem. Coverage path planning, which tries to seek flight paths to cover all of regions of interest, is one of the key technologies in achieving autonomous driving of UAVs and difficult to obtain optimal solutions because of its NP-Hard computational complexity. In this paper, we study the coverage path planning problem of autonomous heterogeneous UAVs on a bounded number of regions. First, with models of separated regions and heterogeneous UAVs, we propose an exact formulation based on mixed integer linear programming to fully search the solution space and produce optimal flight paths for autonomous UAVs. Then, inspired from density-based clustering methods, we design an original clustering-based algorithm to classify regions into clusters and obtain approximate optimal point-to-point paths for UAVs such that coverage tasks would be carried out correctly and efficiently. Experiments with randomly generated regions are conducted to demonstrate the efficiency and effectiveness of the proposed approach.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据