An Improved A* Algorithm in Path Planning

摘要：

Aimed to the path optimization problem, this paper considers these two elements: the path cost and timeconsuming to reduce the complexity of the planning issue and raise A* algorithm search efficiency, so that a searched path is more reasonable, and the practical is stronger.

关键词： component A * algorithm cost function the path optimization algorithm

作者: Bai Wenfeng Han Lina Shi Yunfeng

作者单位: The College of Electrical and Electronic Engineering, Changchun University of Technology No.2055 Yan The College of Electrical and Electronic Engineering, Changchun University of Technology No.2055 Yan

会议类型: 国际会议

会议名称: 2010 International Conference on Computer,Mechatronics,Control and Electronic Engineering(2010计算机、机电、控制与电子工程国际会议 CMCE 2010)

会议地点: 长春

会议语种:英文

页码: 235-237

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