可预测动态时空环境的最短时间路径规划  

The Shortest Time Path Planning for the Predictable Dynamic Space-time Environment

作　　者：吴传均 管凌霄 夏青[1] 陈刚[1] 董远 WU Chuanjun;GUAN Lingxiao;XIA Qing;CHEN Gang;DONG Yuan(Information Engineering University, Zhengzhou 450001, China;61206 Troops, Beijing 100000, China;61618 Troops, Beijing 100000, China)

机构地区：[1]信息工程大学,河南郑州450001 [2]61206部队,北京100000 [3]61618部队,北京100000

出　　处：《测绘科学技术学报》2021年第3期316-322,共7页Journal of Geomatics Science and Technology

摘　　要：最短时间路径规划是一种典型的最小代价路径规划,也是GIS领域中非常重要的一项研究。传统算法较少研究包括气象、光照、电磁等随时间连续变化环境下的全局规划问题。针对这个问题,建立动态时空环境影响模型,对动态环境在时间和空间上的变化进行统一栅格化表达,并以此为基础进行全局最优的最小代价路径规划。实验证明,在环境预测准确的情况下,该算法规划结果能够体现动态环境变化带来的影响,其规划路线的真实时间消耗总是小于或等于传统静态规划算法,且计算量与传统算法相当。The shortest time path planning is an important application of the least cost path planning,as well as a very important research in the GIS field.However,in traditional algorithms,there are only a few studies on the global planning problem in the dynamic environment which is changing with time,such as meteorology,illumination,and electromagnetism.To solve this problem,a dynamic spatio-temporal environment influence expression model is established to express the change of dynamic environment in time and space uniformly,and on this basis,the traditional path search algorithm is adopted to carry out the global optimal path planning of minimum cost.Experimental results show that in the case of actual occurrence of the predicted dynamic environment,the planning result of the algorithm can reflect the planning influence brought by the change of dynamic environment,and the actual consumption of the planning result is always less than or equal to that of the traditional static programming algorithm,and the calculation amount is equivalent to that of the traditional algorithm.

关 键 词：最小代价路径规划 动态环境 时空模型 地理信息系统 越野路径规划 

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