Depth-based short-sighted stochastic shortest path problems

DOI10.1016/J.ARTINT.2014.07.001zbMATH Open1405.68331OpenAlexW1972965204MaRDI QIDQ460624FDOQ460624

Manuela M. Veloso, Felipe W. Trevizan

Publication date: 13 October 2014

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

Full work available at URL: https://doi.org/10.1016/j.artint.2014.07.001

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 Keywords

Markov decision processesstochastic shortest path problemsprobabilistic planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35) Markov and semi-Markov decision processes (90C40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The FF planning system: Fast plan generation through heuristic search
• An Analysis of Stochastic Shortest Path Problems
• LAO*: A heuristic search algorithm that finds solutions with loops
• Title not available (Why is that?)
• Depth-based short-sighted stochastic shortest path problems
• Title not available (Why is that?)

Cited In (3)

• Theory and application of reciprocal transformation of “path problem” and “time float problem”
• Planning in artificial intelligence
• Depth-based short-sighted stochastic shortest path problems

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)