Suspending Recursion in Causal-link Planning

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

Volumn , Issue , 1996, Pages 182-190

  Smith, David E ^a   Peot, Mark A ^a  

^a ROCKWELL SCIENCE CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONDITION; LINK PLANNING; OPEN CONDITION; PLANNING PROCESS; PRUNING STRATEGY; RECURSIONS;

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

References (18)

1. Baioletti, M., Marcugini, S., Milani, A. and Rivoira. S., A nonlinear planner with loop avoidance. Fourth International Conference on Industrial & Engineering Application ofArtificial Intelligence & Expert Systems, pages 650-658, 1991.
2. Barrett, A. and Weld, D., Partial order planning: evaluating possible efficiency gains. Artificial Intelligence, vol 67(1), pages 71-112, 1994.
3. Chapman, D., Planning for conjunctive goals. Artificial Intelligence, vol 32(3), pages 333-377, 1987.
4. Gormen, T., Lciserson, C, and Rivest, R., Introduction to Algorithms. McGraw Hill, 1991.
5. Feldman, R. and Morris, P., Admissible criteria for loop control in planning. In Proc. AAAI-90, pages 151¬ 157, 1990.
6. Etzioni, O., Acquiring search-control knowledge via static analysis. Artificial Intelligence, vol 62(2), pages 255-301, 1993.
7. Fikes, R., Hart, P., and Nilsson, N., Learning and executing generalized robot plans. Artificial Intelligence, vol 3(4), pages 251-288, 1972.
8. Joslin, D. and Pollack, M., Least cost flaw repair: a plan refinement strategy for partial-order planning. In Proc. AAAI-94, pages 1004-1009, 1994.
9. Kambhampati, S., Admissable pruning strategies based on plan minimality for plan-space planning. In Proc. fJCAl-95, pages 1627-1633, 1995.
10. McAUester, D. and Roscnblitt, D., Systematic nonlinear planning. In Proc. AAAl-91. pages 634-639, Anaheim, C A, 1991.
11. Minton, S., Knoblock, C, Kuokka, D., Gil, Y., Joseph, R., and Carbonell, J., Prodigy 2.0: the manual and tutorial. Tech. Report CMU-CS-89-146, Carnegie Mellon University. Pittsburgh, PA, 1989.
12. Penberthy, J. and Weld, D., UCPOP: A sound, complete, partial order planner for ADL. In Proc. KR-92. pages 189-197. 1992.
13. Peot, M. and Smith, D., Threat removal strategics for partial-order planning. In Proc. AAAl-93, pages 492¬ 499, 1993.
14. Rich, E. and Knight, K., Artificial Intelligence. Second edition, McGraw Hill, 1991.
15. Smith, D., Genesereth, M., and Ginsberg, M., Controlling recursive inference. Artificial Intelligence, vol 30(3), pages 343-389, 1986.
16. Smith, D. and Peot, M., Postponing threats in partial order planning. In Proc. AAAÌ-93, pages 500-506, 1993.
17. Smith, D. and Peot, M., A Note on the DMIN strategy. Technical Memo, Rockwell Palo Alto Laboratory, 1993. Available on-line from http://www.rpal.rockwell.com: 80/~de2smith/publ ications.htm I
18. Tate, A., Generating project networks. In Proc. ¡JCAl-77, pages 888-893, 1977.