Malte Helmert. On the complexity of planning in transportation domains. In Cesta and Borrajo [14], pages 349--360. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Local Search Topology in Planning Benchmarks: A Theoretical.. - Hoffmann (Correct)
....than single tasks, we need a formal definition of what a planning domain is. Our definitions formalize in a straightforward manner the way how domains are usually handled in the community. The only other work we know of that uses a formal notion of planning domains is recent work by Malte Helmert [11]. There, the semantics of different transportation domains are formalized in order to prove their computational complexity. In difference to that, our definitions are strictly syntax oriented after all, the heuristic function we consider is extracted directly from the syntax of the planning ....
....can look at fragments of the state spaces of larger planning tasks, and compute statistics about the distribution of local minima etc. Another interesting future direction is to try and prove properties of h domain classes rather than for single domains in turn. Recent work by Malte Helmert [11] has defined a hierarchy of transportation domains in the context of investigating their complexity. Judging from our results, it seems to be the case that, with Helmert s terminology, any transportation domain where there is unlimited fuel does not contain local minima under h . The main ....
Malte Helmert. On the complexity of planning in transportation domains. In Recent Advances in AI Planning. 6th European Conference on Planning (ECP'01), pages 349--360, Toledo, Spain, September 2001. Springer-Verlag.
Where Ignoring Delete Lists Works: Local Search Topology in.. - Hoffmann (2003) (Correct)
....single tasks, I have de ned a formal framework for STRIPS and ADL domains, formalizing in a straightforward manner the way domains are usually dealt with in 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 computational complexity. In di erence to that, my de nitions are strictly syntax oriented after all, the function is extracted directly from the syntax of the ....
M. Helmert, On the complexity of planning in transportation domains, in: Cesta and Borrajo [54], pp. 349-360.
An AI-based Approach to Destination Control in Elevators - Koehler, Ottiger (2002) (1 citation) (Correct)
.... for developing a domainspeci c planning algorithm, but it was used in the AIPS 00 planning systems competition and it has also been considered in topological and 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 planning competition 2000 can be found at http: www.cs.toronto.edu aips2000. 9 of stops to be computed for a given, xed trac situation in a building, i.e. we do not ....
M. Helmert. On the complexity of planning in transportation domains. In Proceedings of the 6th European Conference on Planning, LNAI. Springer, 2001.
Where Ignoring Delete Lists Works: Local Search Topology in.. - Hoffmann (2003) (Correct)
No context found.
Malte Helmert. On the complexity of planning in transportation domains. In Cesta and Borrajo [14], pages 349--360.
Planning with Pattern Databases - Edelkamp (2001) (3 citations) (Correct)
No context found.
M. Helmert. On the complexity of planning in transportation domains. In ECP, 2001. This volume.
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