Solving nonlinear optimal control problems using a hybrid IPSO–SQP algorithm

A hybrid algorithm by integrating an improved particle swarm optimization (IPSO) with successive quadratic programming (SQP), namely IPSO–SQP, is proposed for solving nonlinear optimal control problems. The particle swarm optimization (PSO) is showed to converge rapidly to a near optimum solution, b...

Full description

Saved in:
Bibliographic Details
Published inEngineering applications of artificial intelligence Vol. 24; no. 3; pp. 476 - 484
Main Authors Modares, Hamidreza, Naghibi Sistani, Mohammad-Bagher
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.04.2011
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:A hybrid algorithm by integrating an improved particle swarm optimization (IPSO) with successive quadratic programming (SQP), namely IPSO–SQP, is proposed for solving nonlinear optimal control problems. The particle swarm optimization (PSO) is showed to converge rapidly to a near optimum solution, but the search process will become very slow around global optimum. On the contrary, the ability of SQP is weak to escape local optimum but can achieve faster convergent speed around global optimum and the convergent accuracy can be higher. Hence, in the proposed method, at the beginning stage of search process, a PSO algorithm is employed to find a near optimum solution. In this case, an improved PSO (IPSO) algorithm is used to enhance global search ability and convergence speed of algorithm. When the change in fitness value is smaller than a predefined value, the searching process is switched to SQP to accelerate the search process and find an accurate solution. In this way, this hybrid algorithm may find an optimum solution more accurately. To validate the performance of the proposed IPSO–SQP approach, it is evaluated on two optimal control problems. Results show that the performance of the proposed algorithm is satisfactory.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0952-1976
1873-6769
DOI:10.1016/j.engappai.2010.08.002