Malte Helmert  Home/Search
Context Related
| informatik.unifre...1_Complexity.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.unifr...publikationen (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . The efficiency of AI planning systems is usually evaluated empirically. The planning domains used in the competitions of the 1998 and 2000 AIPS conferences are of particular importance in this context. Many of these domains share a common theme of transporting portables, making use of mobiles traversing a map of locations and roads. In this contribution, we embed these benchmarks into a well-structured hierarchy of transportation problems and study the computational complexity of... (Update)
Context of citations to this paper: More
.... complexity theoretical investigations of planning benchmarks, where it was found to be one of the hardest domains currently available [15, 14]. The complete domain can be downloaded from http: www.informatik.uni freiburg.de koehler elev elev.html. Details about the...
...the community. At the time of writing, the only other work that uses a formal notion of planning domains is recent work by Malte Helmert [36,37]. There, the semantics of di erent transportation and construction domains are formalized in order to make claims about their...
Cited by: More
Where Ignoring Delete Lists Works: Local Search Topology in.. - Hoffmann (2003) (Correct)
Local Search Topology in Planning Benchmarks: A Theoretical.. - Hoffmann (Correct)
Planning with Pattern Databases - Edelkamp (2001) (Correct)
Active bibliography (related documents): More All
0.3: The Operational Traffic Control Problem: Computational.. - Hatzack, Nebel (Correct)
0.3: Efficient BDD-Based Planning for Non-Deterministic.. - Jensen (2003) (Correct)
0.2: Current Research in RKLLAB, Linköping University's Laboratory for.. - (ed.) (1995) (Correct)
Similar documents based on text: More All
0.4: Decidability and Undecidability Results - For Planning With (Correct)
0.2: Creating an Object-Oriented Software System-The AIPS++ Experience - Glendenning (Correct)
0.2: Directed Symbolic Exploration in AI-Planning - Edelkamp (2001) (Correct)
Related documents from co-citation: More All
5: Fast planning through planning graph analysis - Blum, Furst - 1995
4: The computational complexity of propositional STRIPS planning - Bylander - 1994
4: AIPS-00 Planning Competition (context) - Bacchus - 2000
BibTeX entry: (Update)
M. Helmert. On the complexity of planning in transportation domains. In Proceedings of the 6th European Conference on Planning, LNAI. Springer, 2001. http://citeseer.ist.psu.edu/helmert01complexity.html More
@misc{ helmert01complexity,
author = "M. Helmert",
title = "the complexity of planning in transportation domains",
text = "M. Helmert. On the complexity of planning in transportation domains. In
Proceedings of the 6th European Conference on Planning, LNAI. Springer,
2001.",
year = "2001",
url = "citeseer.ist.psu.edu/helmert01complexity.html" }
Citations (may not include all citations):376 Fast planning through planning graph analysis - Blum, Furst - 1997
356 Computers and Intractability --- A Guide to the Theory of NP.. (context) - Garey, Johnson - 1979
147 The computational complexity of propositional STRIPS plannin.. - Bylander - 1994
130 Extending planning graphs to an ADL subset - Kohler, Nebel et al. - 1997
64 decidability and undecidability results for domain-independe.. (context) - Erol, Nau et al. - 1995
51 the complexity of blocks-world planning - Gupta, Nau - 1992
41 The FF planning system: Fast plan generation through heurist.. - Hoffmann, Nebel - 2001
23 Near-optimal plans (context) - Selman - 1994
17 Automatic synthesis and use of generic types in planning - Long, Fox - 2000
14 Blocks world revisited (context) - Slaney, Thi'ebaux - 2001
12 The AIPS-98 planning competition (context) - Long, Kautz et al. - 2000
11 Complexity results for SAS + planning - Backstrom, Nebel - 1995
8 Local search topology in planning benchmarks: An empirical a.. - Hoffmann - 2001
3 the complexity of planning in transportation and manipulatio.. (context) - Helmert - 2001
2 Elevator control as a planning problem (context) - Kohler, Schuster - 2000
Documents on the same site (http://www.informatik.uni-freiburg.de/~ki/publikationen.html): More
Solving Hard Qualitative Temporal Reasoning Problems: Evaluating.. - Nebel (1997) (Correct)
A Cognitive Assessment of Topological Spatial Relations.. - Knauff, Rauh, Renz (1997) (Correct)
An Experimental Comparison of Localization Methods - Gutmann, Burgard, Fox, Konolige (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC