计算机工程与应用Issue(7)：225-229,5.DOI:10.3778/j.issn.1002-8331.1304-0167
基于分层的改进A*算法在路径规划中的应用
Application of improved A* algorithm based on hierarchy for route planning
摘要
Abstract
Intelligent transportation route guidance system can greatly improve the efficiency and experience of travel. Classic A* algorithm to focus only on the search precision while ignoring the search efficiency, this paper introduces a improved high-level A* algorithm based on Hierarchy of the urban road network, evaluation function with different weightings for different nodes in the road network, meanwhile it sets an upper and lower limiting threshold value of the weight to balance the efficiency and accuracy of search. The experiments show that this shortest path is though not the shortest conventional length but the real travel time optimal.关键词
路径规划/最短路径算法/道路网络分层/Dijkstra算法/A*算法Key words
route planning/shortest path algorithm/hierarchical route network/Dijkstra algorithm/A*algorithm分类
信息技术与安全科学引用本文复制引用
钱红昇,葛文锋,钟鸣,葛铭..基于分层的改进A*算法在路径规划中的应用[J].计算机工程与应用,2014,(7):225-229,5.基金项目
国家自然科学基金（No.61273101）。 （）
