摘要
采用A*算法对已知环境中的移动机器人路径规划问题进行研究。利用栅格法建立环境模型,然后对节点的选择进行分析,最后通过MATLAB仿真。仿真结果表明算法能找到一条从起点到终点的较优路径,验证了算法的有效性。
Path planning for mobile robots is one of the core contents in the filed of robotics research.This article uses A-star algorithm to study the mobile robot path planning problem in known environment.The environment model is set up by grid method,the way to select the node is analyzed,and it is simulated by MATLAB.The results show that the algorithm could find the better path from starting point to target,being of effectiveness in path planning.
引文
[1]蒋新松.机器人学导论[M].沈阳:辽宁科学技术出版社,1994.
[2]张毅,罗元.移动机器人技术及其应用[M].北京:电子工业出版社,2007.
[3]韩长宇.足球机器人底层控制及路径规划[D].合肥:中国科学技术大学,2009:39-41.