• DocumentCode
    3431322
  • Title

    Polynomial model tree (POLYMOT) — A new training algorithm for local model networks with higher degree polynomials

  • Author

    Bänfer, Oliver ; Nelles, Oliver

  • Author_Institution
    Dept. of Mech. Eng., Univ. of Siegen, Siegen, Germany
  • fYear
    2009
  • fDate
    9-11 Dec. 2009
  • Firstpage
    1571
  • Lastpage
    1576
  • Abstract
    A new training algorithm for nonlinear system identification with local models of higher polynomial degree is presented in this paper. Usually the local models are linearly parameterized and those parameters are typically estimated by some least squares approach. For the utilization of higher degree polynomials this procedure is no longer feasible since the amount of parameters grows rapidly with the number of physical inputs and the polynomial degree. Thus a new learning strategy with the aid of stepwise regression is developed to estimate only the most significant parameters. The included partitioning algorithm which is based on the LOLIMOT algorithm decides in each step between increasing the number of parameters of the worst local model and splitting this model to create two new ones. A comparison of a LOLIMOT and POLYMOT trained exhaust emission model shows the benefits of the proposed new learning strategy.
  • Keywords
    nonlinear control systems; polynomials; regression analysis; trees (mathematics); POLYMOT; learning strategy; local model network; nonlinear system identification; partitioning algorithm; polynomial degree; polynomial model tree; stepwise regression; training algorithm; Automatic control; Automation; Fuzzy logic; Interpolation; Least squares approximation; Nonlinear control systems; Nonlinear systems; Parameter estimation; Partitioning algorithms; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control and Automation, 2009. ICCA 2009. IEEE International Conference on
  • Conference_Location
    Christchurch
  • Print_ISBN
    978-1-4244-4706-0
  • Electronic_ISBN
    978-1-4244-4707-7
  • Type

    conf

  • DOI
    10.1109/ICCA.2009.5410547
  • Filename
    5410547