An Improved Trajectory Planning Method for Unmanned Aerial Vehicles in Complex Environments

被引:1
作者
Zhang, Chen [1 ]
Yu, Moduo [2 ]
Huang, Wentao [2 ]
Hu, Yi [3 ]
Chen, Yang [3 ]
Fan, Qinqin [1 ]
机构
[1] Shanghai Maritime Univ, Logist Res Ctr, Shanghai 201306, Peoples R China
[2] Shanghai Jiao Tong Univ, Key Lab Control Power Transmiss & Convers, Minist Educ, Shanghai 200240, Peoples R China
[3] State Grid Shanghai Songjiang Elect Power Supply, Shanghai 200240, Peoples R China
来源
BIO-INSPIRED COMPUTING: THEORIES AND APPLICATIONS, PT 2, BIC-TA 2023 | 2024年 / 2062卷
关键词
Unmanned aerial vehicle; Path planning; Autonomous flight; Elliptical tangent graph algorithm;
D O I
10.1007/978-981-97-2275-4_12
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Trajectory planning plays a crucial role in the execution of Unmanned aerial vehicle (UAV) missions. However, planning an optimal collision-free trajectory is a challenging task, especially in complex environments. To address the above issue, an enhanced Elliptical tangent graph algorithm (ETG-CPI) based on comprehensive performance indicator is proposed in the present study. In the proposed algorithm, the comprehensive performance indicator, which contains the obstacle avoidance frequency, the yaw angle and the distance from the start point to the candidate waypoint, is used to select promising waypoints. Moreover, the entropy weight method is used to integrate these performance indicators. The experimental results demonstrate that the proposed algorithm outperforms four competitive path planning methods in 26 different environments. Additionally, the results indicate that the proposed comprehensive path evaluation method can help the proposed algorithm find a high-quality path in complex environments.
引用
收藏
页码:148 / 158
页数:11
相关论文
共 50 条
  • [11] Adaptive Bi-Directional RRT Algorithm for Three-Dimensional Path Planning of Unmanned Aerial Vehicles in Complex Environments
    Li, Nan
    Han, Sang Ik
    IEEE ACCESS, 2025, 13 : 23748 - 23767
  • [12] Path planning in unmanned aerial vehicles: An optimistic overview
    Shahid, Noor
    Abrar, Muhammad
    Ajmal, Ushna
    Masroor, Roha
    Amjad, Shehzad
    Jeelani, Mubashir
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2022, 35 (06)
  • [13] Planning and executing construction inspections with unmanned aerial vehicles
    Freimuth, Henk
    Koenig, Markus
    AUTOMATION IN CONSTRUCTION, 2018, 96 : 540 - 553
  • [14] AN OVERVIEW OF PATH PLANNING TECHNOLOGIES FOR UNMANNED AERIAL VEHICLES
    Bal, Mert
    THERMAL SCIENCE, 2022, 26 (04): : 2865 - 2876
  • [15] Real-time path planning in dynamic environments for unmanned aerial vehicles using the curve-shortening flow method
    Huptych, Marcel
    Roeck, Sascha
    INTERNATIONAL JOURNAL OF ADVANCED ROBOTIC SYSTEMS, 2021, 18 (01)
  • [16] Research on Trajectory Planning Algorithm of Unmanned Aerial Vehicle Based on Improved A* algorithm
    Fang Mao-hui
    Xu Jun
    2017 INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS, ELECTRONICS AND CONTROL (ICCSEC), 2017, : 1348 - 1352
  • [17] Trajectory planning with mid-air collision avoidance for quadrotor unmanned aerial vehicles
    Jiang, Yuhang
    Hu, Shiqiang
    Damaren, Christopher J.
    PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART G-JOURNAL OF AEROSPACE ENGINEERING, 2022, 236 (09) : 1721 - 1737
  • [18] Path Planning Method Based on D* lite Algorithm for Unmanned Surface Vehicles in Complex Environments
    Yan-long Yao
    Xiao-feng Liang
    Ming-zhi Li
    Kai Yu
    Zhe Chen
    Chong-ben Ni
    Yue Teng
    China Ocean Engineering, 2021, 35 : 372 - 383
  • [19] An optimal control-based path planning method for unmanned surface vehicles in complex environments
    Ma, Dongfang
    Hao, Shunfeng
    Ma, Weihao
    Zheng, Huarong
    Xu, Xiuli
    OCEAN ENGINEERING, 2022, 245
  • [20] Path Planning Method Based on D~* lite Algorithm for Unmanned Surface Vehicles in Complex Environments
    YAO Yan-long
    LIANG Xiao-feng
    LI Ming-zhi
    YU Kai
    CHEN Zhe
    NI Chong-ben
    TENG Yue
    ChinaOceanEngineering, 2021, 35 (03) : 372 - 383