ADL: exploring the middle ground between STRIPS and the situation calculus
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Fast planning through planning graph analysis
Artificial Intelligence
Complexity results for standard benchmark domains in planning
Artificial Intelligence
Artificial Intelligence
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Branching and pruning: an optimal temporal POCL planner based on constraint programming
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
The 3rd international planning competition: results and analysis
Journal of Artificial Intelligence Research
PDDL2.1: an extension to PDDL for expressing temporal planning domains
Journal of Artificial Intelligence Research
Taming numbers and durations in the model checking integrated planning system
Journal of Artificial Intelligence Research
Planning through stochastic local search and temporal action graphs in LPG
Journal of Artificial Intelligence Research
The metric-FF planning system: translating "Ignoring delete lists" to numeric state variables
Journal of Artificial Intelligence Research
Where "Ignoring delete lists" works: local search topology in planning benchmarks
Journal of Artificial Intelligence Research
Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4
Journal of Artificial Intelligence Research
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
SPIN'03 Proceedings of the 10th international conference on Model checking software
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
SAT-Based Planning with Minimal-#actions Plans and "soft" Goals
AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
Approximation Properties of Planning Benchmarks
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Exploration of the robustness of plans
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Harnessing algorithm bias in classical planning
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Optimal metric planning with state sets in automata representation
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Accuracy of admissible heuristic functions in selected planning domains
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Where "Ignoring delete lists" works: local search topology in planning benchmarks
Journal of Artificial Intelligence Research
The fast downward planning system
Journal of Artificial Intelligence Research
Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4
Journal of Artificial Intelligence Research
Marvin: a heuristic search planner with online macro-action learning
Journal of Artificial Intelligence Research
New Islands of tractability of cost-optimal planning
Journal of Artificial Intelligence Research
Improving Plan Quality in SAT-Based Planning
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Friends or foes? on planning as satisfiability and abstract CNF encodings
Journal of Artificial Intelligence Research
Understanding planning tasks: domain complexity and heuristic decomposition
Understanding planning tasks: domain complexity and heuristic decomposition
Brothers in Arms? On AI Planning and Cellular Automata
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Planning solar array operations on the international space station
ACM Transactions on Intelligent Systems and Technology (TIST)
Parallel divide-and-evolve: experiments with OpenMP on a multicore machine
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Program model checking via action planning
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Planning in domains with derived predicates through rule-action graphs and local search
Annals of Mathematics and Artificial Intelligence
An Empirical Analysis of Some Heuristic Features for Planning through Local Search and Action Graphs
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Analysing the PDDL language for argumentation-based negotiation planning
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
COLIN: planning with continuous linear numeric change
Journal of Artificial Intelligence Research
SAP speaks PDDL: exploiting a software-engineering model for planning in business process management
Journal of Artificial Intelligence Research
A hybrid LP-RPG heuristic for modelling numeric resource flows in planning
Journal of Artificial Intelligence Research
Automating the evaluation of planning systems
AI Communications
Planning as satisfiability with IPC simple preferences and action costs
AI Communications
Hi-index | 0.00 |
We provide an overview of the organization and results of the deterministic part of the 4th International Planning Competition, i.e., of the part concerned with evaluating systems doing deterministic planning. IPC-4 attracted even more competing systems than its already large predecessors, and the competition event was revised in several important respects. After giving an introduction to the IPC, we briefly explain the main differences between the deterministic part of IPC-4 and its predecessors. We then introduce formally the language used, called PDDL2.2 that extends PDDL2.1 by derived predicates and timed initial literals. We list the competing systems and overview the results of the competition. The entire set of data is far too large to be presented in full. We provide a detailed summary; the complete data is available in an online appendix. We explain how we awarded the competition prizes.