Study on A-Star Algorithm-Based 3D Path Optimization Method Considering Density of Obstacles

被引:0
|
作者
Yoo, Yong-Deok [1 ]
Moon, Jung-Ho [2 ]
机构
[1] Cheongju Univ, Dept Mech & Aeronaut Syst Engn, Cheongju 360764, South Korea
[2] Cheongju Univ, Dept Unmanned Aircraft Syst, Cheongju 360764, South Korea
基金
新加坡国家研究基金会;
关键词
path planning; 3D A-star; NURBS; UAV; quadrotor; simulation; UNMANNED AERIAL VEHICLES; AVOIDANCE;
D O I
10.3390/aerospace12020085
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
Collision avoidance and path planning are essential for ensuring safe and efficient UAV operations, particularly in applications like drone delivery and Advanced Air Mobility (AAM). This study introduces an improved algorithm for three-dimensional path planning in obstacle-rich environments, such as urban and industrial areas. The proposed approach integrates the A* search algorithm with a customized heuristic function which incorporates local obstacle density. This modification not only guides the search towards more efficient paths but also minimizes altitude variations and steers the UAV away from high-density obstacle regions. To achieve this, the A* algorithm was adapted to output obstacle density information at each path node, enabling a subsequent refinement process. The path refinement applies a truncation algorithm that considers both path angles and obstacle density, and the refined waypoints serve as control points for Non-Uniform Rational B-Splines (NURBS) interpolation. This process ensures smooth and dynamically feasible trajectories. Numerical simulations were performed using a quadrotor model with integrated PID controllers in environments with varying obstacle densities. The results demonstrate the algorithm's ability to effectively balance path efficiency and feasibility. Compared to traditional methods, the proposed approach exhibits superior performance in high-obstacle-density environments, validating its effectiveness and practical applicability.
引用
收藏
页数:16
相关论文
共 50 条
  • [21] Uncertain moving obstacles avoiding method in 3D arbitrary path planning for a spherical underwater robot
    An, Ruochen
    Guo, Shuxiang
    Zheng, Liang
    Hirata, Hideyuki
    Gu, Shuoxin
    ROBOTICS AND AUTONOMOUS SYSTEMS, 2022, 151
  • [22] An integrated method of topological optimization and path design for 3D concrete printing
    Yang, Wenwei
    Wang, Li
    Ma, Guowei
    Feng, Peng
    ENGINEERING STRUCTURES, 2023, 291
  • [23] 3D Path Planning Method for UAV Based on Improved Artificial Potential Field
    Guo Y.
    Liu X.
    Zhang W.
    Yang Y.
    Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University, 2020, 38 (05): : 977 - 986
  • [24] 3D Path Planning of Unmanned Aerial Vehicle Based on Enhanced Sand Cat Swarm Optimization Algorithm
    Wang K.
    Si P.
    Chen L.
    Li Z.
    Wu Z.
    Binggong Xuebao/Acta Armamentarii, 2023, 44 (11): : 3382 - 3393
  • [25] UAV 3D Trajectory Planning and Optimization Using A* Algorithm Based on Free Space Method
    Li, Zhaoying
    Fei, Yuheng
    Shi, Ruoling
    UNMANNED SYSTEMS, 2024, 12 (03) : 457 - 476
  • [26] Optimization Algorithm for 3D Smooth Path of Robotic Arm in Dynamic Obstacle Environments
    Ren, Li
    Kang, Yiming
    Yang, Longfan
    Jia, Haitao
    Wang, Shaojiang
    APPLIED SCIENCES-BASEL, 2025, 15 (04):
  • [27] Path Planning Algorithm for Robot in 3D Environment Based on Neural Network
    Yu, Jianli
    Zhang, Qifeng
    Kroumov, Valeri
    Cheng, Siya
    Zhang, Zongwei
    INTELLIGENT ROBOTICS AND APPLICATIONS, PT I, PROCEEDINGS, 2008, 5314 : 1081 - +
  • [28] An algorithm for mobile robot path planning based on 3D grid map
    Cao, Q., 1600, Xi'an Jiaotong University (47): : 57 - 61
  • [29] 3D path planning for a robot based on improved ant colony algorithm
    Xingcheng Pu
    Chaowen Xiong
    Lianghao Ji
    Longlong Zhao
    Evolutionary Intelligence, 2024, 17 : 55 - 65
  • [30] 3D path planning for a robot based on improved ant colony algorithm
    Pu, Xingcheng
    Xiong, Chaowen
    Ji, Lianghao
    Zhao, Longlong
    EVOLUTIONARY INTELLIGENCE, 2024, 17 (01) : 55 - 65