State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning

DOI10.1016/j.artint.2010.12.002zbMath1216.68239OpenAlexW2144961063MaRDI QIDQ543630

Daniel Bryce, Subbarao Kambhampati, William Cushing

Publication date: 17 June 2011

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

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

zbMATH Keywords

heuristicsplanning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Multi-cost bounded tradeoff analysis in MDP ⋮ Knowledge-based programs as succinct policies for partially observable domains

Uses Software

• STAN
• CUDD
• Graphplan
• VHPOP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using regression-match graphs to control search in planning
• Sequential Monte Carlo in reachability heuristics for probabilistic planning
• Conformant planning via heuristic forward search: A new approach
• Sequential Monte Carlo Methods in Practice
• Graph-Based Algorithms for Boolean Function Manipulation
• Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search

This page was built for publication: State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning