基于黄金分割律选择算子的改进进化编程算法及其在机器人路径规划中的应用  

Improved Evolutionary Programming Based on Golden Section' Operator and Its Application to Path Planning of Robots

作　　者：李枚毅[1] 蔡自兴[1] 魏世勇[1] 

机构地区：[1]中南大学信息科学与工程学院,长沙410083

出　　处：《系统仿真学报》2001年第z1期187-190,共4页Journal of System Simulation

基　　金：国家自然科学基金(69974043);国家博士点基金(99053317);湖南省自然科学基金(99JJY20062)

摘　　要：通过分析及结合机器人路径规划的进化编程仿真实验指出,保存最优个体或淘汰最差个体都会引起进化算法早熟现象,并提出如下改进算法:按适应度从高(优)到低,依黄金分割律分别取出优秀和最差部分个体(染色体),通过赌轮法,并按适者生存原则从优秀的部分中选择一个体直接进入子代,而按劣者淘汰原则从最差部分中选择一个体从子代中排除。将改进算法运用于机器人路径规划,通过仿真实验检验了算法的有效性。It is shown by analysis of evolutionary programming algorithm and experiments of it in the path planning of robots that saving the fittest in every generation of evolutionary programming algorithm may be the source of prematurity convergence. A improving algorithm is put forward: By employing Golden Section we choose some high-fitness chromosomes in a generation, then according to the principle of survive of the fittest, by roulette wheel selection based on fitness, to get one from the chosen chromosomes, which will come into the next generation. On the other hand, according to the principle of eliminating of the bad, that which is chosen in some low-fitness chromosomes in the next generation will be excluded. The improving algorithm has been applied on the path planning of robots, and by emulational experiment the validity of it has been checked out.

关 键 词：进化编程 进化算子 黄金分割律 变异操作 机器人 路径规划 早熟现象 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]