scientific article; zbMATH DE number 2038892

MaRDI QIDQ4449294zbMATH OpenFDO

Authors D. Long, M. Fox

Publication date 8 February 2004

zbMATH Keywords

scheduling

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Recommendations

• Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
• Learning from planner performance
• Complexity results for standard benchmark domains in planning
• scientific article; zbMATH DE number 2243406
• scientific article; zbMATH DE number 1946847

Cited in

(25)

• scientific article; zbMATH DE number 1946847 (Why is no real title available?)
• Breadth-first heuristic search
• Handling fuzzy temporal constraints in a planning environment
• Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure
• State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
• scientific article; zbMATH DE number 2243406 (Why is no real title available?)
• Planning in domains with derived predicates through rule-action graphs and local search
• Branching and pruning: An optimal temporal POCL planner based on constraint programming
• Star-topology decoupled state space search
• Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
• Learning from planner performance
• Processes and continuous change in a SAT-based planner
• Planning in artificial intelligence
• Some computational aspects of DISTANCE SAT
• Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms
• scientific article; zbMATH DE number 2243413 (Why is no real title available?)
• Set-structured and cost-sharing heuristics for classical planning
• Kernel functions for case-based planning
• Agent planning programs
• Approximation of action theories and its application to conformant planning
• An approach to efficient planning with numerical fluents and multi-criteria plan quality
• A case study in programming a quantum annealer for hard operational planning problems
• Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4
• Maintenance of plan libraries for case-based planning: offline and online policies
• Efficient benchmarking of algorithm configurators via model-based surrogates

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 Q4449294)