动态规划在指路标志指引上的应用

Application of Dynamic Programming in the Guidance of Guiding Signs

复杂多元的城市路网以及数量繁多的指路标志,使得道路使用者的行驶路径多样,为了满足出行者能迅速、快捷地到达目的地,需找到一条综合权值最优的出行路径,再在其上设置指路标志对目的地进行指引。基于此,首先阐述了动态规划的基本概念和算法思想;然后以行驶路程作为出行者路径选择的因素,定义行驶路程最小的路径为最优路径;最后,以广州大学城路网为例,针对中山大学的指引,在明确起、终点的情况下,采用动态规划的方法找到前往中山大学的最优路径,验证了动态规划算法的有效性。

Complex and diverse urban road network and a large number of guiding signs make the road users have various driving paths. In order to meet the traveler's ability to reach the destination quickly and conveniently, it is necessary to find a travel path with the best comprehensive weight, and place guiding signs on it to guide the destination. Based on this, the basic concepts and algorithm ideas of dynamic programming are first expounded. Then, the driving route is taken as the factor of traveler's path selection, and the smallest travel path is defined as the optimal path. Finally, taking Guangzhou University Road Network as an example, for the guidance of Sun Yat-sen University, in the case of clear starting and ending points, using dynamic routing method to find the optimal path to Sun Yat-sen University, which verifies the effectiveness of the dynamic programming algorithm.