LS-SVM based neural controller as optimized by particle swarm algorithm using dual heuristic dynamic programming

The dual heuristic programming (DHP) approach has a superior ability for solving approximate dynamic programming problems in adaptive critic designs (ACD). The common approaches applied in the DHP are design the multilayer feedforward neural networks (MLFNN) as the differential model of the plant fo...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2009 International Joint Conference on Neural Networks s. 903 - 908
Hlavní autoři: Si-Yao Fu, Guo-Sheng Yang, Zeng-Guang Hou
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2009
Témata:
Convergence
Dynamic programming
Feedforward neural networks
Heuristic algorithms
Least squares approximation
Least squares methods
Multi-layer neural network
Neural networks
Particle swarm optimization
Support vector machines
ISBN:142443548X, 9781424435487
ISSN:2161-4393
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The dual heuristic programming (DHP) approach has a superior ability for solving approximate dynamic programming problems in adaptive critic designs (ACD). The common approaches applied in the DHP are design the multilayer feedforward neural networks (MLFNN) as the differential model of the plant for training the critic and action networks. However, the problems of overfitting and premature convergence to local optima usually pose great challenges in the practice of MLFNNs during the training procedure. In this paper a least squares support vector machine (LS-SVM) regressor optimized by particle swarm algorithm (PSO) is proposed for generating the control actions and the learning rules for the critic and action networks. PSO is introduced to select the LS-SVM's hyper-parameters. The introduction of the SVM based training mechanism imparts the developed algorithm with inherent capacity for combating the overfitting problem as well as showing relatively high efficiency in converging to the optima. Simulation on the balancing of a cart pole plant shows that the proposed learning strategy is verified as faster convergence and higher efficiency as compared to traditional BP based adaptive dynamic programming approaches.
ISBN:142443548X
9781424435487
ISSN:2161-4393
DOI:10.1109/IJCNN.2009.5178668