交通信息与安全2012，Vol.30Issue(3)：39-42,4.DOI:10.3963/j.ISSN1674-4861.2012.03.009
基于可视图和A*算法的连续模型路径搜索
Path Searching for Continuous Model Based on Visibility Graph and A* Algorithm
摘要
Abstract
Using the pedestrian traffic simulation environment for the shortest path search, this paper proposes a new shortest path search strategy of continuous topological model. Through the establishment of a visibility graph in continuous model, it uses the A" algorithm to search for a suitable pedestrian passage of the shortest path. Owing to improved visibility graph combined with the A" algorithm, the complexity of selecting the path and extension number of nodes in continuous mode is reduced. The algorithm is tested in an urban comprehensive transportation system, where structured numerical experiments are carried out on pedestrian path searching and navigation. The experimental results show that the algorithm is feasible and has higher efficiency and versatility.关键词
仿真/最短路径/视图/A*算法/连续模型Key words
simulation/ shortest path/ visibility graph/ A1 algorithm/ continuous model分类
信息技术与安全科学引用本文复制引用
陈彬,李靖靖,宋磊,李国威..基于可视图和A*算法的连续模型路径搜索[J].交通信息与安全,2012,30(3):39-42,4.基金项目
国家863计划项目(批准号:2007AA11Z124)、综合客运枢纽运营协调与安全保障技术及示范应用项目(批准号:2011318311200)资助 （批准号:2007AA11Z124）
