The Linear Programming Approach to Reach-Avoid Problems for Markov Decision Processes

DOI10.1613/jair.5500zbMath1427.90286arXiv1411.5925OpenAlexW2963348740MaRDI QIDQ5371013

Tyler H. Summers, Maryam Kamgarpour, Nikolaos Kariotoglou, John Lygeros

Publication date: 24 October 2017

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.5925

zbMATH Keywords

finite-dimensional approximationinfinite-dimensional linear programstochastic reach-avoid problem

Mathematics Subject Classification ID

Programming in abstract spaces (90C48) Markov and semi-Markov decision processes (90C40)

Related Items (12)

State-based confidence bounds for data-driven stochastic reachability using Hilbert space embeddings ⋮ Stochastic system controller synthesis for reachability specifications encoded by random sets ⋮ On the computational complexity and generalization properties of multi-stage and stage-wise coupled scenario programs ⋮ Similarity quantification for linear stochastic systems: a coupling compensator approach ⋮ Stochastic reachability of a target tube: theory and computation ⋮ Viability, viscosity, and storage functions in model-predictive control with terminal constraints ⋮ Elliptical Slice Sampling for Probabilistic Verification of Stochastic Systems with Signal Temporal Logic Specifications ⋮ Symbolic control for stochastic systems via finite parity games ⋮ Control synthesis for stochastic systems given automata specifications defined by stochastic sets ⋮ Lagrangian approximations for stochastic reachability of a target tube ⋮ Automated verification and synthesis of stochastic hybrid systems: a survey ⋮ Cooperative strategies for two-evader-one-pursuer reach-avoid differential games

This page was built for publication: The Linear Programming Approach to Reach-Avoid Problems for Markov Decision Processes