On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm

Journal of Artificial Intelligence Research

Volumn 12, Issue , 2000, Pages 339-

  Koehler, Jana ^a   Hoffmann, Jörg ^b  

^a Schindler Lifts Ltd   (Switzerland)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (57)

1. Allen, J. (Ed.), AIPS-98 (1998). Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems. AAAI Press, Menlo Park.
2. Anderson, C., & Weld, D. (1998). Conditional effects in Graphplan. In Allen (Allen, 1998), pp. 44-53.
3. Bacchus, F., & Yang, Q. (1994). Downward refinement and the efficiency of hierarchical problem solving. Artificial Intelligence, 71, 43-100.
4. Bäckström, C., & Jonsson, P. (1995). Planning with abstraction hierarchies can be exponentially less efficient. In Mellish (Mellish, 1995), pp. 1599-1604.
5. Barrett, A., & Weld, D. (1994). Partial-order planning: Evaluating possible efficiency gains. Artificial Intelligence, 67, 71-112.
6. Blum, A., & Furst, M. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2), 279-298.
7. 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, pp. 714-719.
8. Bundy, A., Giunchiglia, F., Sebastiani, R., & Walsh, T. (1996). Computing abstraction hierarchies by numerical simulation. In Weld, & Clancey (Weld & Clancey, 1996), pp. 523-529.
9. Bylander, T. (1992). Complexity results for serial decomposability. In Proceedings of the 10th National Conference of the American Association for Artificial Intelligence, pp. 729-734 San Jose, CA. MIT Press.
10. Bylander, T. (1994). The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69, 165-204.
11. Chapman, D. (1987). Planning for conjunctive goals. Artificial Intelligence, 32(3), 333-377.
12. Cheng, J., & Irani, K. (1989). Ordering problem subgoals. In Sridharan (Sridharan, 1989), pp. 931-936.
13. Dawsson, C., & Siklossy, L. (1977). The role of preprocessing in problem solving systems. In Proceedings of the 5th International Joint Conference on Artificial Intelligence, pp. 465-471 Cambridge, MA.
14. Dimopoulos, Y., Nebel, B., & Koehler, J. (1997). Encoding planning problems in non-monotonic logic programs. In Steel (Steel, 1997), pp. 169-181.
15. Drummond, M., & Currie, K. (1989). Goal ordering in partially ordered plans. In Sridharan (Sridharan, 1989), pp. 960-965.
16. El-Kholy, A., & Richards, B. (1996). Temporal and resource reasoning in planning: the parcPLAN approch. In Wahlster, W. (Ed.), Proceedings of the 12th European Conference on Artificial Intelligence, pp. 614-618. John Wiley & Sons, Chichester, New York.
17. Etzioni, O. (1993). Acquiring search-control knowledge via static analysis. Artificial Intelligence, 62, 255-301.
18. Fink, E., & Veloso, M. (1994). Prodigy planning algorithm. Technical report CMU-94-123, Carnegie Mellon University.
19. Fox, M., & Long, D. (1998). The automatic inference of state invariants in TIM. Journal of Artificial Intelligence Research, 9, 367-421.
20. Fox, M., & Long, D. (1999). Efficient implementation of the plan graph in STAN. Journal of Artificial Intelligence Research, 10, 87-115.
21. Hertzberg, J., & Horz, A. (1989). Towards a theory of conflict detection and resolution in nonlinear plans. In Sridharan (Sridharan, 1989), pp. 937-942.
22. Hoffmann, J. (2000). A heuristic for domain independent planning and its use in an enforced hill-climbing algorithm. In 12th International Symposium on Methods for Intelligent Systems.
23. Hüllem, J., Munoz-Avila, H., & Weberskirch, F. (1999). Extracting goal orderings to improve partial-order and Graphplan-based planning. Technical report, University of Kaiserslautern.
24. Irani, K., & Cheng, J. (1987). Subgoal ordering and goal augmentation for heuristic problem solving. In McDermott, D. (Ed.), Proceedings of the 10th International Joint Conference on Artificial Intelligence, pp. 1018-1024 Milan, Italy. Morgan Kaufmann.
25. Jonsson, P., Haslum, P., & Bäckström, C. (2000). Towards efficient universal planning: A randomized approach. Artificial Intelligence, 117(1), 1-29.
26. Joslin, D., & Roach, J. (1990). A theoretical analysis of conjunctive-goal problems. Artificial Intelligence, 41, 97-106.
27. Kambhampati, S. (1995). Admissible pruning strategies based on plan minimality for planspace planning. In Mellish (Mellish, 1995), pp. 1627-1633.
28. Kautz, H., & Selman, B. (1996). Pushing the envelope: Planning, propositional logic, and stochastic search. In Weld, & Clancey (Weld & Clancey, 1996), pp. 1194-1201.
29. Knoblock, C. (1991). Automatically Generating Abstractions for Problem Solving. Ph.D. thesis, Carnegie Mellon University.
30. Knoblock, C. (1994). Automatically generating abstractions for planning. Artificial Intelligence, 68(2), 243-302.
31. Koehler, J. (1999). Handling of conditional effects and negative goals in IPP. Technical report 128, University of Freiburg, Institute of Computer Science, available at http://www.informatik.uni-freiburg.de/~koehler/ipp.html.
32. Koehler, J., & Hoffmann, J. (1998). Planning with goal agendas. Technical report 110, University of Freiburg, available at http://www.informatik.uni-freiburg.de/~ koehler/ipp.html.
33. Koehler, J., Nebel, B., Hoffmann, J., & Dimopoulos, Y. (1997). Extending planning graphs to an ADL subset. In Steel (Steel, 1997), pp. 273-285.
34. Korf, R. (1985). Macro-operators: A weak method for learning. Artificial Intelligence, 26, 35-77.
35. Korf, R. (1987). Planning as search: A quantitative approach. Artificial Intelligence, 33, 65-88.
36. McDermott, D., & Hanks, S. (1987). Nonmonotonic logic and temporal projection. Artificial Intelligence, 33, 379-412.
37. Mellish, C. (Ed.), IJCAI-95 (1995). Proceedings of the 14th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, San Francisco, CA.
38. Nebel, B., & Bäckström, C. (1994). On the computational complexity of temporal projection, planning, and plan validation. Journal of Artificial Intelligence, 66(1), 125-160.
39. Nebel, B., Dimopoulos, Y., & Koehler, J. (1997). Ignoring irrelevant facts and operators in plan generation. In Steel (Steel, 1997), pp. 338-350.
40. Nilsson, N. (1980). Principles of Artificial Intelligence. Tioga Publishing Company, Palo Alto.
41. Pednault, E. (1989). ADL: Exploring the middle ground between STRIPS and the Situation Calculus. In Brachman, R., Levesque, H., & Reiter, R. (Eds.), Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning, pp. 324-332 Toronto, Canada. Morgan Kaufmann.
42. Penberthy, J., & Weld, D. (1992). UCPOP: A sound, complete, partial order planner for ADL. In Nebel, B., Swartout, W., & Rich, C. (Eds.), Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, pp. 103-113. Morgan Kaufmann, San Mateo.
43. Pollack, M., Joslin, D., & Paolucci, M. (1997). Selection strategies for partial-order planning. Journal of Artificial Intelligence Research, 6, 223-262.
44. Refanidis, I., & Vlahavas, I. (1999). GRT: A domain independent heuristic for STRIPS worlds based on greedy regression tables. In Proceedings of the 5th European Conference on Planning, pp. 346-358.
45. Regli, W., Gupta, S., & Nau, D. (1995). AI planning versus manufacturing-operation planning: A case study. In Mellish (Mellish, 1995), pp. 1670-1676.
46. Ruby, D., & Kibler, D. (1989). Learning subgoal sequences for planning. In Sridharan (Sridharan, 1989), pp. 609-615.
47. Russel, S., & Norvig, P. (1995). Artificial Intelligence - A modern Approach. Prentice Hall.
48. Sacerdoti, E. (1974). Planning in a hierarchy of abstraction spaces. Artificial Intelligence, 5, 115-135.
49. Sanborn, J., & Hendler, J. (1988). Near-term event projection through dynamic simulation or how did the robot cross the road? In Proceedings of the 2nd Conference on AI and Simulation.
50. Smith, D., & Peot, M. (1993). Postponing threats in partial-order planning. In Proceedings of the 11th National Conference of the American Association for Artificial Intelligence, pp. 500-506. AAAI Press, MIT Press.
51. Sridharan, N. (Ed.), IJCAI-89 (1989). Proceedings of the 11th International Joint Conference on Artificial Intelligence, Detroit, MI. Morgan Kaufmann.
52. Steel, S. (Ed.), ECP-97 (1997). Proceedings of the 4th European Conference on Planning, Vol. 1348 of LNAI. Springer.
53. Tsuneto, R., Hendler, J., & Nau, D. S. (1998). Analyzing external conditions to improve the efficiency of HTN planning. In Allen (Allen, 1998), pp. 913-920.
54. Veloso, M., & Blythe, J. (1994). Linkability: Examining causal link commitments in partial-order planning. In Hammond, K. (Ed.), Proceedings of the 2nd International Conference on Artificial Intelligence Planning Systems, pp. 170-175. AAAI Press, Menlo Park.
55. Warshall, J. (1962). A theorem on boolean matrices. Journal of the ACM, 9(1), 11-12.
56. Weld, D., & Clancey, B. (Eds.)., AAAI-96 (1996). Proceedings of the 14th National Conference of the American Association for Artificial Intelligence. AAAI Press.
57. Williams, B., & Nayak, R. (1997). A reactive planner for a model-based executive. In Proceedings of the 15th International Joint Conference on Artificial Intelligence, pp. 1178-1185. Morgan Kaufmann, San Francisco, CA.