By Topic

On-line multivariable identification by adaptive RBF neural networks based on UKF learning algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Salahshoor, K. ; Dept. of Autom. & Instrum., Pet. Univ. of Technol., Tehran ; Kamalabady, A.S.

This paper deals with the problem of on-line model identification of multivariable processes with nonlinear and time-varying dynamic characteristics. In this respect, two adaptive learning approaches for multi-input, multi-output (MIMO) radial basis function (RBF) neural networks, i.e. growing and pruning algorithm for radial basis function (GAP-RBF) and minimal recourse allocation network (MRAN) are employed to identify MIMO time-varying nonlinear systems. The unscented Kalman filter (UKF) is proposed as a new learning algorithm for both GAP-RBF and MRAN approaches. Some desired modifications on the growing and pruning criteria in the original GAP-RBF have been proposed to make it more adequate in online identification. The performances of the algorithms are evaluated on a highly nonlinear and time-varying CSTR benchmark problem. Simulation results demonstrate the better performance of the modified GAP-RBF (MGAP-RBF) neural network with respect to the original GAP-RBF and MRAN algorithms.

Published in:

Control and Decision Conference, 2008. CCDC 2008. Chinese

Date of Conference:

2-4 July 2008