IDEAS home Printed from https://ideas.repec.org/a/hin/complx/5876371.html
   My bibliography  Save this article

Reachable Set Estimation for a Class of Nonlinear Time-Varying Systems

Author

Listed:
  • Yuangong Sun
  • Fanwei Meng

Abstract

This paper studies the problem of reachable set estimation for a class of nonlinear time-varying systems with disturbances. New necessary and (or) sufficient conditions are derived for the existence of a ball such that all the solutions of the system converge asymptotically within it. Explicit estimation on the decay rate is also presented. The method used in this paper is motivated by that for positive systems, which is different from the conventional Lyapunov-Krasovskii functional method. A numerical example is given to illustrate the effectiveness of the obtained result.

Suggested Citation

  • Yuangong Sun & Fanwei Meng, 2017. "Reachable Set Estimation for a Class of Nonlinear Time-Varying Systems," Complexity, Hindawi, vol. 2017, pages 1-6, July.
    • Handle: RePEc:hin:complx:5876371
    DOI: 10.1155/2017/5876371
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/8503/2017/5876371.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/8503/2017/5876371.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2017/5876371?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
    ---><---

    References listed on IDEAS

    as
    1. P. T. Nam & P. N. Pathirana & H. Trinh, 2013. "Exponential Convergence of Time-Delay Systems in the Presence of Bounded Disturbances," Journal of Optimization Theory and Applications, Springer, vol. 157(3), pages 843-852, June.
    2. Nguyen D. That & Phan T. Nam & Q. P. Ha, 2013. "Reachable Set Bounding for Linear Discrete-Time Systems with Delays and Bounded Disturbances," Journal of Optimization Theory and Applications, Springer, vol. 157(1), pages 96-107, April.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Yuangong Sun & Zhaorong Wu & Fanwei Meng, 2018. "Common Weak Linear Copositive Lyapunov Functions for Positive Switched Linear Systems," Complexity, Hindawi, vol. 2018, pages 1-7, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xingao Zhu & Yuangong Sun, 2019. "Reachable Set Bounding for Homogeneous Nonlinear Systems with Delay and Disturbance," Complexity, Hindawi, vol. 2019, pages 1-6, July.
    2. Trinh, H. & Nam, Phan T. & Pathirana, Pubudu N. & Le, H.P., 2015. "On backwards and forwards reachable sets bounding for perturbed time-delay systems," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 664-673.
    3. Yucai Ding & Hui Liu, 2018. "Estimation and Synthesis of Reachable Set for Singular Markovian Jump Systems," Complexity, Hindawi, vol. 2018, pages 1-10, June.
    4. Chengdan Wang & Hongli Yang & Ivan Ganchev Ivanov, 2023. "Controlled Invariant Sets of Discrete-Time Linear Systems with Bounded Disturbances," Mathematics, MDPI, vol. 11(15), pages 1-16, August.
    5. Chang-Hua Lien & Hao-Chin Chang & Ker-Wei Yu & Hung-Chi Li & Yi-You Hou, 2021. "Reachable Set and Robust Mixed Performance of Uncertain Discrete Systems with Interval Time-Varying Delay and Linear Fractional Perturbations," Mathematics, MDPI, vol. 9(21), pages 1-24, October.
    6. Wei Kang & Hao Chen & Kaibo Shi & Jun Cheng, 2018. "Further Results on Reachable Set Bounding for Discrete-Time System with Time-Varying Delay and Bounded Disturbance Inputs," Complexity, Hindawi, vol. 2018, pages 1-11, March.
    7. Wang, Xuelian & Xia, Jianwei & Wang, Jing & Wang, Zhen & Wang, Jian, 2020. "Reachable set estimation for Markov jump LPV systems with time delays," Applied Mathematics and Computation, Elsevier, vol. 376(C).

    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:hin:complx:5876371. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.