scientific article; zbMATH DE number 2038905

MaRDI QIDQ4449310zbMATH OpenFDO

Authors Håkan L. S. Younes, Reid G. Simmons

Publication date 8 February 2004

zbMATH Keywords

plan space planning

Mathematics Subject Classification ID

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

Recommendations

• Engineering a conformant probabilistic planner
• Partial-order planning: Evaluating possible efficiency gains
• The fast downward planning system
• Planning as heuristic search
• Forward chaining hierarchical partial-order planning

Cited in

(13)

• A constraint programming formulation for planning: From plan scheduling to plan generation
• Sequential Monte Carlo in reachability heuristics for probabilistic planning
• Branching and pruning: An optimal temporal POCL planner based on constraint programming
• Managing temporal cycles in planning problems requiring concurrency
• Using satisfiability for non-optimal temporal planning
• scientific article; zbMATH DE number 4174377 (Why is no real title available?)
• VHPOP
• Forward chaining hierarchical partial-order planning
• State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
• Planning in artificial intelligence
• Recent algorithmic advances in simple temporal networks with uncertainty: from faster controllability checking to faster execution
• Managing concurrency in temporal planning using planner-scheduler interaction
• Learning from planner performance

Describes a project that uses

Uses Software

• Graphplan

This page was built for publication:

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