On the implementation and evaluation of ABTWEAK

Computational Intelligence

Volumn 12, Issue 2, 1996, Pages 307-330

  Yang, Qiang ^a   Tenenberg, Josh D ^b   Woods, Steven ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b INDIANA UNIVERSITY SOUTH BEND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SELECTION AND EVALUATION; HIERARCHICAL SYSTEMS; ONLINE SEARCHING; PROBLEM SOLVING;

ABSTRACTION; ABTWEAK PLANNING SYSTEMS; PARTIAL ORDER PLANNING;

KNOWLEDGE BASED SYSTEMS;

EID: 0030149379     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.1467-8640.1996.tb00264.x     Document Type: Article

References (30)

1. BACCHUS, F., and Q. YANG. 1994. Downward refinement and the efficiency of hierarchical problem solving. Artificial Intelligence, 71(1):43-100.
2. BACKSTROM, C., and P. JONSSON. 1995. Planning with abstraction hierarchies can be exponentially less efficient. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), Montreal, Canada.
3. BARRETT, A., and D. WELD. 1992. Partial order planning: evaluating possible efficiency gains. Technical Report 92-05-01, University of Washington, Department of Computer Science and Engineering, Seattle, WA.
4. BARRETT, A., and D. WELD. 1994. Partial order planning: evaluating possible efficiency gains. Artificial Intelligence, 67(1):71-112.
5. CHAPMAN, D. 1987. Planning for conjunctive goals. Artificial Intelligence, 32:333-377.
6. DODGE, C. W. 1969. Numbers and mathematics. Prindle, Weber and Schmidt, Inc., Boston, MA.
7. FIKES, R., and N. NILSSON. 1971. Strips: a new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2:189-208.
8. FINK, E., and Q. YANG. 1993. Characterizing and automatically finding primary effects in planning. In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93). Morgan Kaufmann, San Francisco, CA, pp. 1374-1379.
9. KAMBHAMPATI, S. 1992. Characterizing multi-contributor causal structures for planning. In Proceedings of the First International Conference on AI Planning Systems. Morgan Kaufmann, San Francisco, CA, pp. 116-125.
10. KAMBHAMPATI, S., C. A. KNOBLOCK, and Q. YANG. 1994. Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planning. Accepted by Artificial Intelligence Journal.
11. KNOBLOCK, C. A. 1991. Automatically generating abstractions for problem solving. Ph.D. thesis, School of Computer Science, Carnegie Mellon University. Tech. Report CMU-CS-91-120.
12. KNOBLOCK, C. A., and Q. YANG. 1994. Evaluating the tradeoffs in partial-order planning algorithms. In Proceedings of the Canadian Artificial Intelligence Conference (AI94), pp. 279-286.
13. KNOBLOCK, C. A., J. TENENBERG, and Q. YANG. 1991. Characterizing abstraction hierarchies for planning. In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91). Anaheim, CA, pp. 692-698.
14. MCALLESTER, D., and D. ROSENBLITT. 1991. Systematic nonlinear planning. In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91). Morgan Kaufmann, San Francisco, CA, pp. 634-639.
15. MINTON, S. 1990. Quantitative results concerning the utility of explanation-based learning. Artificial Intelligence, 42:363-391.
16. NEWELL, A., and H. A. SIMON. 1972. Human problem solving. Prentice Hall, Englewood Cliffs, NJ.
17. PEOT, M. A., and D. E. SMITH. 1993. Threat-removal strategies for partial-order planning. In Proceedings of the 11th National Conference on Artificial Intelligence (AAAI-93), pp. 492-499.
18. SACERDOTI, E. 1974. Planning in a hierarchy of abstraction spaces. Artificial Intelligence, 5:115-135.
19. SACERDOTI, E. 1977. A structure for plans and behavior. Elsevier, New York.
20. SIKLOSSY, L., and J. DREUSSI. 1973. An efficient robot planner which generates its own procedures. In Proceedings of the 3rd IJCAI. pp. 423-430.
21. SMITH, D. E., and M. A. PEOT. 1993. Postponing threats in partial-order planning. In Proceedings of the 11th National Conference on Artificial Intelligence (AAAI-93). Washington, DC, pp. 500-506.
22. STEFIK, M. 1981. Planning with constraints. Artificial Intelligence, 16(2):111-140.
23. SUSSMAN, G. A. 1973. A computational model of skill acquisition. M.I.T. AI Lab Memo no. AI-TR-297.
24. TATE, A. 1977. Generating project networks. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence (IJCAI-77). Morgan Kaufmann, San Francisco, CA, pp. 888-893.
25. UNRUH, A., and P. S. ROSENBLOOM. 1989. Abstraction in problem solving and learning. In Proceedings of the 11th International Joint Conference on Artificial Intelligence, pp. 681-687.
26. WILKINS, D. 1984. Domain-independent planning: representation and plan generation. Artificial Intelligence, 22:269-301.
27. WOODS, S. G. 1991. An implementation and evaluation of a hierarchical non-linear planner. Master's thesis, Computer Science Department, University of Waterloo.
28. WOODS, S. 1993. A method of interactive recognition of spatially defined model deployment templates using abstraction. In Proceedings of the 1993 DND Workshop on Advanced Technologies in Knowledge Based Systems and Robotics, pp. 665-675.
29. YANG, Q. 1992. A theory of conflict resolution in planning. Artificial Intelligence, 58(1-3):361-392.
30. YANG, Q., J. TENENBERG, and S. WOODS. 1991. Abstraction in nonlinear planning. Technical Report CS 91-65, University of Waterloo, Department of Computer Science, Waterloo, Ontario, Canada N2L 3G1.