Nonlinear plant identifier using the multiple adaptive RBF network convex combinations

4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Due to its simplicity and robustness, the stochastic gradient (SG) algorithm has become a very popular learning algorithm for adaptive radial basis function (RBF) network filter. However, a difficulty is its inherent compromise between convergence speed and precision, that is imposed by the selection of a fixed value for the step sizes. In this paper, to solve the problem, we propose to generalize the views of the convex combination, which is combining multiple RBF filters (MCRBF) using the SG algorithm with different step sizes. Simulation works with nonlinear system identification have been carried out to illustrate the effectiveness of this approach. © 2012 Springer-Verlag GmbH.

Cite

CITATION STYLE

APA

Zeng, X., Zhao, H., & Jin, W. (2012). Nonlinear plant identifier using the multiple adaptive RBF network convex combinations. In Advances in Intelligent and Soft Computing (Vol. 169 AISC, pp. 185–191). https://doi.org/10.1007/978-3-642-30223-7_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free