A~*算法改进研究  

A~* Algorithm Improvement Research

作　　者：邓圣乾 李宏伟[1] 赵家瑶 姜晶莉 DNEG Shengqian;LI Hongwei;ZHAO Jiayao;JIANG Jingli(Information Engineering University,Zhengzhou 450001,China)

机构地区：[1]信息工程大学

出　　处：《测绘与空间地理信息》2019年第10期210-212,共3页Geomatics & Spatial Information Technology

摘　　要：A*算法是运行速度最快的最短路径规划算法之一,在路径规划中得到广泛应用。本文以多值栅格为数据基础,对A*算法中的OPEN表的二叉堆数据结构进行改进——加入映射矩阵,以此加速二叉堆数组的更新速度。实验表明该改进在保证路径最短的前提下加快了算法的运行速度。The A*algorithm is one of the fastest running shortest path plan algorithms and is widely used in path planning.In this paper,for accelerating the update speed of the binary heap array,the mapping matrix is added to the binary heap to improve binary heap data structure of OPEN array in A*algorithm based on multi-value grid.Experiments show that the improvement speeds up the algorithm under the premise of ensuring the shortest path.

关 键 词：改进A*算法 二叉堆 映射矩阵 多值栅格 

分 类 号：P209[天文地球—测绘科学与技术]