Improving Graphplan's search with EBL & DDB techniques

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2, Issue , 1999, Pages 982-987

  Kambhampati, Subbarao ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCH-MARK PROBLEMS; DIFFERENT DOMAINS; EMPIRICAL STUDIES; EXPLANATION BASED LEARNING; GRAPHPLAN; RUNTIMES; SEARCH ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

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

References (15)

1. Blum, A. and Furst, M. 1997. Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2).
2. Bayardo, R. and Schrag, R. 1997. Using CSP look-back techniques to solve real-word SAT instances. In Proc. AAAI-97.
3. Fox, M, 1998 Private correspondence. Fall 1998.
4. Kambhampati, S., Parker, E., and Lambrecht, E., 1997a Understanding and Extending Graphplan. In Proceedings of 4th European Conference on Planning.
5. Kambhampati, S., Katukam, S. and Qu, Y, 1997b Failure driven Dynamic Search Control for Partial Order Planners: An Explanation-based approach", Artificial Intelligence. 88(I-2):253-315. 1997. (Pubitemid 126371544)
6. Kambhampati, S. 1998. On the relations between intelligent back-tracking and explanation-based learning in planning and constraint satisfaction. Artificial Intelligence. Vol. 105, No. 1-2.
7. Kambhampati, S., 1998b EBL and DDB for Graphplan. ASU-CSE-TR 98-008. rakaposhLeas.asu.edu/gp-ebl'tr.ps
8. Koehler, J., Nebel, B., Hoffmann, J., and Dimopoulos, Y. 1997 Extending planning graphs to an ADL Subset. Technical Report No. 88. Albert Ludwigs University.
9. Kautz, H. & Selman, B. 1996. Pushing the envelope: Planning Proposirional Logic and Stochastic Search. In Proceedings of National Conference on Artificial Intelligence.
10. McDermott, D. 1998 AIPS-98 Planning Competition Results. URL: ftp.cs.yale.edupuh/mcdennc∧dpscomp-results.html.
11. Mittal, S. & Falkenhainer, B. 1990. Dynamic Constraint Satisfaction Problems. In Proc. AAAI-90.
12. Prosser, P. 1993 . Domain filtering can degrade intelligent back-tracking search. In Proc. UCAI, 1993.
13. Tsang, E. 1993 Constraint Satisfaction. Academic Press. 1993.
14. Rymon, 1992 Set Enumeration Trees. In Proc. KR-92.
15. Zimmerman, T. & Kambhampati, S., 1999 Exploiting symmetry in the planning-graph via explanation-guided search. In Proc. AAAI-99.