Depth-based short-sighted stochastic shortest path problems
From MaRDI portal
(Redirected from Publication:460624)
Recommendations
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- APPSSAT: Approximate probabilistic planning using stochastic satisfiability
- Contingent planning under uncertainty via stochastic satisfiability
- The stochastic shortest path problem: a polyhedral combinatorics perspective
- scientific article; zbMATH DE number 5547912
Cites work
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (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
- Depth-based short-sighted stochastic shortest path problems
- LAO*: A heuristic search algorithm that finds solutions with loops
- The FF planning system: Fast plan generation through heuristic search
- Topological value iteration algorithms
Cited in
(3)
This page was built for publication: Depth-based short-sighted stochastic shortest path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q460624)