计算机工程与应用2017，Vol.53Issue(20)：111-115,194,6.DOI:10.3778/j.issn.1002-8331.1604-0288
基于最优模式探测的改进遗传路径规划算法
Improved genetic path planning algorithm based on optimal schema probing mechanism
摘要
Abstract
Due to the shortcomings of traditional genetic path planning algorithm under complex environments,such as difficulty in repairing feasible path and the feature of premature convergence,an improved genetic algorithm based on optimum schema probing mechanism is presented.The novel algorithm has found that neighborhood searching can enhance the repair efficiency when combining it with middle-value insertion and waypoint backtracking;in addition,the operation that adaptively truncated mutation can improve the ability of space exploration; both hybrid multi-point crossover and schema optimization strategy can strengthen the optimization performance of algorithm.This method has been proved to be correct and valid in simulation experiment.关键词
路径规划/邻域搜索/局部截断变异/混杂多点交叉Key words
path planning/neighborhood searching/adaptively truncated mutation/hybrid multi-point crossover分类
信息技术与安全科学引用本文复制引用
李克伟,张丹丹,周之平..基于最优模式探测的改进遗传路径规划算法[J].计算机工程与应用,2017,53(20):111-115,194,6.基金项目
国家自然科学基金(No.41101426) （No.41101426）
江西省教育厅科学技术研究项目(No.GJJ150706) （No.GJJ150706）
江西省图像处理与模式识别重点实验室开放基金(No.TX201604001). （No.TX201604001）
