An efficient hybrid strategy for temporal planning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3990 LNCS, Issue , 2006, Pages 273-287

  Xing, Zhao ^a   Chen, Yixin ^a   Zhang, Weixiong ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; OPERATIONS RESEARCH; PARALLEL PROCESSING SYSTEMS; PERT;

CONSTRAINT PROGRAMMING; MAX-SAT; STRIPS; TEMPORAL PLANNING (TP);

PROBLEM SOLVING;

EID: 33746104804     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11757375_22     Document Type: Conference Paper

References (30)

1. http://planning.cis.strath.ac.uk/competition.
2. http://ls5-www.cs.uni-dortmund.de/edelkamp/ipc-4.
3. M. Benedetti and S. Bernardini. Incremental compilation-to-SAT procedures. In Proceedings of The Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT04), 2004.
4. A. Blum and M.L. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90:281-300, 1997.
5. B. Bonet and H. Geffher. Planning as heuristic search. Artificial Intelligence, Special issue on Heuristic Search, 129(1), 2001.
6. http://www.cril.univ-artois.fr/vidal/cpt.fr.html.
7. http://www.cs.washington.edu/homes/kautz/satplan/blackbox/ blackbox-download.html.
8. S. Edelkamp. Mixed prepositional and numerical planning in the model checking integrated planning system. In Proceedings of AIPS 2002, Workshop on Planning for Temporal Domains, pages 47-55, 2002.
9. R.E. Fikes and N.J. Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2:189-208, 1971.
10. M. Awedh H. Jin and F. Somenzi. CirCus: a satisfiability solver geared towards bounded model checking. In CAV 2004, pages 519-522, 2004.
11. P. Haslum. TP4'04 and HSP. In Proceedings of IPC4, ICAPS, pages 38-40, 2004.
12. F. Hillier and G. Lieberman. Introduction to Operations Research. McGraw-Hill, Boston, 7th edition, 2001.
13. J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14:253-302, 2001.
14. J.N. Hooker and V. Vinay. Branching rules for satisfiability. Journal of Automated Reasoning, 15:359-383, 1995.
15. S. Katukam and S. Kambhampati. Learning explanation-based search control rules for partial order planning. In Proceedings of AAAI-94, pages 582-587, 1994.
16. H. Kautz. SATPLAN04: Planning as satisfiability. In Proceedings of IPC4, ICAPS, 2004.
17. H. Kautz and B. Selman. Unifying SAT-based and graph-based planning. In Proceedings of IJCAI-99, pages 318-325, 1999.
18. J. Koehler and J. Hoffmann. On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. Journal of Artificial Intelligence Research, 12:338-386, 2000.
19. D. McDermott. Estimated-regression planning for interactions with web services. In Proceedings of AIPS 2002, pages 204-211, 2002.
20. M.W. Moskewicz, C.F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference (DAC'01), 2001.
21. R. S. Nigenda, X. Nguyen, and S. Kambhampati. AltAlt: Combining the advantages of Graphplan and heuristic state search. Technical report, Arizona State University, 2000.
22. J. L. Pollock. The logical foundations of goal-regression planning in autonomous agents. Artificial Intelligence, 106(2):267-334, 1998.
23. I. Refanidis and I. Vlahavas. The GRT planner. AI Magazine, pages 63-66, 2001.
24. L. Ryan. Efficient algorithms for clause-learning SAT solvers. Master's thesis, Simon Fraser University, 2003.
25. B. Selman and H. Kautz. Planning as satisfiability. In Proceedings ECAI-92, pages 359-363, 1992.
26. O. Shtrichman. Tuning SAT checkers for bounded model checking. In Computer Aided Verification, pages 480-494, 2000.
27. V. Vidal and H. Geffner. CPT: An optimal temporal POCL planner based on constraint programming. In Proceedings of IPC4, ICAPS, pages 59-60, 2004.
28. S. Wolfman and D. Weld. Combining linear programming and satisfiability solving for resource planning. The Knowledge Engineering Review, 15(1), 2000.
29. C. Hsu Y. Chen and B. W. Wah. SGPlan: Subgoal partitioning and resolution in planning. In Proceedings of IPC4, ICAPS, pages 30-32, 2004.
30. L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik. Efficient conflict driven learning in boolean satisfiability solver. In ICCAD, pages 279-285, 2001.