检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:白雄 鲁吉林 路宽[1] 陈鹏云[1] 崔俊杰[1] 刘泽华 BAI Xiong;LU Jilin;LU Kuan;CHEN Pengyun;CUI Junjie;LIU Zehua(School of Mechatronics Engineering,North University of China,Taiyuan 030051,China;Unit 32381 of Chinese People’s Liberation Army,Beijing 100072,China)
机构地区:[1]中北大学机电工程学院,太原030051 [2]中国人民解放军第32381部队,北京100072
出 处:《计算机工程与应用》2022年第18期311-317,共7页Computer Engineering and Applications
基 金:山西省高等学校科技创新项目(2020L0272);中北大学科学研究基金(XJJ201908);晋财教[2018]327号2018年第三批博士科研启动费(304/18001902)。
摘 要:标准A^(*)算法存在着无法考虑移动机器人运动特性及处理后的路径不利于移动机器人运动等问题。针对这一问题提出了一种新改进A^(*)算法,通过环境信息引入障碍物权重系数来改进算法的启发函数并进行全局路径规划;优化搜索节点的选取方式和设定障碍物与路径之间的安全距离;基于对移动机器人的运动特性的考虑优化其路径,并在不同环境地图中与其他算法进行仿真实验对比分析。相关实验表明:基于新改进A^(*)算法规划的路径始终与障碍物保持一定的安全距离;改进A^(*)算法在时间上相比标准A^(*)算法平均减少了80%,路径长度平均减少了2%,路径转角平均降低了82%。改进后算法相比其他算法在时间、搜索节点以及平滑度上有很大的改进,融合机器人环境信息和运动特性的规划路径算法可为移动机器人的路径规划提供一种新的方法。The standard A^(*) algorithm cannot consider the motion characteristics of the mobile robot and the processed path is not conducive to the motion of the mobile robot. In this study, a new improved A^(*) algorithm is proposed to solve this problem. The heuristic function of the algorithm is improved by introducing the weight coefficient of obstacles and the global path planning is carried out. The selection of search nodes is optimized and the safe distance between obstacles and paths is set. The path of the mobile robot is optimized based on the consideration of its motion characteristics, and the simulation experiment is compared with other algorithms in different environment maps. Relevant experiments show that the planned path based on the new improved A^(*) algorithm always keeps a certain safe distance from the obstacle. Compared with the standard A^(*) algorithm, the time of the improved A^(*) algorithm is reduced by 80% on average, while the path length is reduced by 2% on average, and the path corner is reduced by 82% on average. Compared with other algorithms, the improved algorithm has a great improvement in time, search nodes and smoothness. The path planning algorithm integrating robot motion characteristics can provide a new method for path planning of mobile robots.
关 键 词:改进A^(*)算法 FLOYD算法 移动机器人 运动特性 路径规划
分 类 号:TP242.6[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222