Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Recursive Algorithms for Identification in Closed Loop - A Unified Approach and Evaluation
 
research article

Recursive Algorithms for Identification in Closed Loop - A Unified Approach and Evaluation

Landau, Ioan Doré
•
Karimi, Alireza  
1997
Automatica

A unified presentation of recursive algorithms for plant model identification in closed loop is given. From the basic formulation of the problem of finding the plant model that gives the best predictor for the closed-loop system, two families of algorithms using either a reparameterized predictor for the closed loop or a plant predictor operating on filtered data are presented, and their asymptotic properties are examined. Validation tests for the models identified in closed loop are proposed. A comparative evaluation of the various algorithms in simulation and on real-time experiments concludes the paper.

  • Files
  • Details
  • Metrics
Type
research article
DOI
10.1016/S0005-1098(97)00061-7
Author(s)
Landau, Ioan Doré
Karimi, Alireza  
Date Issued

1997

Published in
Automatica
Volume

33

Issue

8

Start page

1499

End page

1523

Subjects

Identification algorithms

•

closed-loop identification

•

validation

•

robustness

•

stability

•

convergence

Editorial or Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
LA  
Available on Infoscience
September 21, 2007
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/12378
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés