Efficient constraint generation for stochastic shortest path problems

DOI10.1016/J.ARTINT.2026.104505MaRDI QIDQ7232466zbMATH OpenFDO

Authors Johannes Schmalz, Felipe W. Trevizan

Publication date 23 April 2026

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2026.104505

zbMATH Keywords

heuristic searchconstraint generationstochastic shortest path problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35)

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 1095138 (Why is no real title available?)
• scientific article; zbMATH DE number 2243413 (Why is no real title available?)
• An Analysis of Stochastic Shortest Path Problems
• Goal probability analysis in MDP probabilistic planning: exploring and enhancing the state of the art
• Iterative bounding \(\text{LAO}^*\)
• LAO*: A heuristic search algorithm that finds solutions with loops
• Markov Decision Processes with Imprecise Transition Probabilities
• Metric hybrid factored planning in nonlinear domains with constraint generation
• Planning with Markov decision processes. An AI perspective
• Topological value iteration algorithms
• Verification of Markov decision processes using learning algorithms

This page was built for publication: Efficient constraint generation for stochastic shortest path problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232466)