IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v425y2022ics0096300322001400.html
   My bibliography  Save this article

Probabilistic reach-Avoid problems in nondeterministic systems with time-Varying targets and obstacles

Author

Listed:
  • Liao, Wei
  • Liang, Taotao
  • Wei, Xiaohui
  • Yin, Qiaozhi

Abstract

The probabilistic reachability problem, which involves the computation of probabilistic reachable sets, is studied for nondeterministic systems. In the existing works, the system evolution initialized from the probabilistic reachable set is required to reach the target set with a certain probability in a given time horizon. In this paper, the definition of probabilistic reachable sets is refined by taking into account time-varying target set and obstacle. In the context of this definition, the evolution of the system is required not only to reach the target set but also to avoid obstacle. We address two distinct interpretations of probabilistic reachability problem via dynamic planning. In the first case, the control policy is given. In the second case, the control policy is a parameter to be optimized. A numerical method is proposed to compute probabilistic reachable sets. First, a scalar function in the state space is constructed by backward recursion and grid interpolation, and then the probabilistic reachable set is represented as a nonzero upper level set of this scalar function. In addition, based on the constructed scalar function, the optimal control policy can be designed. Two examples are provided at the end of this article. The first example consists of a one-dimensional problem where the analytical solution is compared with the results of the proposed method in order to analyze the computational accuracy. The second example, which contains a three-dimensional problem, is used to demonstrate the effectiveness of the proposed method.

Suggested Citation

  • Liao, Wei & Liang, Taotao & Wei, Xiaohui & Yin, Qiaozhi, 2022. "Probabilistic reach-Avoid problems in nondeterministic systems with time-Varying targets and obstacles," Applied Mathematics and Computation, Elsevier, vol. 425(C).
    • Handle: RePEc:eee:apmaco:v:425:y:2022:i:c:s0096300322001400
    DOI: 10.1016/j.amc.2022.127054
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300322001400
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2022.127054?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.

    References listed on IDEAS

    as
    1. C. Durieu & É. Walter & B. Polyak, 2001. "Multi-Input Multi-Output Ellipsoidal State Bounding," Journal of Optimization Theory and Applications, Springer, vol. 111(2), pages 273-303, November.
    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. Zhang, Liang & Feng, Zhiguang & Jiang, Zhengyi & Zhao, Ning & Yang, Yang, 2020. "Improved results on reachable set estimation of singular systems," Applied Mathematics and Computation, Elsevier, vol. 385(C).
    Full references (including those not matched with items on IDEAS)

    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. Amirreza Fahim Golestaneh, 2022. "A Closed-Form Parametrization and an Alternative Computational Algorithm for Approximating Slices of Minkowski Sums of Ellipsoids in R 3," Mathematics, MDPI, vol. 11(1), pages 1-21, December.
    2. Feng, Bo & Feng, Zhiguang & Li, Peng, 2023. "Improved results on reachable set synthesis of Markovian jump systems with time-varying delays: General asynchronous control approaches," Applied Mathematics and Computation, Elsevier, vol. 446(C).
    3. Zhang, Liang & Feng, Zhiguang & Jiang, Zhengyi & Zhao, Ning & Yang, Yang, 2020. "Improved results on reachable set estimation of singular systems," Applied Mathematics and Computation, Elsevier, vol. 385(C).
    4. Yongchun Jiang & Hongli Yang & Ivan Ganchev Ivanov, 2024. "Reachable Set Estimation and Controller Design for Linear Time-Delayed Control System with Disturbances," Mathematics, MDPI, vol. 12(2), pages 1-10, January.
    5. Feng, Zhiguang & Zhang, Xinyue & Lam, James & Fan, Chenchen, 2023. "Estimation of reachable set for switched singular systems with time-varying delay and state jump," Applied Mathematics and Computation, Elsevier, vol. 456(C).
    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. Chen, Ruihan & Guo, Moxuan & Zhu, Song & Qi, Yongqiang & Wang, Min & Hu, Junhao, 2022. "Reachable set bounding for linear systems with mixed delays and state constraints," Applied Mathematics and Computation, Elsevier, vol. 425(C).
    8. Ligang Sun & Hamza Alkhatib & Boris Kargoll & Vladik Kreinovich & Ingo Neumann, 2019. "Ellipsoidal and Gaussian Kalman Filter Model for Discrete-Time Nonlinear Systems," Mathematics, MDPI, vol. 7(12), pages 1-22, December.
    9. 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.
    10. Liu, Guobao & Chen, Xiangyong & Shen, Zhongyu & Liu, Yajuan & Jia, Xianglei, 2022. "Reachable set estimation for continuous delayed singularly perturbed systems with bounded disturbances," Applied Mathematics and Computation, Elsevier, vol. 416(C).

    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:eee:apmaco:v:425:y:2022:i:c:s0096300322001400. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.