本文已被：浏览 1387次 下载 1977次
Received:November 25, 2014 Revised:January 12, 2015
Received:November 25, 2014 Revised:January 12, 2015
中文摘要: 针对机器人在已知静态工作环境中运动路径的快速选择和判优, 提出一种改进蚁群优化算法. 该算法首先对机器人的静态工作空间进行凸策略处理, 从环境上降低了搜索的盲目性和落入陷阱的可能性, 并在此基础上加入一种优胜劣汰策略, 进一步提高了算法的时间性能、最佳性能和鲁棒性. 实验结果表明改进的蚁群优化算法不仅克服了易于陷入局部最优解及运算量大的缺陷, 而且也大幅度提高了算法的运算效率.
Abstract:An improved ant colony optimization based on convex policy and the survival of the fittest strategy for robot path planning is proposed in this paper. This algorithm first use convex policy to process the robot's static workspace, and it can reduce the blindness of searching and the possibility of falling into the trap in environment. In addition, a survival of the fittest strategy is added in the ant colony optimization to further improve the performance of the algorithm time, optimum performance and robustness. Experimental results show that the improved ant colony optimization not only can overcome the defect of easy to fall into local optimal solution, but also can improve the operation efficiency.
文章编号： 中图分类号： 文献标志码：
基金项目:河南省教育厅科学技术研究重点项目(14B520039);校青年科研基金项目(PXY-QNJJ-2014004)
引用文本：
鲍义东,夏栋梁,赵伟艇.基于凸策略优胜劣汰蚁群算法的机器人路径规划.计算机系统应用,2015,24(8):122-127
BAO Yi-Dong,XIA Dong-Liang,ZHAO Wei-Ting.Robot Path Planning Based on Ant Colony Optimization Convex Fittest Strategy.COMPUTER SYSTEMS APPLICATIONS,2015,24(8):122-127
鲍义东,夏栋梁,赵伟艇.基于凸策略优胜劣汰蚁群算法的机器人路径规划.计算机系统应用,2015,24(8):122-127
BAO Yi-Dong,XIA Dong-Liang,ZHAO Wei-Ting.Robot Path Planning Based on Ant Colony Optimization Convex Fittest Strategy.COMPUTER SYSTEMS APPLICATIONS,2015,24(8):122-127
