摘要
根据陆军武器系统对地图行军导航的特殊需求,提出了一种基于改进遗传算法的强边界路径规划算法。对强边界路径规划问题进行了分类,建立了强边界路径优化问题的数学模型,以分类必经点保序路径最优问题为例,从染色体的编码、种群的初始化和遗传算子等方面,加入了必经点保序的条件,设计了改进遗传算法,仿真结果证明了算法的有效性。
According to the special requirements of army weapon system for map marching navigation,A strong boundary path planning algorithm based on improved genetic algorithm is proposed.This paper classifies the strong boundary path planning.A mathematical model of the path optimization with strong boundary is established.Taking the problem of keeping the order path of the necessary points of classification as an example,From the aspects of chromosome coding,population initialization and genetic operators,the condition of order preserving by necessary points is added,and the improved genetic algorithm is designed.The simulation resules show that the algorithm is effective.
作者
冯培伦
于小洁
刘强
何龙
高丽华
FENG Pei-lun;YU Xiao-jie;LIU Qiang;HE Long;GAO Li-hua(The Second Military Representative Office in Taiyuan,Taiyuan 030006,China;The First Military Representative Office in Shijiazhuang,Shijiazhuang 050002,China;Military Representative Office in Xiangyang,Xiangyang 441005,China)
出处
《火力与指挥控制》
CSCD
北大核心
2020年第9期170-173,180,共5页
Fire Control & Command Control
关键词
遗传算法
路径规划
必经点保序
变异算子
强边界
genetic algorithm
path planning
order preservation by necessary points
mutation operator
strong boundary
