基于可视图和A~＊算法的连续模型路径搜索

针对交通枢纽仿真领域中行人最短路径搜索环境建模难的问题,提出一种基于可视图的连续拓扑模型最短路径搜索策略,通过在连续模型下建立可视图并使用A*算法搜索出一条适合行人通行的最短路径,将改进的可视图算法和A*算法结合,降低连续模型中自动选择路径复杂度和扩展结点数目.将该算法应用于城市综合客运枢纽功能与结构数值实验系统对行人对象进行路径搜索导航,实验结果证明此算法可行且具有更高的效率和通用性.

Path Searching for Continuous Model Based on Visibility Graph and A* Algorithm

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.