IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v103y1999i3d10.1023_a1021727806358.html
   My bibliography  Save this article

(A, B)-Invariant Polyhedral Sets of Linear Discrete-Time Systems

Author

Listed:
  • C. E. T. Dórea

    (Universidade Federal de Bahia, Salvador)

  • J. C. Hennet

    (Centre National de la Recherche Scientifique)

Abstract

The problem of confining the trajectory of a linear discrete-time system in a given polyhedral domain is addressed through the concept of (A, B)-invariance. First, an explicit characterization of (A, B)-invariance of convex polyhedra is proposed. Such characterization amounts to necessary and sufficient conditions in the form of linear matrix relations and presents two major advantages compared to the ones found in the literature: it applies to any convex polyhedron and does not require the computation of vertices. Such advantages are felt particularly in the computation of the supremal (A, B)-invariant set included in a given polyhedron, for which a numerical method is proposed. The problem of computing a control law which forces the system trajectories to evolve inside an (A, B)-invariant polyhedron is treated as well. Finally, the (A, B)-invariance relations are generalized to persistently disturbed systems.

Suggested Citation

  • C. E. T. Dórea & J. C. Hennet, 1999. "(A, B)-Invariant Polyhedral Sets of Linear Discrete-Time Systems," Journal of Optimization Theory and Applications, Springer, vol. 103(3), pages 521-542, December.
  • Handle: RePEc:spr:joptap:v:103:y:1999:i:3:d:10.1023_a:1021727806358
    DOI: 10.1023/A:1021727806358
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1021727806358
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1023/A:1021727806358?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Andreas Ernst & Lars Grüne & Janosch Rieger, 2023. "A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems," Journal of Global Optimization, Springer, vol. 86(2), pages 521-543, June.

    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:joptap:v:103:y:1999:i:3:d:10.1023_a:1021727806358. 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.