HOPA: a near optimization algorithm for pathfinding

摘要：

Based on the classic Dijkstra algorithm, this paper introduces the decision mechanism of AI into pathfinding, proposes a heuristic optimistic pathfinding algorithm, HOPA, puts forward the conditions of getting optimum solution from this algorithm and further gives the proof. These two algorithms are tested contrastively, and the results show that the algorithm proposed in this paper may have a good prospect in some fields.

关键词： pathfinding navigateon heuristic Dijkstra

作者: WANG Jingcun WANG Qin CHEN Bin CHEN Heping

作者单位: Information Engineering School,University of Science and Technology Beijing,Beijing 100083,China Information Science and Engineering School,Wuhan University of Science and Technology,Wuhan 430081,C

会议类型: 国际会议

会议名称: 第二届IEEE无线通讯、网络技术暨移动计算国际会议

会议地点: 武汉

会议语种:英文

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