Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Artificial Intelligence
Design and validation of computer protocols
Design and validation of computer protocols
ADL: exploring the middle ground between STRIPS and the situation calculus
Proceedings of the first international conference on Principles of knowledge representation and reasoning
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Fast planning through planning graph analysis
Artificial Intelligence
Validation with guided search of the state space
DAC '98 Proceedings of the 35th annual Design Automation Conference
Automatic OBDD-based generation of universal plans in non-deterministic domains
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Using regression-match graphs to control search in planning
Artificial Intelligence
Using temporal logics to express search control knowledge for planning
Artificial Intelligence
Model checking
Symbolic guided search for CTL model checking
Proceedings of the 37th Annual Design Automation Conference
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
WCDMA for UMTS: Radio Access for Third Generation Mobile Communications
WCDMA for UMTS: Radio Access for Third Generation Mobile Communications
Complexity results for standard benchmark domains in planning
Artificial Intelligence
The Detection and Exploitation of Symmetry in Planning Problems
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Extending Planning Graphs to an ADL Subset
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Combining the Expressivity of UCPOP with the Efficiency of Graphplan
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Planning with a language for extended goals
Eighteenth national conference on Artificial intelligence
Directed explicit-state model checking in the validation of communication protocols
International Journal on Software Tools for Technology Transfer (STTT)
Artificial Intelligence
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
On the compilability and expressive power of propositional planning formalisms
Journal of Artificial Intelligence Research
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
The metric-FF planning system: translating "Ignoring delete lists" to numeric state variables
Journal of Artificial Intelligence Research
The deterministic part of IPC-4: an overview
Journal of Artificial Intelligence Research
Where "Ignoring delete lists" works: local search topology in planning benchmarks
Journal of Artificial Intelligence Research
The first probabilistic track of the international planning competition
Journal of Artificial Intelligence Research
An approach to temporal planning and scheduling in domains with predictable exogenous events
Journal of Artificial Intelligence Research
The fast downward planning system
Journal of Artificial Intelligence Research
When gravity fails: local search topology
Journal of Artificial Intelligence Research
A critical assessment of benchmark comparison in planning
Journal of Artificial Intelligence Research
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Local search topology in planning benchmarks: an empirical analysis
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Action Planning for Directed Model Checking of Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
SPIN'03 Proceedings of the 10th international conference on Model checking software
A robust and fast action selection mechanism for planning
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Advanced service provisioning based on mobile agents
Computer Communications
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Artificial Intelligence
Optimal Scheduling with Resources for Application Execution in 3G Networks
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
A Hybrid Approach to Intricate Motion, Manipulation and Task Planning
International Journal of Robotics Research
The deterministic part of IPC-4: an overview
Journal of Artificial Intelligence Research
Where "Ignoring delete lists" works: local search topology in planning benchmarks
Journal of Artificial Intelligence Research
A semantically enabled service oriented architecture
WImBI'06 Proceedings of the 1st WICI international conference on Web intelligence meets brain informatics
Understanding planning tasks: domain complexity and heuristic decomposition
Understanding planning tasks: domain complexity and heuristic decomposition
Adversarial planning for large multi-agent simulations
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Brothers in Arms? On AI Planning and Cellular Automata
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Program model checking via action planning
MoChArt'10 Proceedings of the 6th international conference on Model checking 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
Planning with MIP for supply restoration in power distribution systems
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the developed technology. In AI Planning, researchers more and more tend to draw their testing examples from the benchmark collections used in the International Planning Competition (IPC). In the organization of (the deterministic part of) the fourth IPC, IPC-4, the authors therefore invested significant effort to create a useful set of benchmarks. They come from five different (potential) real-world applications of planning: airport ground traffic control, oil derivative transportation in pipeline networks, model-checking safety properties, power supply restoration, and UMTS call setup. Adapting and preparing such an application for use as a benchmark in the IPC involves, at the time, inevitable (often drastic) simplifications, as well as careful choice between, and engineering of, domain encodings. For the first time in the IPC, we used compilations to formulate complex domain features in simple languages such as STRIPS, rather than just dropping the more interesting problem constraints in the simpler language subsets. The article explains and discusses the five application domains and their adaptation to form the PDDL test suites used in IPC-4. We summarize known theoretical results on structural properties of the domains, regarding their computational complexity and provable properties of their topology under the h+ function (an idealized version of the relaxed plan heuristic). We present new (empirical) results illuminating properties such as the quality of the most wide-spread heuristic functions (planning graph, serial planning graph, and relaxed plan), the growth of propositional representations over instance size, and the number of actions available to achieve each fact; we discuss these data in conjunction with the best results achieved by the different kinds of planners participating in IPC-4.