IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4757-9545-5_16.html
   My bibliography  Save this book chapter

Limited-Complexity Polyhedric Tracking

In: Bounding Approaches to System Identification

Author

Listed:
  • H. Piet-Lahanier

    (SM Office National d’Etudes et de Recherches Aérospatiales, Direction des Études de Synthèse)

  • É. Walter

    (CNRS-École Supérieure d’Électricité, Laboratoire des Signaux et Systèmes)

Abstract

When the errors between the data and model outputs are affine in the parameter vector θ, the set of all values of θ such that these errors fall within known prior bounds is a polytope (under some identiflability conditions, which can be described exactly and recursively. However, this polytope may turn out to be too complicated for its intended use. In this chapter, an algorithm is presented for recursively computing a limited-complexity approximation guaranteed to contain the exact polytope. Complexity is measured by the number of supporting hyperplanes. The simplest polyhedric description that can thus be obtained is in the form of a simplex, but polyhedra with more faces can be considered as well. A polyhedric algorithm is also described for tracking time-varying parameters, which can accommodate both smooth and infrequent abrupt variations of the parameters. Both algorithms are combined to yield a limited-complexity polyhedric tracker.

Suggested Citation

  • H. Piet-Lahanier & É. Walter, 1996. "Limited-Complexity Polyhedric Tracking," Springer Books, in: Mario Milanese & John Norton & Hélène Piet-Lahanier & Éric Walter (ed.), Bounding Approaches to System Identification, chapter 16, pages 261-273, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4757-9545-5_16
    DOI: 10.1007/978-1-4757-9545-5_16
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4757-9545-5_16. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.