Probabilistic reach-avoid problems in nondeterministic systems with time-varying targets and obstacles
From MaRDI portal
Publication:2139771
DOI10.1016/J.AMC.2022.127054OpenAlexW4220733122MaRDI QIDQ2139771FDOQ2139771
Qiaozhi Yin, Wei Liao, Taotao Liang, Xiaohui Wei
Publication date: 19 May 2022
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.03386
Model systems in control theory (93Cxx) Stochastic systems and control (93Exx) Controllability, observability, and system structure (93Bxx)
Cites Work
- On reachability and minimum cost optimal control
- Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
- A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games
- Computational techniques for hybrid system verification
- Multi-input multi-output ellipsoidal state bounding.
- The flexible, extensible and efficient toolbox of level set methods
- On backwards and forwards reachable sets bounding for perturbed time-delay systems
- Reach-avoid problems with time-varying dynamics, targets and constraints
- Scalable Underapproximative Verification of Stochastic LTI Systems using Convexity and Compactness
- Improved results on reachable set estimation of singular systems
Cited In (2)
Uses Software
Recommendations
- Title not available (Why is that?) π π
- Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems π π
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes π π
- Probabilistic Reach-Avoid Computation for Partially Degenerate Stochastic Processes π π
- A stochastic reach-avoid problem with random obstacles π π
- Verification and Control of Partially Observable Probabilistic Real-Time Systems π π
- Probabilistic Occupancy via Forward Stochastic Reachability for Markov Jump Affine Systems π π
- Stochastic reachability based motion planning for multiple moving obstacle avoidance π π
- Tools and Algorithms for the Construction and Analysis of Systems π π
- Optimal Probabilistic Motion Planning With Potential Infeasible LTL Constraints π π
This page was built for publication: Probabilistic reach-avoid problems in nondeterministic systems with time-varying targets and obstacles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139771)