| 注册
首页|期刊导航|计算机工程与应用|基于自适应混沌变异粒子群算法的路径规划

基于自适应混沌变异粒子群算法的路径规划

国海涛 岳峻 苏庆堂

计算机工程与应用2012,Vol.48Issue(30):46-49,102,5.
计算机工程与应用2012,Vol.48Issue(30):46-49,102,5.DOI:10.3778/j.issn.1002-8331.2012.30.011

基于自适应混沌变异粒子群算法的路径规划

Novel path planning for robots based on adaptive chaos mutation operator particle swarm optimization algorithm

国海涛 1岳峻 2苏庆堂2

作者信息

  • 1. 山东商业职业技术学院信息技术学院,济南250103
  • 2. 鲁东大学信息科学与工程学院,山东烟台264025
  • 折叠

摘要

Abstract

A novel path planning for robots based on adaptive chaos mutation operator particle swarm optimization algorithm is presented. The first step is to make a new map. The improved particle swarm optimization algorithm is introduced to get a global optimized path. The algorithm takes advantage of adaptive chaos mutation operator to enhance the local search ability and keeps the swarm diversity. The result of simulation shows that this novel algorithm can plan an optimal path rapidly in a cluttered environment. The successful obstacle avoidance is achieved.

关键词

路径规划/粒子群算法/混沌变异/自适应

Key words

path planning/ particle swarm algorithm/ chaos mutation/ adaptive

分类

信息技术与安全科学

引用本文复制引用

国海涛,岳峻,苏庆堂..基于自适应混沌变异粒子群算法的路径规划[J].计算机工程与应用,2012,48(30):46-49,102,5.

基金项目

国家科技支撑计划项目(No.2011BAD20B01) (No.2011BAD20B01)

山东省自然科学基金(No.ZR2011GQ001) (No.ZR2011GQ001)

山东省科技发展计划项目(No.2011GGB01138). (No.2011GGB01138)

计算机工程与应用

OACSCDCSTPCD

1002-8331

访问量0
|
下载量0
段落导航相关论文