基于改进A^(*)算法的机器人路径规划  

Robot Path Planning Based on Improved A^(*)Algorithm

作　　者：苏畅[1] 张曼 SU Chang;ZHANG Man(School of Mechanical and Electrical Engineering,Anhui University of Science and Technology,Huainan Anhui 232000,China)

机构地区：[1]安徽理工大学机电工程学院,安徽淮南232000

出　　处：《兰州工业学院学报》2025年第1期103-106,共4页Journal of Lanzhou Institute of Technology

摘　　要：针对经典A^(*)算法对于喷射混凝土机器人在煤矿巷道作业中存在求解路径容易转向、轨迹耗时长、搜索节点多、路径转折安全性能低等路径规划问题,提出一种改进的A^(*)算法。首先对启发函数权重优化,然后删除冗余节点,最后通过三次B样条曲线法降低喷浆机器人的路径转折角度,增加机器人工作的安全性。仿真结果表明:与现有算法相比,所提方案寻路时间节省了30%左右,平均节点个数减少了39%左右。Aiming at the problems of the classical A^(*)algorithm in the path planning of shotcrete robot in coal mine roadway operation,such as easy path turning,long track time,multiple search nodes and low safety performance of path turning,an improved A^(*)algorithm is proposed.Firstly,the weights of heuristics function is optimized,then the redundant nodes are eliminated,and finally the path turning angle of the gunite robot is reduced by cubic B-spline curve method to increase the safety of the robot.Simulation results show that compared with the existing algorithms,the path-finding time of the proposed schemes is saved by approximately 30%and the average number of nodes is reduced by about 39%compared to existing algorithms.

关 键 词：路径规划 改进A^(*)算法 喷浆机器人 评价函数 

分 类 号：TP242.2[自动化与计算机技术—检测技术与自动化装置]