IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v48y2017i3p494-504.html
   My bibliography  Save this article

Reachable sets bounding for switched systems with time-varying delay and bounded disturbances

Author

Listed:
  • M. V. Thuan
  • H. Trinh
  • D. C. Huong

Abstract

In this paper, we address the problem of finding outer bound of forward reachable sets and inter-bound of backward reachable sets of switched systems with an interval time-varying delay and bounded disturbances. By constructing a flexible Lyapunov–Krasovskii functional combining with some recent refined integral-based inequalities, some sufficient conditions are derived for the existence of (1) the smallest possible outer bound of forwards reachable sets; and (2) the largest possible inter-bound of backward reachable sets. These conditions are delay dependent and in the form of linear matrix inequalities, which therefore can be efficiently solved by using existing convex algorithms. A constructive geometric design of switching laws is also presented. Two numerical examples with simulation results are provided to demonstrate the effectiveness of our results.

Suggested Citation

  • M. V. Thuan & H. Trinh & D. C. Huong, 2017. "Reachable sets bounding for switched systems with time-varying delay and bounded disturbances," International Journal of Systems Science, Taylor & Francis Journals, vol. 48(3), pages 494-504, February.
    • Handle: RePEc:taf:tsysxx:v:48:y:2017:i:3:p:494-504
    DOI: 10.1080/00207721.2016.1186248
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2016.1186248
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2016.1186248?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.

    More about this item

    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:taf:tsysxx:v:48:y:2017:i:3:p:494-504. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    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.