scientific article; zbMATH DE number 2038899

MaRDI QIDQ4449302zbMATH OpenFDO

Authors

Publication date 8 February 2004

zbMATH Keywords

planning-graph

Mathematics Subject Classification ID

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

Recommendations

• Managing concurrency in temporal planning using planner-scheduler interaction
• Multiobjective heuristic state-space planning
• scientific article; zbMATH DE number 2038900
• Domain-independent temporal planning in a planning-graph-based approach
• scientific article; zbMATH DE number 2038893

Cited in

(12)

• Decidability and complexity of action-based temporal planning over dense time
• An approach to efficient planning with numerical fluents and multi-criteria plan quality
• Processes and continuous change in a SAT-based planner
• SAPA
• Experimental evaluation of pheromone models in ACOPlan
• Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search
• Planning in artificial intelligence
• Answer set planning: a survey
• Generalised merge and shrink abstractions for temporal planning
• Managing concurrency in temporal planning using planner-scheduler interaction
• Learning from planner performance
• Anytime heuristic search for partial satisfaction planning

Describes a project that uses

Uses Software

• STAN
• RealPlan
• 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 Q4449302)