基因修复技术及其在机器人路径规划中的应用

通过研究遗传算法，发现可以利用搜索其整个种群中的基因块来修复最好个体的基因缺陷；基因修复作为一种复制算子，它概括了经典交叉（如n点交叉或均匀交叉）和基因扫描，并且适用于任意（两个或更多）个父代，在机器人导航的路径规划中应用了此种算子，并且得到良好的结果。

Gene Repair Technology and Its Application to Path Planning of Robots

By investigating genetic algorithms, it is found to search the gene block in the whole population to repair the gene flaw of the best individual. Gene repair severs as a reproduction operator that generalizes classical crossovers, such as n-point crossover or uniform crossover, and gene scanning, and is applicable to an arbitrary number (two or more) of parents. The operator is applied to the path planning of the robot's navigation, and the experiment's result is better.