面向越野路径规划的多层次六角格网通行模型  

Multi-hierarchy hexagonal grid traffic model for off-road path planning

作　　者：陈占龙 吴贝贝[2] 王润 戴薇薇 徐道柱 马超[6,7] CHEN Zhanlong;WU Beibei;WANG Run;DAI Weiwei;XU Daozhu;MA Chao(School of Computer Science,China University of Geoscience,Wuhan 430078,China;National Engineering Research Center of Geographic Information System,Wuhan 430078,China;Key Laboratory of Geological Survey and Evaluation of Ministry of Education,China University of Geosciences,Wuhan 430074,China;Geological Environmental Center of Hubei Province,Wuhan 430034,China;School of Geography and Information Engineering,China University of Geoscience,Wuhan 430078,China;Xi'an Research Institute of Surveying and Mapping,Xi'an 710054,China;State Key Laboratory of Geo-Information Engineering,Xi'an 710054,China)

机构地区：[1]中国地质大学(武汉)计算机学院,湖北武汉430078 [2]国家地理信息系统工程技术研究中心,湖北武汉430078 [3]中国地质大学(武汉)地质探测与评估教育部重点实验室,湖北武汉430074 [4]湖北省地质环境总站,湖北武汉430034 [5]中国地质大学(武汉)地理与信息工程学院,湖北武汉430078 [6]西安测绘研究所,陕西西安710054 [7]地理信息工程国家重点实验室,陕西西安710054

出　　处：《测绘学报》2023年第9期1562-1573,共12页Acta Geodaetica et Cartographica Sinica

基　　金：国家自然科学基金(41871305);地质探测与评估教育部重点实验室主任基金;中央高校基本科研业务费(GLAB2022ZR06)

摘　　要：针对大规模越野环境中规划路径效率低下的问题,本文提出了一种面向越野路径规划的多层次六角格网通行模型,该模型能在缩减格网数据规模、保持规划路径合理性的同时,提升路径规划算法的执行效率。本文首先以六角格网单元为基础,设计通行能力量化规则,赋予每个格网相应的通行能力,构建普通六角格网通行模型;然后,建立多层次格网压缩规则,对通行模型中通行能力相似的邻接格网进行合并及重构格网邻接关系,生成含有不同层次格网的通行模型;最后,针对本文提出的多层次六角格网通行模型,设计了考虑坡度和地表覆盖要素的启发函数,进一步对A*路径规划算法进行了优化。试验表明,本文提出的多层次六角格网通行模型相较于普通六角格网通行模型,格网数量缩减了53.75%,路径规划所需时间降低了57%。Aiming at the low efficiency of path planning in a large-scale off-road environment,this paper proposes a multi-hierarchy hexagonal grid traffic model for off-road path planning.The model can improve the execution efficiency of the path planning algorithm while reducing the grid data scale and maintaining the rationality of the planned path.Based on the hexagonal grid unit,this paper designs the quantification rule of traffic capacity gives each grid the corresponding traffic capacity,constructs the traffic model of ordinary hexagonal grid,and then establishes the multi-hierarchy grid compression rules.The adjacent grids are merged,and the adjacent grid relationship is reconstructed to generate a traffic model containing different hierarchy of grids.Finally,according to the multi-hierarchy hexagonal grid traffic model proposed in this paper,a heuristic function considering the elements of slope and ground cover is designed,and the A*path planning algorithm is further optimized.Experiments show that the multi-hierarchy hexagonal grid traffic model proposed in this paper reduces the number of grids by 53.75%and the time required for path planning by 57%compared with the ordinary hexagonal grid traffic model.

关 键 词：越野路径规划 最短路径 六角格网 多层次 A*算法 通行模型 

分 类 号：P208[天文地球—地图制图学与地理信息工程]