集成技术Issue(2)：68-77,10.
基于A*算法与自适应分片的大规模最优路径规划
Large Scale Route Planning A*Algorithm Based on Self-Adaptive Hierarchy Method
摘要
Abstract
The route planning engine has already become an important part for an online map system. The route planning algorithm is the key for the engine. The existing improvements for A*algorithm are mainly on the preprocessing part in which the roadmap data were layered statically. In this paper, an adaptive hierarchical method was proposed with an improved heuristic function which has goal-direction process. It greatly improves the efifciency and usability of A*algorithm in the engineering road planning system. The experiment result shows that the algorithm takes up only 42%of the search space and 13%of the search time when compared with the general A*algorithm.关键词
路径规划/A* 算法/自适应分层/方向启发式函数Key words
route planning/A*algorithm/self-adaptive hierarchy method/directional guiding heuristic function分类
矿业与冶金引用本文复制引用
郭耕辰,冯良炳,邓亮,赵永刚,刘宇..基于A*算法与自适应分片的大规模最优路径规划[J].集成技术,2014,(2):68-77,10.基金项目
国家自然科学基金项目(61070147)，深圳市科技研发资金基础研究计划(JC201105190951A)。 （61070147）
