首页> 外文会议>2011 IEEE International Symposium on Industrial Electronics >Comparison between heterogeneous ant colony optimization algorithm and Genetic Algorithm for global path planning of mobile robot
【24h】

Comparison between heterogeneous ant colony optimization algorithm and Genetic Algorithm for global path planning of mobile robot

机译:异构蚁群优化算法与遗传算法在移动机器人全局路径规划中的比较

获取原文

摘要

We proposed a novel ACO algorithm to solve the global path planning problems in the previous paper, called Heterogeneous ACO (HACO) algorithm. In this paper, we compare the performance of HACO algorithm with the modified Genetic Algorithm (GA) for global path planning. The HACO algorithm differs from the Conventional ACO (CACO) algorithm for the path planning in three respects. First, we proposed modified Transition Probability Function (TPF) and Pheromone Update Rule (PUR). Second, we newly introduced the Path Crossover (PC) in the PUR. Finally, we also proposed the first introduction of the heterogeneous ants in the ACO algorithm. We apply the proposed HACO algorithm and modified GA to the general global path planning problems and compare the performance of these through the computer simulation.
机译:在前一篇论文中,我们提出了一种新颖的ACO算法来解决全局路径规划问题,称为异类ACO(HACO)算法。在本文中,我们将HACO算法与改进的遗传算法(GA)进行全局路径规划的性能进行了比较。对于路径规划,HACO算法与常规ACO(CACO)算法在三个方面有所不同。首先,我们提出了改进的转移概率函数(TPF)和信息素更新规则(PUR)。其次,我们在PUR中新引入了路径交叉(PC)。最后,我们还提出了在ACO算法中首次引入异构蚂蚁。我们将提出的HACO算法和改进的GA应用于一般的全局路径规划问题,并通过计算机仿真比较它们的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号