The FF planning system: Fast plan generation through heuristic search

Journal of Artificial Intelligence Research

Volumn 14, Issue , 2001, Pages 263-312

  Hoffmann, Jörg ^a   Nebel, Bernhard ^a  

^a NONE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; HEURISTIC METHODS; SPACE RESEARCH;

HEURISTIC-SEARCH PLANNING (HSP);

STRATEGIC PLANNING;

EID: 0036377352     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.855     Document Type: Article

References (47)

1. Anderson, C. R., Smith, D. E., & Weld, D. S. (1998). Conditional effects in Graphplan. In Simmons, R., Veloso, M., & Smith, S. (Eds.), Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems (AIPS-98), pp. 44-53. AAAI Press, Menlo Park.
2. Bacchus, F. (2000). Subset of PDDL for the AIPS2000 Planning Competition. The AIPS-00 Planning Competition Comitee.
3. Bacchus, F., & Nau, D. (2001). The 2000 AI planning systems competition. The AI Magazine. Forthcoming.
4. Blum, A. L., & Furst, M. L. (1995). Fast planning through planning graph analysis. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pp. 1636-1642 Montreal, Canada. Morgan Kaufmann.
5. Blum, A. L., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2), 279-298.
6. Bonet, B., & Geifner, H. (1998). HSP: Heuristic search planner. In AIPS-98 Planning Competition Pittsburgh, PA.
7. Bonet, B., & Geffner, H. (1999). Planning as heuristic search: New results. In Biundo, S., & Fox, M. (Eds.), Recent Advances in AI Planning. 5th European Conference on Planning (ECP'99) Durham, UK. Springer-Verlag.
8. Bonet, B., & Geffner, H. (2001). Planning as heuristic search. Artificial Intelligence. Forthcoming.
9. Bonet, B., Loerincs, G., & Geffner, H. (1997). A robust and fast action selection mechanism for planning. In Proceedings of the 14th National Conference of the American Association for Artificial Intelligence (AAAI-97), pp. 714-719. MIT Press.
10. Bylander, T. (1994). The computational complexity of prepositional STRIPS planning. Artificial Intelligence, 69(1-2), 165-204.
11. Cheng, J., & Irani, K. B. (1989). Ordering problem subgoals. In Sridharan, N. S. (Ed.), Proceedings of the 11th International Joint Conference on Artificial Intelligence (IJCAI-89), pp. 931-936 Detroit, MI. Morgan Kaufmann.
12. Drummond, M., & Currie, K. (1989). Goal ordering in partially ordered plans. In Sridharan, N. S. (Ed.), Proceedings of the 11th International Joint Conference on Artificial Intelligence (IJCAI-89), pp. 960-965 Detroit, MI. Morgan Kaufmann.
13. Edelkamp, S. (2000). Heuristic search planning with BDDs. In ECAI-Workshop: PuK.
14. Even, S., & Shiloach, Y. (1975). NP-completeness of several arrangement problems. Tech. rep. 43, Department of Computer Science, Haifa, Israel.
15. Fikes, R. E., & Nilsson, N. (1971). STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2, 189-208.
16. Fox, M., & Long, D. (1998). The automatic inference of state invariants in tim. Journal of Artificial Intelligence Research, 9, 367-421.
17. Fox, M., & Long, D. (2001). Hybrid STAN: Identifying and managing combinatorial optimisation sub-problems in planning. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01) Seattle, Washington, USA. Morgan Kaufmann. Accepted for publication.
18. Frank, J., Cheeseman, P., & Stutz, J. (1997). When gravity fails: Local search topology. Journal of Artificial Intelligence Research, 7, 249-281.
19. Gazen, B. C., & Knoblock, C. (1997). Combining the expressiveness of UCPOP with the efficiency of Graphplan. In Steel, S., & Alami, R. (Eds.), Recent Advances in AI Planning. 4th European Conference on Planning (ECP'97), Vol. 1348 of Lecture Notes in Artificial Intelligence, pp. 221-233 Toulouse, France. Springer-Verlag.
20. Hoffmann, J. (2000). A heuristic for domain independent planning and its use in an enforced hill-climbing algorithm. In Proceedings of the 12th International Symposium on Methodologies for Intelligent Systems (ISMIS-00), pp. 216-227. Springer-Verlag.
21. Hoffmann, J. (2001). Local search topology in planning benchmarks: An empirical analysis. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01) Seattle, Washington, USA. Morgan Kaufmann. Accepted for publication.
22. Hölldobler, S., & Störr, H.-P. (2000). Solving the entailment problem in the fluent calculus using binary decision diagrams. In Proceedings of the First International Conference on Computational Logic (CL). To appear.
23. Irani, K. B., & Cheng, J. (1987). Subgoal ordering and goal augmentation for heuristic problem solving. In McDermott, J. (Ed.), Proceedings of the 10th International Joint Conference on Artificial Intelligence (IJCAI-87), pp. 1018-1024 Milan, Italy. Morgan Kaufmann.
24. Jonsson, P., Haslum, P., & Bäckström, C. (2000). Planning - a randomized approach. Artificial Intelligence, 117(1), 1-29.
25. Joslin, D., & Roach, J. W. (1990). A theoretical analysis of conjunctive-goal problems. Artificial Intelligence, 41, 97-106.
26. Kambhampati, S., Parker, E., & Lambrecht, E. (1997). Understanding and extending Graphplan. In Steel, S., & Alami, R. (Eds.), Recent Advances in AI Planning. 4th European Conference on Planning (ECP'97), Vol. 1348 of Lecture Notes in Artificial Intelligence, pp. 260-272 Toulouse, France. Springer-Verlag.
27. Kautz, H., & Selman, B. (1999). Unifying SAT-based and graph-based planning. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pp. 318-325 Stockholm, Sweden. Morgan Kaufmann.
28. Kautz, H. A., & Selman, B. (1996). Pushing the envelope: Planning, prepositional logic, and stochastic search. In Proceedings of the 13th National Conference of the American Association for Artificial Intelligence (AAAI-96), pp. 1194-1201. MIT Press.
29. Koehler, J. (1998). Solving complex planning tasks through extraction of subproblems. In Simmons, R., Veloso, M., & Smith, S. (Eds.), Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems (AIPS-98), pp. 62-69. AAAI Press, Menlo Park.
30. Koehler, J., & Hoffmann, J. (2000a). On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. Journal of Artificial Intelligence Research, 12, 338-386.
31. Koehler, J., & Hoffmann, J. (2000b). On the instantiation of ADL operators involving arbitrary first-order formulas. In Proceedings ECAI-00 Workshop on New Results in Planning, Scheduling and Design.
32. Koehler, J., Nebel, B., Hoffmann, J., & Dimopoulos, Y. (1997). Extending planning graphs to an ADL subset. In Steel, S., & Alami, R. (Eds.), Recent Advances in AI Planning. 4th European Conference on Planning (ECP'97), Vol. 1348 of Lecture Notes in Artificial Intelligence, pp. 273-285 Toulouse, France. Springer-Verlag.
33. Koehler, J., & Schuster, K. (2000). Elevator control as a planning problem. In Chien, S., Kambhampati, R., &: Knoblock, C. (Eds.), Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems (AIPS-00). AAAI Press, Menlo Park.
34. Long, D., & Fox, M. (1999). Efficient implementation of the plan graph in stan. Journal of Artificial Intelligence Research, 10, 87-115.
35. McAllester, D. A., & Rosenblitt, D. (1991). Systematic nonlinear planning. In Proceedings of the 9th National Conference of the American Association for Artificial Intelligence (AAAI-91), pp. 634-639 Anaheim, CA. MIT Press.
36. McDermott, D. (1996). A heuristic estimator for means-ends analysis in planning. In Proceedings of the 3rd International Conference on Artificial Intelligence Planning Systems (AIPS-96), pp. 142-149. AAAI Press, Menlo Park.
37. McDermott, D., et al. (1998). The PDDL Planning Domain Definition Language. The AIPS-98 Planning Competition Comitee.
38. McDermott, D. V. (1999). Using regression-match graphs to control search in planning. Artificial Intelligence, 109(1-2), 111-159.
39. Mitchell, D., Selman, B., & Levesque, H. J. (1992). Hard and easy distributions of SAT problems. In Proceedings of the 10th National Conference of the American Association for Artificial Intelligence (AAAI-92), pp. 459-465 San Jose, CA. MIT Press.
40. Nebel, B. (2000). On the compilability and expressive power of propositional planning formalisms. Journal of Artificial Intelligence Research, 12, 271-315.
41. Nebel, B., Dimopoulos, Y., & Koehler, J. (1997). Ignoring irrelevant facts and operators in plan generation. In Steel, S., & Alami, R. (Eds.), Recent Advances in AI Planning. 4th European Conference on Planning (ECP'97), Vol. 1348 of Lecture Notes in Artificial Intelligence, pp. 338-350 Toulouse, France. Springer-Verlag.
42. Pednault, E. P. (1989). ADL: Exploring the middle ground between STRIPS and the situation calculus. In Brachman, R., Levesque, H. J., & Reiter, R. (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the 1st International Conference (KR-89), pp. 324-331 Toronto, ON. Morgan Kaufmann.
43. Refanidis, I., & Vlahavas, I. (1999). GRT: a domain independent heuristic for STRIPS worlds based on greedy regression tables. In Biundo, S., & Fox, M. (Eds.), Recent Advances in AI Planning. 5th European Conference on Planning (ECP'99) Durham, UK. Springer-Verlag.
44. Refanidis, I., & Vlahavas, I. (2000). Exploiting state constraints in heuristic state-space planning. In Chien, S., Kambhampati, R., &: Knoblock, C. (Eds.), Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems (AIPS-00), pp. 363-370. AAAI Press, Menlo Park.
45. Russell, S., & Norvig, P. (1995). Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs, NJ.
46. Siegel, S., & N. J. Castellan, J. (1988). Nonparametric Statistics for the Behavioral Sciences (2nd edition). McGraw-Hill.
47. Slaney, J., & Thiebaux, S. (2001). Blocks world revisited. Artificial Intelligence, 125, 119-153.