Stability of reset systems

Svetlana Polenkova, Jan W. Polderman, Romanus Langerak

    Research output: Contribution to conferencePaperAcademicpeer-review

    18 Downloads (Pure)

    Abstract

    We derive sufficient conditions for asymptotic stability of state reset systems in terms of a linear matrix inequality. The reset system is modeled as a hybrid automaton with one discrete state. The guard on the transition is a switching surface and the reset map is a projection onto a subspace of the state space. A discrete stability indicator is introduced: the projection gain. A modified version of the LMI provides a estimate of the projection gain.
    Original languageEnglish
    Pages0074
    Number of pages8
    Publication statusPublished - Jul 2012
    Event20th International Symposium on Mathematical Theory of Networks and Systems, MTNS 2012 - Melbourne, Australia
    Duration: 9 Jul 201213 Jul 2012
    Conference number: 20

    Conference

    Conference20th International Symposium on Mathematical Theory of Networks and Systems, MTNS 2012
    Abbreviated titleMTNS
    CountryAustralia
    CityMelbourne
    Period9/07/1213/07/12

    Keywords

    • Stability
    • Reset control systems
    • MSC-93C30
    • MSC-93D20

    Fingerprint Dive into the research topics of 'Stability of reset systems'. Together they form a unique fingerprint.

  • Cite this

    Polenkova, S., Polderman, J. W., & Langerak, R. (2012). Stability of reset systems. 0074. Paper presented at 20th International Symposium on Mathematical Theory of Networks and Systems, MTNS 2012, Melbourne, Australia.