计算机工程与应用 ›› 2025, Vol. 61 ›› Issue (20): 132-145.DOI: 10.3778/j.issn.1002-8331.2501-0092

• 路径规划专题 • 上一篇    下一篇

改进A*与APF的移动机器人路径规划算法研究

冯泽鹏,李宗刚,夏广庆,陈引娟   

  1. 1.兰州交通大学 机电工程学院,兰州 730070 
    2.兰州交通大学 机器人研究所,兰州 730070
    3.大连理工大学 工业装备结构分析优化与CAE软件全国重点实验室,辽宁 大连 116024
  • 出版日期:2025-10-15 发布日期:2025-10-15

Research on Improving A* and APF Algorithms for Mobile Robot Path Planning

FENG Zepeng, LI Zonggang, XIA Guangqing, CHEN Yinjuan   

  1. 1.School of Mechanical and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China
    2.Robot Institute, Lanzhou Jiaotong University, Lanzhou 730070, China
    3.State Key Laboratory of Structural Analysis, Optimization and CAE Software for Industrial Equipment, Dalian University of Technology, Dalian, Liaoning 116024, China
  • Online:2025-10-15 Published:2025-10-15

摘要: 针对A*路径规划算法在复杂环境中存在搜索效率受限及动态避障能力不足的问题,提出了一种改进A*算法与人工势场法相结合的路径规划方法。对静态障碍物进行预处理获取可视化通行节点,进而建立在空旷区域和障碍物区域分别采用三角形边界和三邻域的搜索机制,基于双向交替搜索策略实现了全局路径规划;将全局路径离散为等间距轨迹点,并引入人工势能函数将位于轨线上的动态障碍物影响区域建模为椭圆区域,利用机器人与前进方向最近轨迹点的距离作为斥力函数修正因子,将其与前进方向轨迹点吸引力的合力方向作为机器人避障方向,实现局部避障。仿真结果表明,所提算法与传统双向A*算法相比,搜索时间减少了96%,遍历节点数减少了82.28%,机器人在实现避障的同时沿着全局最优路径前行,从而验证了算法的有效性。

关键词: 移动机器人, 路径规划, 改进A*算法, APF算法, 动态避障

Abstract: Aiming at the problems of limited search efficiency and insufficient dynamic obstacle avoidance ability of A* path planning algorithm in complex environments, a path planning method combining improved A* algorithm and artificial potential field method is proposed. Firstly, the static obstacles are preprocessed to obtain visual passage nodes, and then the search mechanism of triangle boundary and three neighborhood is established in the open area and the obstacle area respectively, and the global path planning is realized based on the bidirectional alternating search strategy. Secondly, the global path is discretized into equally spaced trajectory points, and the influence area of dynamic obstacles on the trajectory line is modeled as an ellipse area by introducing the artificial potential energy function. The distance between the robot and the nearest trajectory point in the forward direction is used as the correction factor of the repulsion function, and the resultant force direction between the robot and the attraction of the trajectory point in the forward direction is used as the collision avoidance direction of the robot, and the local obstacle avoidance is achieved. The simulation results show that compared with the traditional bidirectional A* algorithm, the search time of the proposed algorithm is reduced by 96%, and the number of traversed nodes is reduced by 82.28%. The robot moves along the global optimal path while avoiding obstacles, which verifies the effectiveness of the algorithm.

Key words: mobile robot, path planning, improve A* algorithm, artificial potential field(APF)algorithm, dynamic obstacle avoidance