基于自适应混沌遗传算法的路径规划  

Path planning based on adaptive chaotic genetic algorithm

作　　者：胡喜玲[1] 李洪波[1] 胡俊[2] 

机构地区：[1]鲁东大学信息与电气工程学院,山东烟台264025 [2]南京师范大学数科院,南京210000

出　　处：《计算机工程与应用》2013年第9期68-73,共6页Computer Engineering and Applications

基　　金：山东省自然科学基金(No.ZR2010GM013);江苏省普通高校研究生科研创新计划立项项目(No.CXLX11_0864)

摘　　要：如何保证在未知复杂环境下规划出的机器人路径全局最优或较优一直是这一领域的一个研究难题,将混沌理论和遗传算法相结合,提出了一种新颖的基于自适应混沌遗传算法的机器人路径规划算法。利用信息熵产生初始群体,增加初始群体的多样性,将混沌优化的遍历特性引入遗传算法,以防止和克服进化过程中的"早熟"现象。仿真实验表明,即使在复杂的未知环境下,利用该算法也可以规划出一条全局优化路径,且能安全避碰。A difficult issue of robot path planning in a cluttered environment is that planned path is global optimal. A new robot path planning based on adaptive chaotic genetic algorithm is presented by integrating chaotic and genetic algorithm. This algo- rithm produces the initial colony by information entropy to increase the variety of the initial colony, and introduces the traversal characteristic of chaos optimization to the integrated genetic algorithm to prevent and overcome premature phenomena in the evolutionary process. Computer experimental results demonstrate that the proposed algorithm can be used to solve the path planning for mobile robot even in thecomplex unknown environment, and the successful obstacle avoidance is also achieved.

关 键 词：路径规划 遗传算法 混沌 自适应 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]