用方位角算法和转向角算法解决节点权重问题

论述了车辆导航系统中路线优化算法所研究的核心内容,并对由交叉口延误带来的节点权重问题进行了研究。针对以往算法的时间复杂度和空间复杂度高以及拓扑数据难以建立和实时更新的缺陷,构造了方位角算法和转向角算法以解决节点权重问题,并以北京市二环以内的典型路网为研究对象,对上述算法进行了实证研究。理论分析和实际运行的结果表明,这些算法有效地克服了以往解决方案的不足,大大提高了算法的计算速度,并可在各种交通管制措施的限制下,提供有效的路径规划方案。

Using Azimuth Algorithm and Turn-angle Algorithm to Solve Nodal Weight Problem

Route planning algorithm plays an important role in the route planning module of VNS.The authors concentrated on solving nodal weight problem which is brought out by intersection delays.Previous solutions to these problems,such as topology conversion methods and forward-pointed arcs methods,not only have deficiencies of high temporal and spatial complicacies,but also have shortcomings for the topological data difficult to be formed and be renewed in real time.The authors come up with an azimuth algorithm and a turn-angle algorithm to solve nodal weight problem.Theoretical analysis and practical tests in a road network in Beijing prove that these algorithms effectively overcome the shortcomings of the previous solutions and greatly improve the computational efficiency.The tests also prove that the algorithms can provide valid route planning solutions under various traffic management conditions.