SAT-based parallel planning using a split representation of actions

ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2009, Pages 281-288

  Robinson, Nathan ^a   Gretton, Charles ^b   Pham, Duc Nghia ^a   Sattar, Abdul ^a  

^a GRIFFITH UNIVERSITY   (Australia)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONFLICTING ACTION; DECISION PROCEDURE; ENCODINGS; FUNDAMENTAL LIMITATIONS; OPTIMAL PLAN; OPTIMAL PROBLEMS; PARALLEL EXECUTIONS; PLANNING PROCEDURE;

OPTIMIZATION; SCHEDULING; SEMANTICS;

ENCODING (SYMBOLS);

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

References (18)

1. Blum, A., and Furst, M. 1997. Fast planning through planning graph analysis. Artificial Intelligence (90):281-300. (Pubitemid 127398372)
2. Chen, Y.; Xing, Z.; and Zhang, W. 2007. Long-distance mutual exclusion for propositional planning. In Proc. IJCAI.
3. Dimopoulos, Y.; Nebel, B.; and Koehler, J. 1997. Encoding planning problems in nonmonotonic logic programs. In Proc. ECP.
4. Ernst, M.; Millstein, T.; and Weld, D. S. 1997. Automatic SAT-compilation of planning problems. In Proc. IJCAI.
5. Giunchiglia, E.; Massarotto, A.; and Sebastiani, R. 1998. Act, and the rest will follow: Exploiting determinism in planning as satisfiability. In Proc. AAAI.
6. Kautz, H., and Selman, B. 1992. Planning as satisfiability. In Proc. ECAI.
7. Kautz, H., and Selman, B. 1999. Unifying SAT-based and graph-based planning. In Proc. IJCAI.
8. Kautz, H. A.; Selman, B.; and Hoffmann, J. 2006. SatPlan: Planning as satisfiability. In Abstracts IPC-05.
9. Kautz, H. A. 2006. Deconstructing planning as satisfiability. In Proc. AAAI.
10. Nabeshima, H.; Soh, T.; Inoue, K.; and Iwanuma, K. 2006. Lemma reusing for SAT based planning and scheduling. In Proc. ICAPS. (Pubitemid 44074202)
11. Pipatsrisawat, K., and Darwiche, A. 2007. Rsat 2.0: SAT solver description. Technical Report D-153, Automated Reasoning Group, Computer Science Department, UCLA.
12. Ray, K., and Ginsberg, M. L. 2008. The complexity of optimal planning and a more efficient method for finding solutions. In Proc. ICAPS.
13. Rintanen, J.; Heljanko, K.; and Niemelä, I. 2006. Planning as satisfiability: parallel plans and algorithms for plan search. Artificial Intelligence 170(12-13):1031-1080. (Pubitemid 44537214)
14. Rintanen, J. 2004. Evaluation strategies for planning as satisfiability. In Proc. ECAI.
15. Rintanen, J. 2008. Planning graphs and propositional clause learning. In Proc. KR.
16. Robinson, N.; Gretton, C.; Pham, D.-N.; and Sattar, A. 2008. A compact and efficient SAT encoding for planning. In Proc. ICAPS.
17. Streeter, M., and Smith, S. 2007. Using decision procedures efficiently for optimization. In Proc. ICAPS.
18. Wehrle, M., and Rintanen, J. 2007. Planning as satisfiability with relaxed e-step plans. In Proc. Australia AI.