三维机器人路径规划的一种变异算子蚁群算法  

A Mutation Operator Ant Colony Algorithm to Three-Dimensional Path Planning of Robots

作　　者：李向军[1] 霍艳丽[1] 曾勍炜[2] 徐鹰[2] 

机构地区：[1]南昌大学信息工程学院,江西南昌330031 [2]南昌大学网络中心,江西南昌330031

出　　处：《计算机仿真》2015年第2期364-368,394,共6页Computer Simulation

基　　金：国家自然科学基金项目(1367014;61262049);江西省自然科学基金项目(20142BAB207011;20142BAB217016);江西省青年科学家培养计划项目(20112BCB23004);江西省科技支撑计划重点项目(20111BBE50008);江西省教育厅科技计划项目(GJJ14770)

摘　　要：研究三维空间机器人路径规划问题,由于系统求解时间较长、过早失去解的多样性、易陷入局部最优、个体适应度较差等问题,通过构建三维工作空间模型、引入变异算子和搜索无碰路径策略来解决,提出适宜于三维机器人路径规划的一种变异算子蚁群算法(Mutation Operator Ant Colony Algorithm,MOACA)。MOACA是一种关于模型构造的启发式搜索算法,算法在改进启发式函数设计、选择概率确定、信息素更新策略等基础上,引入逆转变异和插入变异算子,通过选择逆转点反序排列部分路径节点和随机插入路径节点的方法搜索无碰路径,对蚁群算法进行了局部优化改良。仿真结果表明,MOACA在搜索路径、收敛时间、适应度等方面较传统蚁群算法有明显改善,算法是有效可行的。In view of the robot path planning in 3D space, there are so many problems, such as long computa- tion, early loss of the solution diversity, easy to fall into local optimum, and poor individual fitness. To solve these problems, the Mutation Operator Ant Colony Algorithm（MOACA） is a good solution. The MOACA is made up of constructing 3D workspace model, introducing mutation operator and the strategy of searching non -collision path. Based on the construct of the model, MOACA is a heuristic search algorithm. It introduces reversal mutation and in- sertion mutation operator on the basis of the improved heuristic function design, selects probability and pheromone updating strategy. Through selecting turning point to array the nodes in reverse order and inserting random nodes to find the non - collision path, the optimization of ant colony algorithm is partly improved. The simulations show that the MOACA not only has good effectiveness and feasibility, but also is improved in the areas of path length, conver- gence speed and fitness.

关 键 词：三维路径规划 变异算子 逆转变异 插入变异 蚁群算法 

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