首页> 外文会议>IEEE Congress on Evolutionary Computation >Research on autonomous moving robot path planning based on improved particle swarm optimization
【24h】

Research on autonomous moving robot path planning based on improved particle swarm optimization

机译:基于改进粒子群优化的自主移动机器人路径规划研究

获取原文

摘要

Two improved particle swarm optimization algorithms are given to overcome the defects in the commonly used particle swarm optimization. These are particle swarm optimization with nonlinear inertia weight and simulated annealing particle swarm optimization. The global search ability and local search accuracy can be optimized by introducing nonlinear inertia weight coefficients. It is well known that the particle swarm optimization has a problem that the algorithm is easily trapped into the local optimum. This paper shows that such a problem can be solved partially by combining the particle swarm optimization with simulated annealing algorithm. Autonomous moving robot path planning is given based on improved particle swarm optimization. The simulation results show the validity of the proposed improved algorithm in moving robot path planning.
机译:给出了两个改进的粒子群优化算法,以克服常用的粒子群优化中的缺陷。这些是具有非线性惯性重量和模拟退火粒子群优化的粒子群优化。可以通过引入非线性惯性重量系数来优化全局搜索能力和本地搜索精度。众所周知,粒子群优化具有问题,即算法容易被困到本地最佳状态。本文示出了通过将粒子群优化与模拟退火算法组合来部分地解决这种问题。基于改进的粒子群优化提供了自动移动机器人路径规划。仿真结果表明了提出的改进算法在移动机器人路径规划中的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号