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

DOI10.1016/J.ARTINT.2010.12.002MaRDI QIDQ543630zbMATH OpenOpenAlexFDO

Authors Daniel Bryce, William Cushing, Subbarao Kambhampati

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)

Recommendations

• Planning graph heuristics for belief space search
• Fast planning through planning graph analysis
• scientific article; zbMATH DE number 1448981
• Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
• scientific article; zbMATH DE number 1560498

Cites work

• Conformant planning via heuristic forward search: A new approach
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• scientific article; zbMATH DE number 1285155 (Why is no real title available?)
• scientific article; zbMATH DE number 1946853 (Why is no real title available?)
• scientific article; zbMATH DE number 2038892 (Why is no real title available?)
• scientific article; zbMATH DE number 2038901 (Why is no real title available?)
• scientific article; zbMATH DE number 2038905 (Why is no real title available?)
• scientific article; zbMATH DE number 1753146 (Why is no real title available?)
• scientific article; zbMATH DE number 2243389 (Why is no real title available?)
• Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
• Planning graph heuristics for belief space search
• Sequential Monte Carlo in reachability heuristics for probabilistic planning
• Sequential Monte Carlo Methods in Practice
• The FF planning system: Fast plan generation through heuristic search
• Using regression-match graphs to control search in planning

Cited in

(8)

• State-variable planning under structural restrictions: algorithms and complexity
• Knowledge-based programs as succinct policies for partially observable domains
• Multi-cost bounded tradeoff analysis in MDP
• Sequential Monte Carlo in reachability heuristics for probabilistic planning
• Conformant planning via heuristic forward search: A new approach
• Graph planning with expected finite horizon
• Planning graph heuristics for belief space search
• Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search

Describes a project that uses

Uses Software

• VHPOP
• CUDD
• Graphplan
• STAN

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

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