针对机器人路径规划问题的改进型遗传算法  

Robot Path Planning Based on Improved Genetic Algorithm

作　　者：王红[1] 周越[1] 

机构地区：[1]沈阳理工大学信息学院,辽宁沈阳110168

出　　处：《沈阳师范大学学报（自然科学版）》2009年第3期335-337,共3页Journal of Shenyang Normal University:Natural Science Edition

基　　金：国家"863计划"项目(2003AA411340)

摘　　要：针对路径规划的"求解质量"和"求解效率"2个问题,在传统遗传操作的基础上,通过在遗传操作中加入优化算子,减少了搜索的盲目性,使得优秀个体能较快地产生,算法在很少的进化代数中就可以求出问题最优解。算法的分析和仿真试验表明,算法的改进是有效的。The quality and efficiency of calculation are the two puzzling problems in applying genetic algorithm. Based on the traditional genetic algorithm, we add several improved genetic operators in the optimistic algorithm of the robot path planning. The result is that excellent individual can be produced in less iteration. As it is proved by analysis and test, a better result is obtained by the improvd genetic algorithm.

关 键 词：机器人 路径规划 遗传算法 

分 类 号：TP242[自动化与计算机技术—检测技术与自动化装置]