The fast downward planning system

Journal of Artificial Intelligence Research

Volumn 26, Issue , 2006, Pages 191-246

  Helmert, Malte ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DECISION MAKING; PROBLEM SOLVING;

AXIOMS; CLASSICAL PLANNING SYSTEM; MULTIVALUED PLANNING TASKS; PROGRESSION PLANNER;

HEURISTIC METHODS;

EID: 33749001469     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1705     Document Type: Article

References (34)

1. Bacchus, F., & Yang, Q. (1994). Downward refinement and the efficiency of hierarchical problem solving. Artificial Intelligence, 71(1), 43-100.
2. + planning. Computational Intelligence, 17(4), 625-655.
3. Bonet, B., & Geffner, H. (2001). Planning as heuristic search. Artificial Intelligence, 729(1), 5-33.
4. Brafman, R. I., & Domshlak, C. (2003). Structure and complexity in planning with unary operators. Journal of Artificial Intelligence Research, 18, 315-349.
5. Bylander, T. (1994). The computational complexity of prepositional STRIPS planning. Artificial Intelligence, 59(1-2), 165-204.
6. Domshlak, C., & Brafman, R. I. (2002). Structure and complexity in planning with unary operators. In Ghallab, M., Hertzberg, J., & Traverso, P. (Eds.), Proceedings of the Sixth International Conference on Artificial Intelligence Planning and Scheduling (AIPS2002), pp. 34-43. AAAI Press.
7. Domshlak, C., & Dinitz, Y. (2001). Multi-agent off-line coordination: Structure and complexity. In Cesta, A., & Borrajo, D. (Eds.), P re-proceedings of the Sixth European Conference on Planning (ECP'01), pp. 277-288, Toledo, Spain.
8. Dowling, W. F., & Gallier, J. H. (1984). Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming, 1(3), 367-383.
9. Edelkamp, S., & Helmert, M. (1999). Exhibiting knowledge in planning problems to minimize state encoding length. In Fox, M., & Biundo, S. (Eds.), Recent Advances in AI Planning. 5th European Conference on Planning (ECP'99), Vol. 1809 of Lecture Notes in Artificial Intelligence, pp. 135-147, New York. Springer-Verlag.
10. Edelkamp, S., & Hoffmann, J. (2004). PDDL2.2: The language for the classical part of the 4th International Planning Competition. Tech. rep. 195, Albert-Ludwigs-Universität Freiburg, Institut für Informatik.
11. Fox, M., & Long, D. (2003). PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research, 20, 61-124.
12. Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman.
13. Gerevini, A., Saetti, A., & Serina, I. (2003). Planning through stochastic local search and temporal action graphs in LPG. Journal of Artificial Intelligence Research, 20, 239-290.
14. Ginsberg, M. L., & Harvey, W. D. (1992). Iterative broadening. Artificial Intelligence, 55, 367-383.
15. Helmert, M. (2004). A planning heuristic based on causal graph analysis. In Zilberstein, S., Koehler, J., & Koenig, S. (Eds.), Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), pp. 161-170. AAAI Press.
16. Hoffmann, J. (2001). Local search topology in planning benchmarks: An empirical analysis. In Nebel, B. (Ed.), Proceedings of the I7th International Joint Conference on Artificial Intelligence (IJCAI'01), pp. 453-458. Morgan Kaufmann.
17. Hoffmann, J. (2002). Local search topology in planning benchmarks: A theoretical analysis. In Ghallab, M., Hertzberg, J., & Traverso, P. (Eds.), Proceedings of the Sixth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002), pp. 92-100. AAAI Press.
18. Hoffmann, J. (2005). Where 'ignoring delete lists' works: Local search topology in planning benchmarks. Journal of Artificial Intelligence Research, 24, 685-758.
19. Hoffmann, J., & Edelkamp, S. (2005). The deterministic part of IPC-4: An overview. Journal of Artificial Intelligence Research, 24, 519-579.
20. Hoffmann, J., & Nebel, B. (2001). The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14, 253-302.
21. Jonsson, P., & Bäckström, C. (1995). Incremental planning. In Ghallab, M., & Milani, A. (Eds.), New Directions in AI Planning: EWSP '95 - 3rd European Workshop on Planning, Vol. 31 of Frontiers in Artificial Intelligence and Applications, pp. 79-90, Amsterdam. IOS Press.
22. Jonsson, P., & Bäckström, C. (1998a). State-variable planning under structural restrictions: Algorithms and complexity. Artificial Intelligence, 100(1-2), 125-176.
23. Jonsson, P., & Bäckström, C. (1998b). Tractable plan existence does not imply tractable plan generation. Annals of Mathematics and Artificial Intelligence, 22(3), 281-296.
24. Joslin, D., & Roach, J. (1989). A theoretical analysis of conjunctive-goal problems. Artificial Intelligence, 41(1), 97-106. Research Note.
25. Knoblock, C. A. (1994). Automatically generating abstractions for planning. Artificial Intelligence, 68(2), 243-302.
26. Korf, R. E. (1987). Planning as search: A quantitative approach. Artificial Intelligence, 33(1), 65-88.
27. Lowerre, B. T. (1976). The HARPY Speech Recognition System. Ph.D. thesis, Computer Science Department, Carnegie-Mellon University, Pittsburgh, Pennsylvania.
28. Newell, A., & Simon, H. A. (1963). GPS: A program that simulates human thought. In Feigenbaum, E. A., & Feldman, J. (Eds.), Computers and Thought, pp. 279-293. Oldenbourg.
29. Russell, S., & Norvig, P. (2003). Artificial Intelligence - A Modern Approach. Prentice Hall.
30. Sacerdoti, E. D. (1974). Planning in a hierarchy of abstraction spaces. Artificial Intelligence, 5, 115-135.
31. Tenenberg, J. D. (1991). Abstraction in planning. In Allen, J. F., Kautz, H. A., Pelavin, R. N., & Tenenberg, J. D., Reasoning About Plans, chap. 4, pp. 213-283. Morgan Kaufmann, San Mateo.
32. van den Briel, M., Vossen, T., & Kambhampati, S. (2005). Reviving integer programming approaches for AI planning: A branch-and-cut framework. In Biundo, S., Myers, K., & Rajan, K. (Eds.), Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), pp. 310-319. AAAI Press.
33. Williams, B. C., & Nayak, P. P. (1997). A reactive planner for a model-based executive. In Pollack, M. E. (Ed.), Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI'97), pp. 1178-1195. Morgan Kaufmann.
34. Yoshizumi, T., Miura, T., & Ishida, T. (2000). A* with partial expansion for large branching factor problems. In Kautz, H., & Porter, B. (Eds.), Proceedings of the Seventeenth National Conference on Artificial Intelligence (AMI-2000), pp. 923-929. AAAI Press.