Particle Swarm Optimization Algorithm Based on Robust Control of Random Discrete Systems

被引:0
作者
Yang, Le [1 ]
He, Dakuo [1 ]
Wang, Qingkai [2 ,3 ,4 ]
Luo, Jiahuan [1 ]
Huang, Yingjie [1 ]
Zhen, Zipeng [1 ]
机构
[1] Northeastern Univ, Coll Informat Sci & Engn, Shenyang 110004, Liaoning, Peoples R China
[2] Beijing Gen Res Inst Min & Met, Beijing 100160, Peoples R China
[3] Beijing Key Lab Proc Automat Min & Met, Beijing 100160, Peoples R China
[4] State Key Lab Proc Automat Min & Met, Beijing 100160, Peoples R China
来源
2017 4TH INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND CONTROL ENGINEERING (ICISCE) | 2017年
基金
中国国家自然科学基金;
关键词
Particle swarm optimization; stochastic factors; robust control; discrete stochastic control system; robust controllability analysis; CONVERGENCE;
D O I
10.1109/ICISCE.2017.227
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Particle swarm optimization (PSO) algorithm is a random search method based on population evolution. At present, most of the convergence and search stability of the study are using a method of analyzing deterministic systems. Although these studies have achieved fruitful results, but they ignore the randomness of the PSO algorithm which is the most important feature. The complexity and uncertainty of the algorithm is due to the existence of random factors. This paper considers the stochastic factors of the PSO algorithm, from the point of view of stochastic system robust control, a novel PSO algorithm model based on discrete stochastic control system is proposed. Then the robust controllability analysis of the model is carried out, and the robust controllable condition and control law are obtained. Based on this, a new particle swarm optimization algorithm, named particle swarm optimization algorithm based on random robust control is proposed. The simulation results verify the effectiveness of proposed algorithm.
引用
收藏
页码:1089 / 1093
页数:5
相关论文
共 16 条
[1]  
Abdelbar AM, 2005, IEEE IJCNN, P1086
[2]  
[Anonymous], 2001, An Analysis of Particle Swarm Optimizers'
[3]   The particle swarm - Explosion, stability, and convergence in a multidimensional complex space [J].
Clerc, M ;
Kennedy, J .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (01) :58-73
[4]  
Coello CAC, 2003, LECT NOTES COMPUT SC, V2606, P398
[5]   Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm [J].
Jiang, M. ;
Luo, Y. P. ;
Yang, S. Y. .
INFORMATION PROCESSING LETTERS, 2007, 102 (01) :8-16
[6]  
Kennedy J, 2003, SMCIA/03: PROCEEDINGS OF THE 2003 IEEE INTERNATIONAL WORKSHOP ON SOFT COMPUTING IN INDUSTRIAL APPLICATIONS, P45
[7]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[8]  
Lyschevski S. E., 2003, P IEEE C NAN
[9]   The fully informed particle swarm: Simpler, maybe better [J].
Mendes, R ;
Kennedy, J ;
Neves, J .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2004, 8 (03) :204-210
[10]  
Miranda V, 2003, P AS PAC IEEE PEST S, P132