Where "ignoring delete lists" works: Local search topology in planning benchmarks

Journal of Artificial Intelligence Research

Volumn 24, Issue , 2005, Pages 685-758

  Hoffmann, Jörg ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPETITION; COSTS; FUNCTIONS; HEURISTIC METHODS; POLYNOMIAL APPROXIMATION; SEARCH ENGINES;

DOMAIN STRUCTURE; HEURISTIC FUNCTIONS; LOCAL MINIMA; UPPER BOUNDS;

TOPOLOGY;

EID: 31144454040     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1747     Document Type: Article

References (71)

1. Bacchus, F. (2001). The AIPS'00 planning competition. The AI Magazine, 22(3), 47-56.
2. Biundo, S., & Fox, M. (Eds.). (1999). Recent Advances in AI Planning. 5th European Conference on Planning (ECP'99), Lecture Notes in Artificial Intelligence, Durham, UK. Springer-Verlag.
3. Blum, A. L., & Furst, M. L. (1995). Fast planning through planning graph analysis. In Mellish, S. (Ed.), Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pp. 1636-1642, Montreal, Canada. Morgan Kaufmann.
4. Blum, A. L., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2), 279-298.
5. Bonet, B., & Geffner, H. (1999). Planning as heuristic search: New results.. In Biundo, & Fox (Biundo & Fox, 1999), pp. 60-72.
6. Bonet, B., & Geffner, H. (2001a). Heuristic search planner 2.0. The AI Magazine, 22(3), 77-80.
7. Bonet, B., & Geffner, H. (2001b). Planning as heuristic search. Artificial Intelligence, 129(1-2), 5-33.
8. Bonet, B., Loerincs, G., & Geffner, H. (1997). A robust and fast action selection mechanism for planning. In Kuipers, B. J., & Webber, B. (Eds.), Proceedings of the 14th National Conference of the American Association for Artificial Intelligence (AAAI-97), pp. 714-719, Portland, OR. MIT Press.
9. Botea, A., Müller, M., & Schaeffer, J. (2004). Using component abstraction for automatic generation of macro-actions.. In Koenig et al. (Koenig, Zilberstein, & Koehler, 2004), pp. 181-190.
10. Botea, A., Müller, M., & Schaeffer, J. (2005). Learning partial-order macros from solutions. In Biundo, S., Myers, K., & Rajan, K. (Eds.), Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS-05), pp. 231-240, Monterey, CA, USA. Morgan Kaufmann.
11. Brazdil, P., & Jorge, A. (Eds.)., EPIA-01 (2001). Proceedings of the 10th Portuguese Conference on Artificial Intelligence (EPIA-01), Porto, Portugal. Springer-Verlag.
12. Bylander, T. (1994). The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2), 165-204.
13. Cesta, A., & Borrajo, D. (Eds.). (2001). Recent Advances in AI Planning. 6th European Conference on Planning (ECP'01), Lecture Notes in Artificial Intelligence, Toledo, Spain. Springer-Verlag.
14. Chen, Y., Hsu, C., & Wah, B. (2004). SGPlan: Subgoal partitioning and resolution in planning.. In Edelkamp et al. (Edelkamp, Hoffmann, Littman, & Younes, 2004).
15. Chen, Y., & Wah, B. (2003). Automated planning and scheduling using calculus of variations in discrete space.. In Giunchiglia et al. (Giunchiglia, Muscettola, & Nau, 2003), pp. 2-11.
16. Chien, S., Kambhampati, R., & Knoblock, C. (Eds.)., AIPS-00 (2000). Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems (AIPS-00), Breckenridge, CO. AAAI Press, Menlo Park.
17. Do, M. B., & Kambhampati, S. (2001). Sapa: A domain-independent heuristic metric temporal planner.. In Cesta, & Borrajo (Cesta & Borrajo, 2001), pp. 109-120.
18. Edelkamp, S. (2003a). Promela planning. In Ball, T., & Rajamani, S. (Eds.), Proceedings of the 10th International SPIN Workshop on Model Checking of Software (SPIN-03), pp. 197-212, Portland, OR. Springer-Verlag.
19. Edelkamp, S. (2003b). Taming numbers and durations in the model checking integrated planning system. Journal of Artificial Intelligence Research, 20, 195-238.
20. Edelkamp, S., & Helmert, M. (2001). MIPS: The model checking integrated planning system. AI Magazine, 22(3), 67-71.
21. Edelkamp, S., Hoffmann, J., Englert, R., Liporace, F., Thiebaux, S., & Trüg, S. (2005). Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4. Journal of Artificial Intelligence Research. Submitted.
22. Edelkamp, S., Hoffmann, J., Littman, M., & Younes, H. (Eds.)., IPC-04 (2004). Proceedings of the 4th International Planning Competition, Whistler, BC, Canada. JPL.
23. Fox, M., & Long, D. (1998). The automatic inference of state invariants in TIM. Journal of Artificial Intelligence Research, 9, 367-421.
24. Fox, M., & Long, D. (2001). STAN4: A hybrid planning strategy based on subproblem abstraction. The AI Magazine, 22(3), 81-84.
25. Frank, J., Cheeseman, P., & Stutz, J. (1997). When gravity fails: Local search topology. Journal of Artificial Intelligence Research, 7, 249-281.
26. Gazen, B. C., & Knoblock, C. (1997). Combining the expressiveness of UCPOP with the efficiency of Graphplan.. In Steel, & Alami (Steel & Alami, 1997), pp. 221-233.
27. Gerevini, A., & Schubert, L. (2000). Inferring state constraints in DISCOPLAN: Some new results.. In Kautz, & Porter (Kautz & Porter, 2000), pp. 761-767.
28. Gerevini, A., & Schubert, L. (2001). DISCOPLAN: an efficient on-line system for computing planning domain invariants.. In Cesta, & Borrajo (Cesta & Borrajo, 2001), pp. 433-436.
29. Gerevini, A., Saetti, A., & Serina, I. (2003). Planning through stochastic local search and temporal action graphs. Journal of Artificial Intelligence Research, 20, 239-290.
30. Gerevini, A., & Serina, I. (2002). LPG: A planner based on local search for planning graphs with action costs.. In Ghallab et al. (Ghallab, Hertzberg, & Traverso, 2002), pp. 13-22.
31. Gerevini, A., Serina, I., Saetti, A., & Spinoni, S. (2003). Local search techniques for temporal planning in LPG.. In Giunchiglia et al. (Giunchiglia et al., 2003). Accepted for publication.
32. Ghallab, M., Hertzberg, J., & Traverso, P. (Eds.)., AIPS-02 (2002). Proceedings of the 6th International Conference on Artificial Intelligence Planning and Scheduling (AIPS-02), Toulouse, France. Morgan Kaufmann.
33. Giunchiglia, E., Muscettola, N., & Nau, D. (Eds.)., ICAPS-03 (2003). Proceedings of the 13th International Conference on Automated Planning and Scheduling (ICAPS-03), Trento, Italy. Morgan Kaufmann.
34. Haslum, P., & Geffner, H. (2000). Admissible heuristics for optimal planning.. In Chien et al. (Chien, Kambhampati, & Knoblock, 2000), pp. 140-149.
35. Helmert, M. (2003). Complexity results for standard benchmark domains in planning. Artificial Intelligence, 143, 219-262.
36. Helmert, M. (2004). A planning heuristic based on causal graph analysis.. In Koenig et al. (Koenig et al., 2004), pp. 161-170.
37. Helmert, M., & Richter, S. (2004). Fast downward - making use of causal dependencies in the problem representation.. In Edelkamp et al. (Edelkamp et al., 2004).
38. Hoffmann, J. (2000). A heuristic for domain independent planning and its use in an enforced hill-climbing algorithm. In Ras, Z. W., & Ohsuga, S. (Eds.), Proceedings of the 12th International Symposium on Methodologies for Intelligent Systems (ISMIS-00), pp. 216-227, Charlotte, NC. Springer-Verlag.
39. Hoffmann, J. (2001a). FF: The fast-forward planning system. The AI Magazine, 22(3), 57-62.
40. Hoffmann, J. (2001b). Local search topology in planning benchmarks: An empirical analysis.. In Nebel (Nebel, 2001), pp. 453-458.
41. Hoffmann, J. (2002). Extending FF to numerical state variables. In Harmelen, F. V. (Ed.), Proceedings of the 15th European Conference on Artificial Intelligence (ECAI-02), pp. 571-575, Lyon, France. Wiley.
42. Hoffmann, J. (2003a). The Metric-FF planning system: Translating "ignoring delete lists" to numeric state variables. Journal of Artificial Intelligence Research, 20, 291-341.
43. Hoffmann, J. (2003b). Utilizing Problem Structure in Planning: A Local Search Approach, Vol. 2854 of Lecture Notes in Artificial Intelligence. Springer-Verlag.
44. Hoffmann, J. (2003c). Where ignoring delete lists works: Local search topology in planning benchmarks. Tech. rep. 185, Albert-Ludwigs-Universität, Institut für Informatik, Freiburg, Germany. Available at http://www.mpi-inf.mpg.de/~hoffmann/papers/jair05report.ps.gz.
45. Hoffmann, J., & Edelkamp, S. (2005). The deterministic part of IPC-4: An overview. Journal of Artificial Intelligence Research. To appear.
46. Hoffmann, J., & Nebel, B. (2001a). The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14, 253-302.
47. Hoffmann, J., & Nebel, B. (2001b). RIFO revisited: Detecting relaxed irrelevance.. In Cesta, & Borrajo (Cesta & Borrajo, 2001), pp. 325-336.
48. Kautz, H. A., & Porter, B. (Eds.)., AAAI-00 (2000). Proceedings of the 17th National Conference of the American Association for Artificial Intelligence (AAAI-00), Austin, TX. MIT Press.
49. Koehler, J., & Hoffmann, J. (2000). On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. Journal of Artificial Intelligence Research, 12, 338-386.
50. Koehler, J., & Schuster, K. (2000). Elevator control as a planning problem... In Chien et al. (Chien et al., 2000), pp. 331-338.
51. Koenig, S., Zilberstein, S., & Koehler, J. (Eds.)., ICAPS-04 (2004). Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS-04), Whistler, Canada. Morgan Kaufmann.
52. Long, D., & Fox, M. (2000). Automatic synthesis and use of generic types in planning.. In Chien et al. (Chien et al., 2000), pp. 196-205.
53. Long, D., & Fox, M. (2003). The 3rd international planning competition: Results and analysis. Journal of Artificial Intelligence Research, 20, 1-59.
54. McDermott, D. (1996). A heuristic estimator for means-ends analysis in planning. In Drabble, B. (Ed.), Proceedings of the 3rd International Conference on Artificial Intelligence Planning Systems (AIPS-96), pp. 142-149. AAAI Press, Menlo Park.
55. McDermott, D. (2000). The 1998 AI planning systems competition. The AI Magazine, 21(2), 35-55.
56. McDermott, D. V. (1999). Using regression-match graphs to control search in planning. Artificial Intelligence, 109(1-2), 111-159.
57. Nebel, B. (Ed.)., IJCAI-01 (2001). Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), Seattle, Washington, USA. Morgan Kaufmann.
58. Nebel, B., Dimopoulos, Y., & Koehler, J. (1997). Ignoring irrelevant facts and operators in plan generation.. In Steel, & Alami (Steel & Alami, 1997), pp. 338-350.
59. Nguyen, X., & Kambhampati, S. (2000). Extracting effective and admissible heuristics from the planning graph.. In Kautz, & Porter (Kautz & Porter, 2000), pp. 798-805.
60. Nguyen, X., & Kambhampati, S. (2001). Reviving partial order planning.. In Nebel (Nebel, 2001), pp. 459-464.
61. Onaindia, E., Sapena, O., Sebastia, L., & Marzal, E. (2001). Simplanner: an execution-monitoring system for replanning in dynamic worlds.. In Brazdil, & Jorge (Brazdil & Jorge, 2001), pp. 393-400.
62. Penberthy, J. S., & Weld, D. S. (1992). UCPOP: A sound, complete, partial order planner for ADL. In Nebel, B., Swartout, W., & Rich, C. (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the 3rd International Conference (KR-92), pp. 103-114, Cambridge, MA. Morgan Kaufmann.
63. Refanidis, I., & Vlahavas, I. (1999). GRT: a domain independent heuristic for STRIPS worlds based on greedy regression tables.. In Biundo, & Fox (Biundo & Fox, 1999), pp. 47-59.
64. Refanidis, I., & Vlahavas, I. (2001). The CRT planning system: Backward heuristic construction in forward state-space planning. Journal of Artificial Intelligence Research, 15, 115-161.
65. Rintanen, J. (2000). An iterative algorithm for synthesizing invariants.. In Kautz, & Porter (Kautz & Porter, 2000), pp. 806-811.
66. Sebastia, L., Onaindia, E., & Marzal, E. (2001). Stella: An optimal sequential and parallel planner.. In Brazdil, & Jorge (Brazdil & Jorge, 2001), pp. 409-416.
67. Srivastava, B., Nguyen, X., Kambhampati, S., Do, M. B., Nambiar, U., Nie, Z., Nigenda, R., & Zimmermann, T. (2001). Altalt: Combining graphplan and heuristic state search. The AI Magazine, 22(3), 88-90.
68. Steel, S., & Alami, R. (Eds.). (1997). Recent Advances in AI Planning. 4-th European Conference on Planning (ECP'97), Vol. 1348 of Lecture Notes in Artificial Intelligence, Toulouse, France. Springer-Verlag.
69. Thiebaux, S., Hoffmann, J., & Nebel, B. (2003). In defence of PDDL axioms. In Gottlob, G. (Ed.), Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), pp. 961-966, Acapulco, Mexico. Morgan Kaufmann.
70. Thiebaux, S., Hoffmann, J., & Nebel, B. (2005). In defence of PDDL axioms. Artificial Intelligence. To appear.
71. Younes, H., & Simmons, R. (2002). On the role of ground actions in refinement planning.. In Ghallab et al. (Ghallab et al., 2002), pp. 54-61.