Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphlan

Journal of Artificial Intelligence Research

Volumn 12, Issue , 2000, Pages 1-

  Kambhampati, Subbarao ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (36)

1. Anderson, C., Smith, D., & Weld, D. (1998). Conditional effects in graphplan. In Proc. AI Planning Systems Conference.
2. Bacchus, F., & van Run, P. (1995). Dynamic variable ordering in CSPs. In Proc. Principles and Practice of Constraint Programming (CP-95). Published as Lecture Notes in Artificial Intelligence, No. 976. Springer Verlag.
3. Bayardo, R., & Schrag, R. (1997). Using CSP look-back techniques to solve real-world sat instances. In Proc. AAAI-97.
4. Blum, A., & Furst, M. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2).
5. Bonet, B., Loerincs, G., & Geffner, H. (1999). A robust and fast action selection mechanism for planning. In In Proc. AAAI-97.
6. Do, B., & Kambhampati, S. (2000). Solving planning graph by compiling it into CSP. In Proc. 5th International Conference on AI Planning and Scheduling.
7. Do, B., Srivastava, B., & Kambhampati, S. (2000). Investigating the effect of relevance and reachability constraints on the sat encodings of planning. In Proc. 5th International Conference on AI Planning and Scheduling.
8. Fox, M. (1998). Private correspondence..
9. Fox, M., & Long, D. (1999). Efficient implementation of plan graph. Journal of Artificial Intelligence Research, 10.
10. Frost, D., & Dechter, R. (1994). In search of the best constraint satisfactions earch. In Proc. AAAI-94.
11. Gelle, E. (1998). On the generation of locally consistent solution spaces in mixed dynamic constraint problems. Ph.D. thesis, Ingenieure informaticienne EPFL de nationalite Suisse, Lausanne, Switzerland.
12. Gerevini, A. (1999). Fast planning through greedy planning graphs. In Proc. AAAI-99.
13. Gomes, C., Selman, B., & Kautz, H. (1998). Boosting combinatorial search through randomization. In Proc. AAAI-98, pp. 431-437.
14. Kambhampati, S. (1997). Challenges in bridging plan synthesis paradigms. In Proc. IJCAI-97.
15. Kambhampati, S. (1998). On the relations between intelligent backtracking and explanation-based learning in planning in constraint satisfaction. Artifical Intelligence, 105(1-2).
16. Kambhampati, S. (1999). Improving graphplan's search with ebl & ddb techniques. In Proc. IJCAI-99.
17. Kambhampati, S., Katukam, S., & Qu, Y. (1997). Failure driven dynamic search control for partial order planners: An explanation-based approach. Artificial Intelligence, 88(1-2), 253-215.
18. Kambhampati, S., & Nigenda, R. (2000). Distance-based goal ordering heuristics for graphplan. In Proc. 5th International Conference on AI Planning and Scheduling.
19. Kambhampati, S., Parker, E., & Lambrecht, E. (1997). Understanding and extending graphplan. In Proceedings of 4th European Conference on Planning. URL: rakaposhi.eas.asu.edu/ewsp-graphplan.ps.
20. Kautz, H., & Selman, B. (1996). Pushing the envelope: Plannng, propositional logic and stochastic search. In Proc. AAAI-96.
21. Kautz, H., & Selman, B. (1999). Blackbox: Unifying sat-based and graph-based planning. In Proc. IJCAI-99.
22. Koehler, J., Nebel, B., Hoffman, J., & Dimopoulos, Y. (1997). Extending planning graphs to an adl subset. Tech. rep. 88, Albert Ludwigs University.
23. Li, C., & Anbulagan (1997). Heuristics based on unit propagation for satisfiability problems. In Proc. IJCAI-97.
24. McDermott, D. (1998). Aips-98 planning competition results. ftp.cs.yale.edu/pub/mcdermott/aipscomp-results.html.
25. McDermott, D. (1999). Using regression graphs to control search in planning. Artificial Intelligence, 109(1-2), 111-160.
26. Mittal, S., & Falkenhainer, B. (1990). Dynamic constraint satisfaction problems. In Proc. AAAI-90.
27. Nguyen, X., & Kambhampati, S. (2000). Extracting effective and admissible state-space heuristics from the planning graph. Tech. rep. ASU CSE TR 00-03, Arizona State University.
28. Prosser, P. (1993). Domain filtering can degrade intelligent backtracking search. In Proc. IJCAI-93.
29. Rymon, R. (1992). Set enumeration trees. In Proc. KRR-92.
30. Schiex, T., & Verfaillie, G. (1993). Nogood recording for static and dynamic constraint satisfaction problems. In Proc. 5th intl. conference on tools with artificial intelligence.
31. Selman, B., Levesque, H., & Mitchell, D. (1992). GSAT: a new method for solving hard satisfiability problems. In In Proc. AAAI-92.
32. Smith, D., & Weld, D. (1999). Temporal planning with mutual exclusion reasoning. In Proc. IJCAI-99.
33. Srivastava, B., & Kambhampati, S. (1999). Scaling up planning by teasing out resource scheduling. In Proc. European Conference on Planning.
34. Tsang, E. (1993). Foundations of Constraint Satisfaction. Academic Press, San Diego, California.
35. Weld, D., Anderson, C., & Smith, D. (1998). Extending graphplan to handle uncertainty & sensing actions. In Proc. AAAI-98.
36. Zimmerman, T., & Kambhampati, S. (1999). Exploiting symmetry in the plan-graph via explanation-guided search. In Proc. AAAI-99.