A Simulation Study of A-star Algorithm for Robot Path Planning

摘要：

　　In this paper,two different heuristic functions of Astar algorithm are studied in robot path planning.In order to realize the A-star algorithm with C++ code,the array and heap data structures are used respectively.Simulation results verify that the A-star algorithm using heap data structure has less time complexity and the performance of A-star algorithm is better than that of Dijkstra algorithm in the aspect of time complexity and space complexity.

关键词： A-star algorithm path planning Dijkstra algorithm

作者: Shi-Gang Cui Hui Wang Li Yang

作者单位: Tianjin Key Laboratory of Information Sensing & Intelligent Control,Tianjin University of Technology and Education, Tianjin, China

会议类型: 国际会议

会议名称: 第16届机电一体化技术国际会议

会议地点: 天津

会议语种:英文

页码: 506-509

在线出版日期: 2012-10-16（万方平台首次上网日期，不代表论文的发表时间）