Skip to main content

Identifiability and Informative Experiments in Open and Closed-Loop Identification

  • Chapter
Modeling, Estimation and Control

Abstract

This chapter takes a new look at the concept of identifiability and of informative experiments for linear time-invariant systems, both in open-loop and in closed-loop identification. Some readers might think that everything has been said and written about these concepts, which were much studied all through the 1970’s. We shared the same view ... until recently. The motivation for our renewed interest into these very fundamental questions is the recent surge of interest in the question of experiment design, itself triggered by the new concept of least costly identification experiment for robust control [3], [4], [5], [6]. Briefly speaking, least costly experiment design for robust control refers to achieving a prescribed accuracy at the lowest possible price, which is typically measured in terms of the duration of the identification experiment, the perturbation induced by the excitation signal, or any combination of these. In this context, questions like the following become relevant:

  1. 1.

    what is the smallest amount of external excitation that is required to achieve identifiability (or to achieve a given accuracy level)?

  2. 2.

    assuming that the system operates in closed-loop, is noise excitation sufficient to guarantee identifiability?

  3. 3.

    if noise excitation is not sufficient to guarantee identifiability in a closed-loop experiment, then how much additional reference excitation is required?

  4. 4.

    assuming that excitation can be applied at different entry points of a multi-input system operating in closed loop, is it necessary to excite each input to achieve identifiability (or to achieve a given accuracy level)?

To Giorgio, who to our great surprise has not solved the rather fundamental problems raised in this chapter, we hope to offer some food for thought.

This chapter presents research results of the Belgian Programme on Interuniversity Attraction Poles, initiated by the Belgian Federal Science Policy Office. The second author is also partially supported by the Brazilian Ministry of Education through CAPES.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. W. Bai and S. S. Sastry. Persistence of excitation, sufficient richness and parameter convergence in discrete time adaptive control. Systems and Control Letters, 6:153–163, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  2. A.S. Bazanella, M. Gevers, and L. Mišković. Closed-loop identification of MIMO systems: a new look at identifiability and experiment design. In To appear, European Control Conference, Kos, Greece, July 2007.

    Google Scholar 

  3. X. Bombois, G. Scorletti, M. Gevers, R. Hildebrand, and P.M.J. Van den Hof. Cheapest open-loop identification for control. In CD-ROM Proc. 33rd IEEE Conf on Decision and Control, pages 382–387, The Bahamas, December 2004.

    Google Scholar 

  4. X. Bombois, G. Scorletti, M. Gevers, P.M.J. Van den Hof, and R. Hildebrand. Least costly identification experiment for control. Automatica, 42(10):1651–1662, October 2006.

    Article  MATH  Google Scholar 

  5. M. Gevers, L. Mišković, D. Bonvin, and A. Karimi. Identification of multi-input systems: variance analysis and input design issues. Automatica, 42(4):559–572, April 2006.

    Article  MATH  MathSciNet  Google Scholar 

  6. H. Jansson and H. Hjalmarsson. Optimal experiment design in closed loop. In 16th IFAC World Congress on Automatic Control, paper 04528, July 2005.

    Google Scholar 

  7. T. Kailath. Linear Systems. Prentice-Hall, Englewood Cliffs, New Jersey, 1980.

    MATH  Google Scholar 

  8. V. Kučera. Discrete linear control: the polynomial approach. John Wiley, 1979.

    Google Scholar 

  9. L. Ljung. System Identification: Theory for the User, 2nd Edition. Prentice-Hall, Englewood Cliffs, NJ, 1999.

    Google Scholar 

  10. I.M.Y. Mareels and M. Gevers. Persistence of excitation criteria for linear, multivariable, time-varying systems. Mathematics of Control, Signals and Systems, 1(3):203–226, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  11. T. S. Ng, G. C. Goodwin, and B. D. O. Anderson. Identifiability of MIMO linear dynamic systems operating in closed loop. Automatica, 13:477–485, 1977.

    Article  MATH  Google Scholar 

  12. T. Söderström and P. Stoica. System Identification. Prentice-Hall International, Hemel Hempstead, Hertfordshire, 1989.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gevers, M., Bazanella, A.S., Mišković, L. (2007). Identifiability and Informative Experiments in Open and Closed-Loop Identification. In: Chiuso, A., Pinzoni, S., Ferrante, A. (eds) Modeling, Estimation and Control. Lecture Notes in Control and Information Sciences, vol 364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73570-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73570-0_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73569-4

  • Online ISBN: 978-3-540-73570-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics