Local Search Topology in Planning Benchmarks: A Theoretical Analysis

Proceedings of the 6th International Conference on Artificial Intelligence Planning Systems, AIPS 2002

Volumn , Issue , 2002, Pages 92-100

  Hoffmann, Jörg ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; HEURISTIC ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); TOPOLOGY;

'CURRENT; DEAD-ENDS; HEURISTIC FUNCTIONS; HIGH QUALITY; LOCAL MINIMUMS; LOCAL SEARCH; NON-EXISTENCE; STATE OF THE ART; STATE-SPACE; TASK STATE;

BENCHMARKING;

EID: 77049118353     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Bacchus, F. 2001. The AIPS'00 planning competition. AI Magazine 22(3):47-56.
2. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. AIJ 129(1-2):5-33.
3. Bonet, B.; Loerincs, G.; and Geffner, H. 1997. A robust and fast action selection mechanism for planning. In Proc. AAAI-97, 714-719. MIT Press.
4. Bylander, T. 1994. The computational complexity of propositional STRIPS planning. AIJ 69(1-2):165-204.
5. Edelkamp, S., and Helmert, M. 2001. The model checking integrated planning system (MIPS). AI Magazine 22(3):67-71.
6. Fox, M., and Long, D. 1998. The automatic inference of state invariants in tim. JAIR 9:367-421.
7. Frank, J.; Cheeseman, P.; and Stutz, J. 1997. When gravity fails: Local search topology. JAIR 7:249-281.
8. Gazen, B. C., and Knoblock, C. 1997. Combining the expressiveness of UCPOP with the efficiency of Graphplan. In Proc. ECP-97, 221-233. Toulouse, France: Springer-Verlag.
9. Gerevini, A., and Schubert, L. 2000. Inferring state constraints in DISCOPLAN: Some new results. In Proc. AAAI-00, 761-767. Austin, TX: MIT Press.
10. Helmert, M. 2001. On the complexity of planning in transportation domains. In Proc. ECP-01, 349-360. Toledo, Spain: Springer-Verlag.
11. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. JAIR 14:253-302.
12. Hoffmann, J. 2001a. Local search topology in planning benchmarks: A theoretical analysis. Technical Report 165, Albert-Ludwigs-Universität, Institut für Informatik, Freiburg, Germany. ftp://ftp.informatik.unifreiburg.de/documents/reports/report165/report00165.ps.gz
13. Hoffmann, J. 2001b. Local search topology in planning benchmarks: An empirical analysis. In Proc. IJCAI-01, 453-458. Seattle, Washington, USA: Morgan Kaufmann.
14. Koehler, J., and Hoffmann, J. 2000. On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. JAIR 12:338-386.
15. McDermott, D. 2000. The 1998 AI planning systems competition. AI Magazine 21(2):35-55.
16. Rintanen, J. 2000. An iterative algorithm for synthesizing invariants. In Proc. AAAI-00, 806-811. Austin, TX: MIT Press.