Loughborough University
Browse
aklm.r2.pdf (707.4 kB)

Online modeling with tunable RBF network

Download (707.4 kB)
journal contribution
posted on 2017-06-30, 12:32 authored by Hao Chen, Yu GongYu Gong, Xia Hong
In this paper, we propose a novel online modeling algorithm for nonlinear and nonstationary systems using a radial basis function (RBF) neural network with a fixed number of hidden nodes. Each of the RBF basis functions has a tunable center vector and an adjustable diagonal covariance matrix. A multi-innovation recursive least square (MRLS) algorithm is applied to update the weights of RBF online, while the modeling performance is monitored. When the modeling residual of the RBF network becomes large in spite of the weight adaptation, a node identified as insignificant is replaced with a new node, for which the tunable center vector and diagonal covariance matrix are optimized using the quantum particle swarm optimization (QPSO) algorithm. The major contribution is to combine the MRLS weight adaptation and QPSO node structure optimization in an innovative way so that it can track well the local characteristic in the nonstationary system with a very sparse model. Simulation results show that the proposed algorithm has significantly better performance than existing approaches.

Funding

This work was supported by the UK Engineering and Physical Sciences Research Council and DSTL under Grant EP/H012516/1.

History

School

  • Mechanical, Electrical and Manufacturing Engineering

Published in

IEEE Transactions on Systems, Man and Cybernetics Part B: Cybernetics

Volume

99

Pages

1 - 13

Citation

CHEN, H., GONG, Y. and HONG, X., 2012. Online modeling with tunable RBF network. IEEE Transactions on Cybernetics, 43 (3), pp. 935-947.

Publisher

© IEEE

Version

  • AM (Accepted Manuscript)

Publication date

2012

Notes

© 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.

ISSN

2168-2267

eISSN

2168-2275

Language

  • en