论文部分内容阅读
设计了用于包含交通约束的受限路网中基于兴趣点(PO I)的门到门包含重复节点的寻路算法。首先利用距离最短准则建立PO I和路网间的临时拓扑关系,然后根据受限路网中最优路径的结构特征,构造包含驶入路段的节点进行寻路拓展,以此为基础进行标记设定广度优先搜索,即可获得门到门包含重复节点的最优路径。在道路密度较大的北京市路网中的试验结果表明,该算法能够根据交通约束规划出实用的最优路径,对于长度约60 km路径的计算平均耗时在3 s左右,可以满足车辆导航应用的实时性要求。
A path-finding algorithm based on point-of-interest (POI) in a restricted network containing traffic constraints is proposed. Firstly, the shortest distance criterion is used to establish the temporary topological relationship between PO I and road network. Then, based on the structural characteristics of the optimal route in the restricted road network, For a breadth-first search, you can get the optimal path from a gate to a gate containing repeating nodes. The test results in Beijing road network with large road density show that this algorithm can be used to plan the practical optimal route according to the traffic constraints, and it takes about 3 seconds to calculate the average length of about 60 km in length, which can meet the needs of vehicle navigation Application of real-time requirements.