道路网络分层的快速路径诱导算法

A Fast Route Guidance Algorithm based on the Layered Road Network

路径诱导在现代交通和部队机动过程中具有重要应用,传统路径诱导算法(如Dijkstra算法)具有很高的计算复杂度和搜索空间,所规划路径仅仅是数学意义上的最短路径,很难满足实际道路交通导航诱导要求。为了降低路径诱导算法的搜索空间,同时使得规划的结果更能体现驾驶人员行车偏好,提出一种基于道路网络分层的快速路径诱导算法,在利用道路网络中道路的不同等级特性对路网进行分层处理基础上,通过限制算法搜索区域达到快速路径规划的目的。实验结果表明,该算法解算出导航路径中大部分是由快速路段组成,能很好地满足驾驶人员的选路偏好,路径搜索时间和搜索空间也大大减少。

Route guidance system is important application in modern transmit and troop march. Traditional route guidance algorithm, such as Dijkstra＇s algorithm, has very height computing complexity and search space. It＇s planning route is just shortest route of mathematical meaning, and don＇t meet navigation need. To reduce the searching space of the algorithm, and make the guidance result more meeting driver＇s preference, a layered route guidance algorithm is proposed in the paper. Based on the different grade of the roads in a road networks, the algorithm processes the net by restricted searching area scenario to promote the searching efficiency. Experiment result shows that the proposed algorithm can work out optimal navigation route which is formed mostly by fast link, satisfy more driver＇s preference, and reduce search time and search space.