Flaw selection strategies for partial-order planning

Journal of Artificial Intelligence Research

Volumn 6, Issue , 1997, Pages 223-262

  Pollack, Martha E ^a   Joslin, David ^b   Paolucci, Massimo ^c  

^a University of Pittsburgh   (United States)

^b UNIVERSITY OF OREGON   (United States)

^c UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (28)

1. Allen, J. F., Schubert, L. K., Ferguson, G. M., Heeman, P. A., Hwant, C. H., Kato, T., Light, M., Margin, N. G., Miller, B. W., Poesio, M., & Traum, B. R. (1995). The TRAINS project: A case study in building a conversational planning agent. Experimental and Theoretical Artificial Intelligence, 7, 7-48.
2. Chapman, D. (1987). Planning for conjunctive goals. Artificial Intelligence, 52(3), 333-378.
3. Currie, K., & Tate, A. (1991). O-plan: The open planning architecture. Artificial Intelligence, 52, 49-86.
4. Etzioni, O., Hanks, S., Weld, D., Draper, D., Lesh, N., & Williamson, M. (1992). An approach to planning with incomplete information. In Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning, pp. 115-125.
5. Gerevini, A. (1997). Personal communication.
6. Gerevini, A., & Schubert, L. (1996). Accelerating partial-order planners: Some techniques for effective search control and pruning. Journal of Artificial Intelligence Research, 5, 95-137.
7. Joslin, D. (1996). Passive and Active Decision Postponement in Plan Generation. Ph.D. thesis, Intelligent Systems Program, University of Pittsburgh.
8. Joslin, D., & Pollack, M. E. (1994). Least-cost flaw repair: A plan refinement strategy for partial-order planning. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI), pp. 1004-1009 Seattle, WA.
9. Joslin, D., & Pollack, M. E. (1996). Is "early commitment" in plan generation ever a good idea?. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI), pp. 1188-1193 Portland, OR.
10. Kambhampati, S., Knoblock, C. A., & Yang, Q. (1995). Planning as refinement search: A unified framework for evaluating design tradeoffs in partial-order planning. Artificial Intelligence, 76(1-2), 167-238.
11. Kumar, V. (1992). Algorithms for constraint-satisfaction problems: A survey. AI Magazine, 13(1), 32-44.
12. McAllester, D., & Rosenblitt, D. (1991). Systematic nonlinear planning. In Proceedings of the Ninth National Conference on Artificial Intelligence, pp. 634-639 Anaheim, CA.
13. Pednault, E. P. D. (1988). Synthesizing plans that contain actions with context-dependent effects. Computational Intelligence, 4(4), 356-372.
14. Penberthy, J. S., & Weld, D. (1992). UCPOP: A sound, complete, partial order planner for ADL. In Proceedings of the Third International Conference on Knowledge Representation and Reasoning, pp. 103-114 Cambridge, MA.
15. Peot, M., & Smith, D. E. (1992). Conditional nonlinear planning. In Proceedings of the First International Conference on AI Planning Systems (AIPS-92), pp. 189-197 College Park, MD.
16. Peot, M., & Smith, D. E. (1993). Threat-removal strategies for partial-order planning. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pp. 492-499 Washington, D.C.
17. Pollack, M. E., & Ringuette, M. (1990). Introducing the Tileworld: Experimentally evaluating agent architectures. In Proceedings of the Eighth National Conference on Artificial Intelligence, pp. 183-189 Boston, MA.
18. Russell, S., & Norvig, P. (1995). Artificial Intelligence: A Modern Approach. Prentice Hall, Englewood Cliffs, NJ.
19. Russell, S. J. (1992). Efficient memory-bounded search algorithms. In Proceedings of the Tenth European Conference on Artificial Intelligence, pp. 1-5.
20. Smith, D. E., & Peot, M. A. (1994). A note on the DMIN strategy. Unpublished manuscript.
21. Srinivasan, R., & Howe, A. E. (1995). Comparison of methods for improving search efficiency in a partial-order planner. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, pp. 1620-1626.
22. Tate, Á., Drabble, B., & Dalton, J. (1994). Reasoning with constraints within O-plan2. Tech. rep. ARPA-RL/O-Plan2/TP/6 V. 1, AIAI, Edinburgh.
23. Tsang, E. (1993). Foundations of Constraint Satisfaction. Academic Press.
24. Tsuneto, R., Erol, K., Hendler, J., & Nau, D. (1996). Commitment strategies in hierarchical task network planning. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI), pp. 526-542 Portland, OR.
25. Weld, D. S. (1994). An introduction to least commitment planning. AI Magazine, 15(4), 27-61.
26. Wilkins, D. E. (1988). Practical Planning: Extending the Classical AI Paradigm. Morgan Kaufmann, San Mateo, CA.
27. Wilkins, D. E., & Desimone, R. V. (1994). Applying an AI planner to military operations planning. In Fox, M., & Zweben, M. (Eds.), Intelligent Scheduling, pp. 685-708. Morgan Kaufmann Publishers, San Mateo, CA.
28. Williamson, M., & Hanks, S. (1996). Flaw selection strategies for value-directed planning. In Proceedings of the Third International Conference on Artificial Intelligence Planning Systems, pp. 237-244.