一种复杂地理环境越野通行路径寻优算法

摘要

设计了基于障碍距离的优化算法,解决突发事件应急联动中复杂地理环境下最短路径的寻优求解问题.在详细分析地理空间高程、坡度、障碍物等空间信息的基础上,通过计算搜索空间、搜索方向和网络弧段权值构建网络拓扑关系网,并利用遗传算法对最优路径进行寻优求解.%The optimization algorithm based on distance obstacle is designed to solve the shortest path optimization problem in the emergency linkage and complex geographical environment in this paper.This method is based on the detailed analysis of geographical spatial elevation,slope,obstacle and other spatial information.One kind of topology net is constructed using the calculation of search space,search direction and network arc weights.Finally,the optimal path is optimized by means of the genetic algorithm.