Adaptive sigmoidal plant identification using reduced sensitivity recursive least squares Articles uri icon

publication date

  • April 2011

start page

  • 1066

end page

  • 1070

issue

  • 4

volume

  • 91

International Standard Serial Number (ISSN)

  • 0165-1684

Electronic International Standard Serial Number (EISSN)

  • 1872-7557

abstract

  • Logistic models, comprising a linear filter followed by a nonlinear memoryless sigmoidal function, are often found in practice in many fields, e.g., biology, probability modelling, risk prediction, forecasting, signal processing, electronics and communications, etc., and in many situations a real time response is needed. The online algorithms used to update the filter coefficients usually rely on gradient descent (e.g., nonlinear counterparts of the Least Mean Squares algorithm). Other algorithms, such as Recursive Least Squares, although promising improved characteristics, cannot be directly used due to the nonlinearity in the model. We propose here a modified Recursive Least Squares algorithm that provides better performance than competing state of the art methods in an adaptive sigmoidal plant identification scenario.