六角网格条件下基于CA的最短路径分析  

Analysis of Shortest Path Based on Cellular Automation in Hexagon Grids

作　　者：李宗明 郭健[1] 缪坤 任志国 王宇君 LI Zongming;GUO Jian;MIAO Kun;REN Zhiguo;WANG Yujun(Information Engineering University, Zhengzhou 450001, China;31682 Troops, Lanzhou 730000, China;The Land Forces Special Operations Academy of PLA, Guilin 541002, China;31009 Troops, Beijing 100080, China)

机构地区：[1]信息工程大学,河南郑州450001 [2]31682部队,甘肃兰州730000 [3]陆军特种作战学院,广西桂林541002 [4]31009部队,北京100080

出　　处：《测绘科学技术学报》2021年第2期194-199,共6页Journal of Geomatics Science and Technology

摘　　要：元胞自动机CA的空间网格常采用四边形网格,很少采用六角网格。本文对原始矢量道路进行压缩后,在六角网格地形量化研究基础上克服六角网格显示和表达的缺点,制定了六角网格道路量化规则并生成了六角网格数据;依据该数据,构建了以六角网格为空间网格的元胞自动机模型;基于该模型求解了栅格数据形式下的最短路径分析问题;并与相同环境下A*算法路径搜索进行了简单比较,为兵棋推演系统或其他模拟仿真中的GIS空间分析和应用提供参考和解决方案。Quadrilateral grids are widely used as the spatial grids in CA,but hexagonal grids are seldom used.After compressing the original vector road data,the shortcomings of displaying and expression in hexagonal grid based on terrain quantification are overcome,the quantization rules of hexagonal grid road are formulated,and the hexagonal grid data is generated in the paper.Based on the data,a CA model with hexagonal grid is constructed.The shortest path of raster data is calculated,and the searching paths in CA model and the A*algorithm are compared.The experimental results show that the method can provide reference and solution for GIS spatial analysis and application in War-Game deduction systems or other simulation systems.

关 键 词：六角网格 道路压缩 路网数据 元胞自动机 最短路径 

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