首页 | 本学科首页   官方微博 | 高级检索  
     

基于改进粒子群算法的机器人路径规划方法
引用本文:张巧荣,李淑红. 基于改进粒子群算法的机器人路径规划方法[J]. 计算机工程与设计, 2008, 29(11): 2908-2911
作者姓名:张巧荣  李淑红
作者单位:河南财经学院,信息学院,河南,郑州,450002;河南财经学院,信息学院,河南,郑州,450002
摘    要:提出一种基于粒子群算法的机器人路径规划方法.将路径规划看作一个带约束的优化问题,约束条件为路径不能经过障碍物,优化目标为整个路径的长度最短.机器人工作空间中的障碍物描述为多边型,对障碍物的顶点进行编号.利用粒子群算法进行路径规划,每一个粒子定义为一个由零或障碍物顶点编号组成的集合,在粒子的迭代过程中考虑约束条件,惯性权重随迭代次数动态改变,使算法既有全局搜索能力也有较强的局部搜索能力.仿真结果表明该方法的正确性和有效性.

关 键 词:粒子群算法  群智能  路径规划  机器人  静态环境
文章编号:1000-7024(2008)11-2908-04
修稿时间:2007-06-06

Path planning for mobile robot based on improved particle swarm optimization
ZHANG Qiao-rong,LI Shu-hong. Path planning for mobile robot based on improved particle swarm optimization[J]. Computer Engineering and Design, 2008, 29(11): 2908-2911
Authors:ZHANG Qiao-rong  LI Shu-hong
Affiliation:ZHANG Qiao-rong,LI Shu-hong (Institute of Information,Henan University of Finance , Economics,Zhengzhou 450002,China)
Abstract:A new global path planning approach based on particle swarm optimization (PSO) for a mobile robot is presented. Consider path planning as an optimization problem with constraints. The constraints are the path can not pass by the obstacles and the optimization target is the distance of the path is shortest. The obstacles in the robot's environment are described as polygons and the vertexes of obstacles are numbered from 1 to n. The particle swarm optimization is used to get a global optimized path. Simulatio...
Keywords:particle swarm optimization  swarm intelligence  path planning  mobile robot  static known environment  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号