摘要
为了提高路径规划效率,提出一种改进的分层路网的路径规划算法。首先,城市路网进行分层处理,以经典A*算法为核心,在高层路网上使用改进机制,评估函数做相应调整,然后,对其权值设置上下限阈值,提高算法的搜索精度及搜索效率。实验结果表明,规划的路径并非Dijkstra算法的最短,但是改进的算法使快速路段所占比例达90%以上,实际运行最优。
In order to improve the efficiency of path planning, an improved hierarchical path planning algorithm is been proposed on road network. First, classical A＊ algorithm as the core, urban road network is layered. Using an improved mechanism for high-level road network, the evaluation function is adjusted accordingly. Its weight is set upper and lower threshold to improve search accuracy and search efficiency. Experimental results show that the path planning length is not Dijkstra shortest, but the improved algorithm enables rapid road proportion is more than 90% and the actual operation of the optimum.
出处
《微型电脑应用》
2015年第1期59-61,共3页
Microcomputer Applications
基金
陕西省教育厅自然科学专项项目(NO.14JK1014)
安康学院高层次人才项目专项(NO.AYQDZR201204)
安康学院高层次人才项目专项(NO.AYQDZR201203)
安康学院教材建设基金项目(NO.Jc201307)
