[1]梁静,宋慧,翟博阳,等.基于改进粒子群算法的路径优化问题研究[J].郑州大学学报(工学版),2014,35(01):34-38.[doi:10.3969/j.issn.1671-6833.2014.01.008]
　LIANG Jing,SONG Hui,QU Boyang,et al.Research of Path Planning Problems Based on Improved Particle Swarm Optimizer[J].Journal of Zhengzhou University (Engineering Science),2014,35(01):34-38.[doi:10.3969/j.issn.1671-6833.2014.01.008]
点击复制

基于改进粒子群算法的路径优化问题研究()
分享到：

《郑州大学学报(工学版)》[ISSN:1671-6833/CN:41-1339/T]

卷:
35
期数:
2014年01期
页码:
34-38
栏目:
出版日期:
2014-02-28

文章信息/Info

Title:
Research of Path Planning Problems Based on Improved Particle Swarm Optimizer
作者:
梁静; 宋慧; 翟博阳; 毛晓波
郑州大学电气工程学院,河南郑州,450001.中原工学院电子信息学院,河南郑州,450007
Author(s):
LIANG Jing;  SONG Hui;  QU Boyang;  MAO Xiaobo
1.School of Eleetrical Engineering, 2hengzhou tniversity, Zhengzhou 450001, China; 2. Sehool of Electrie and informationEngineering,Zhongyuan University of Technology, Zhengzhou 450007,China
关键词:
动态约束机制; 动态多组群粒子群优化算法; Bezier曲线
Keywords:
constraint mechanism: dynamie multi-swarm particle swarm oplimizer: bezier curves
DOI:
10.3969/j.issn.1671-6833.2014.01.008
文献标志码:
A
摘要:
把动态约束机制及改进的粒子群优化算法(含交叉策略的动态多组群粒子群优化算法)与Bez-ier曲线结合来实现路径优化.用三次Bezier曲线来描述路径,测试不同算法下得到的曲线在路径优化问题中的特性,通过比较得出不同算法的优劣性.实验结果表明:动态多组群粒子群优化算法克服了标准粒子群优化算法易于早熟和陷入局部最优的特点,动态约束提高了交叉策略下算法的寻优性能,能够灵活地处理约束条件,克服了以往静态惩罚函数的缺点.
Abstract:
This paper deseribes that dynamie constraint mechanism and improved Partiele Swarm Oplimizer(Dynamie Multi-Swarm Particle Swarm Optimizer with Crossover) are combined to solve path planning prob.lems combining with Bezier curves. Diflerent algorithms are used to test charaeteristies of the eurves in thepath planning proeess and Bezier curve is used to deseribe the path. The results show that the DMS-pS0 over-.comes the phenomenon of preeocious and easy convergenee compared with standard PSO, and constraint mech-anism improves performanee of the oplimization algorithm which is combined with erossover, ean deal with theconstraints fexibly and overeomes the shorteomings of statie penalty funetion.
更新日期/Last Update: