Probabilistic reach-avoid problems in nondeterministic systems with time-varying targets and obstacles

DOI10.1016/J.AMC.2022.127054OpenAlexW4220733122MaRDI QIDQ2139771FDOQ2139771

Authors Wei Liao, Taotao Liang, Xiaohui Wei, Qiaozhi Yin

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

zbMATH Keywords

dynamic programmingoptimal controlprobabilistic reachable setnondeterministic system

Mathematics Subject Classification ID

Model systems in control theory (93Cxx) Stochastic systems and control (93Exx) Controllability, observability, and system structure (93Bxx)

Recommendations

• A stochastic reach-avoid problem with random obstacles
• Probabilistic Reach-Avoid Computation for Partially Degenerate Stochastic Processes
• Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
• Tools and Algorithms for the Construction and Analysis of Systems
• Stochastic reachability based motion planning for multiple moving obstacle avoidance
• scientific article; zbMATH DE number 1361118
• Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
• Probabilistic Occupancy via Forward Stochastic Reachability for Markov Jump Affine Systems
• Verification and control of partially observable probabilistic real-time systems
• Optimal Probabilistic Motion Planning With Potential Infeasible LTL Constraints

Cites work

• A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games
• Computational techniques for hybrid system verification
• Improved results on reachable set estimation of singular systems
• Multi-input multi-output ellipsoidal state bounding.
• On backwards and forwards reachable sets bounding for perturbed time-delay systems
• On reachability and minimum cost optimal control
• Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
• Reach-avoid problems with time-varying dynamics, targets and constraints
• Scalable underapproximative verification of stochastic LTI systems using convexity and compactness
• The flexible, extensible and efficient toolbox of level set methods

Cited in

(3)

• A stochastic reach-avoid problem with random obstacles
• An NMPC Approach to Avoid Weakly Observable Trajectories
• The Reach-Avoid Problem for Constant-Rate Multi-mode Systems

Describes a project that uses

Uses Software

• ToolboxLS
• helperOC

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)