Variations on the Stochastic Shortest Path Problem

DOI10.1007/978-3-662-46081-8_1zbMath1432.90155arXiv1411.0835OpenAlexW2963258939MaRDI QIDQ5172631

Mickael Randour, Ocan Sankur, Jean-François Raskin

Publication date: 4 February 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic programming (90C15) Markov and semi-Markov decision processes (90C40)

Related Items (18)

Simple Strategies in Multi-Objective MDPs ⋮ The Odds of Staying on Budget ⋮ Compositional strategy synthesis for stochastic games with multiple objectives ⋮ Markov automata with multiple objectives ⋮ A multi-objective approach for PH-graphs with applications to stochastic shortest paths ⋮ Reachability and safety objectives in Markov decision processes on long but finite horizons ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Percentile queries in multi-dimensional Markov decision processes ⋮ Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions ⋮ Combinations of Qualitative Winning for Stochastic Parity Games ⋮ Maximizing the Conditional Expected Reward for Reaching the Goal ⋮ Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ Nearly Optimal Verifiable Data Streaming ⋮ Unnamed Item ⋮ Infinite-Duration Bidding Games

This page was built for publication: Variations on the Stochastic Shortest Path Problem