二次划分和改进遗传算法的机器人路径规划  

Path planning of robot based on second division and improved genetic algorithm

作　　者：崔靖[1] 朱庆保[1,2] 王娟[1] 

机构地区：[1]南京师范大学计算机科学与技术学院,南京210097 [2]江苏省信息安全保密技术工程研究中心,南京210097

出　　处：《计算机工程与应用》2011年第28期232-236,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(No.60673102);江苏省自然科学基金项目(No.BK2006218)~~

摘　　要：针对已有基于遗传算法的机器人路径规划的栅格建模方法粒度难以控制及种群初始化等方面的不足,提出了根据障碍物启发信息对环境二次划分的方法,以使得种群染色体长度具有自适应环境的特点,从而有效地提高算法的优化效率和性能,同时,提出了基于保险矩阵初始化种群新方法,可提高初始种群在搜索空间的遍历性和有效性。仿真实验结果表明:应用该算法,机器人可在具有复杂障碍物的环境中快速规划出一条全局优化路径,且能安全避障,效果显著。In robot path planning algorithms based on genetic algorithm, it is difficult that the granularity of grid cells is controlled according to the robot＇s environment,and population initialization have some shortages.Therefore an improved path planning algorithm is proposed.In the algorithm,the size of grid cells in robot＇s field is divided again according to the information of obstacles in the environment,which makes the length of chromosome in the population is more suitable to the environment, so as to improve the efficiency and performance of algorithm, at the same time, a new method based on insurance matrix to generate initial population is proposed, it can improve initial population＇s ergodicity and feasibility in the search space.The simulation shows that robot can not only plan a optimal path with rapid speed but also avoid collision safety using the algorithm in the complicated environment,and the results obtained are satisfactory.

关 键 词：遗传算法 环境二次划分 隐性基因 显性基因 保险矩阵 

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