Least-Commitment Action Selection

Proceedings of the 3rd Artificial Intelligence Planning Systems Conference, AIPS 1996

Volumn , Issue , 1996, Pages 86-93

  Friedman, Marc ^a   Weld, Daniel S ^a  

^a University of Washington   (United States)

Author keywords

Abstraction planning; Causal link planning

Indexed keywords

ABSTRACTION PLANNING; ACTION SELECTION; CAUSAL-LINK PLANNING; HIERARCHICAL TASK NETWORKS; LEVEL STEPS; LINK PLANNING; OPEN CONDITION; ORDER COMMITMENT; PARTIAL ORDER PLANNING; PLANNING ALGORITHMS;

ABSTRACTING;

EID: 57749198819     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Bacchus, F., and Yang, Q. 1994. Downward refinement and the efficiency of hierarchical problem solving. Artificial Intelligence 71:43-100.
2. Backstrom, C, and Jonsson, P. 1995. Planning with abstraction hierarchies can be exponentially less efficient. In Proc. 15th Int. Joint Conf. on A.I., 1599¬ 1604.
3. Barrett, A., and Weld, D. 1994. Partial order planning: Evaluating possible efficiency gains. Artificial Intelligence 67(1):71-112.
4. Chapman, D. 1987. Planning for conjunctive goals. Artificial Intelligence 32(3):333-377.
5. Garey, M., and Johnson, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman and Company.
6. Hanks, S., and Weld, D. S. 1995. A domain-independent algorithm for plan adaptation. Journal of Artificial Intelligence Research 319-360. Available via F T P from pub/ai/ at ftp.cs.washington.edu.
7. Kambhampati, S.; Knoblock, C; and Yang, Q. 1995. Planning as refinement search: A unified framework for evaluating design tradeoffs in partial order planning. Artificial Intelligence 76:167-238.
8. Kambhampati, S. 1992. Characterizing multicontributor causal structures for planning. In Proc. 1st Intl. Conf. on A.I. Planning Systems, 116-125.
9. Knoblock, C. 1991. Automatically Generating Abstractions for Problem Solving. Ph.D. Dissertation, Carnegie Mellon University. Available as technical report CMU-CS-91-120.
10. Knoblock, C. 1992. An analysis of A B STRIPS. In Proc. 1st Intl. Conf on A.I. Planning Systems.
11. Kramer, M., and Unger, C. 1993. A generalizing operator abstraction. In Proceedings of the Second European Workshop on Planning.
12. McAUester, D., and Rosenblitt, D. 1991. Systematic nonlinear planning. In Proc. 9th Nat. Conf. on A.I., 634-639.
13. Minton, S.; Drummond, M.; Bresina, J.; and Phillips, A. 1992. Total order vs. partial order planning: Factors influencing performance. In Proc. 3rd Int. Conf. on Principles of Knowledge Representation and Reasoning.
14. Minton, S.; Bresina, J.; and Drummond, M. 1991. Commitment strategies in planning: A comparative analysis. In Proceedings of IJCAI-91, 259-265. Mitchell, T. 1982. Generalization as search. Artificial Intelligence 18:203-226.
15. Penberthy, J., and Weld, D. 1992. U C P O P: A sound, complete, partial order planner for A D L. In Proc. 3rd Int. Conf. on Principles of Knowledge Representation and Reasoning, 103-114. Available via F T P from pub/ai/ at f t p. c s. Washington. edu.
16. Peot, M., and Smith, D. 1993. Threat-removal strategies for partial-order planning. In Proc. 11th Nat. Conf. on A.I., 492-499.
17. Sacerdoti, E. 1974. Planning in a hierarchy of abstraction spaces. Artificial Intelligence 5:115-135.
18. Sacerdoti, E. 1975. The nonlinear nature of plans. In Proceedings of IJCAI-75, 206-214.
19. Stefik, M. 1981. Planning with constraints (MOL¬ G E N: Part 1). Artificial Intelligence 14(2):111-139. Tate, A. 1975. Interacting goals and their use. In Proceedings of IJCAI-75, 215-218.
20. Veloso, M., and Blythe, J. 1994. Linkability: Examining causal link commitments in partial-order planning. In Hammond, K., ed.. Proc. 2nd Intl. Conf. on A.I. Planning Systems, 170-175. AAAI.
21. Williamson, M., and Hanks, S. 1996. Flaw selection strategies for value-directed planning. In Proc. 3rd Intl. Conf. on A.I. Planning Systems.
22. Yang, Q., and Tenenberg, J. 1990. A B T W E A K: Abstracting a nonlinear, least-commitment planner. In Proc. 8th Nat. Conf. on A.I., 204-209.