A Path Planning Algorithm Based on Dynamic Networks and Restricted Searching Area

摘要：

This paper simplifies the discrete-time dynamic networks model according to the realistic character of the urban traffic systemproposes one kind of A* algorithm based on restricted searching area (RA*) to compute the fastest path, analyzes the performance of RA* and validates its efficiency with contrast to other routing planning algorithms.

关键词： Discrete-time dynamic networks A* algorithm Fastest path Restricted searching area

作者: Mengyin Fu Bin Xue

作者单位: Department of Automatic Control Beijing Institute of Technology Beijing, 100081,China

会议类型: 国际会议

会议名称: 2007 IEEE International Conference on Automation and Lofistics

会议地点: 山东济南

会议语种:英文

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