期刊
EXPERT SYSTEMS WITH APPLICATIONS
卷 185, 期 -, 页码 -出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2021.115690
关键词
Unmanned aerial vehicle; Group teaching optimization algorithm; Three-dimensional route planning
类别
资金
- National Natural Science Foundation of China [61603145]
- China Agriculture Research System of MOF and MARA [CARS-24-D-02]
- Outstanding Young and Middle-aged Scientific Innovation Team of Colleges and Universities of Hubei Province in China [T201934]
This study addresses the challenges posed by the complexity and diversity of the flight environment for unmanned aerial vehicle route planning. It constructs a 3-D flight environment model with multiple obstacles and designs a novel diversified group teaching optimization algorithm for generating flight routes. The proposed algorithm shows significant superiority compared to state-of-the-art optimization algorithms and consistently generates optimal flight routes in complex environments.
The complexity and diversity of the flight environment pose great challenges to unmanned aerial vehicle route planning, which demands feasible flight strategies and efficient route planning algorithms. To address the issue, this paper constructs a 3-D flight environment model with multiple obstacles, and designs a novel diversified group teaching optimization algorithm for the generation of flight routes of unmanned aerial vehicles. In the environment model, a variety of obstacles are taken into consideration to make the flying scenarios more realistic, including mountain, cuboid, cylinder and triangular prism, and corresponding strategies are presented for unmanned aerial vehicles to safely avoid these obstacles. In the proposed algorithm, three novel teaching methods are introduced to balance the exploitation and exploration phases. Besides, a novel constrained optimization strategy is adopted, in which constraints are incrementally added to the fitness function to avoid the premature phenomenon in the initial iteration stage of algorithm. The experimental results show that compared with several state-of-the-art optimization algorithms, the proposed algorithm is significantly superior and can always generate the optimal flight route in complicated environments.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据