Long-distance mutual exclusion for planning

Artificial Intelligence

Volumn 173, Issue 2, 2009, Pages 365-391

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

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

Constraint propagation; Mutual exclusion; Planning; Satisfiability

Indexed keywords

EXPERIMENTS; PLANNING;

CONSTRAINT PROPAGATION; DIFFERENT TIME STEPS; DO-MAINS; EFFECTIVE TOOLS; MEMORY PROBLEMS; MUTUAL EXCLUSION; NEW CLASSES; PLANNING DOMAINS; PLANNING TIMES; SAME TIME STEPS; SATISFIABILITY; SEARCH SPACE PRUNING; SECOND LEVELS; TRANSITION GRAPHS; VIRTUAL REALIZATIONS;

SOFTWARE TESTING;

EID: 57749092639     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2008.11.004     Document Type: Article

References (35)

1. Bäckström C., and Nebel B. Complexity results for SAS+ planning. Computational Intelligence 11 (1995) 17-29
2. Blum A., and Furst M.L. Fast planning through planning graph analysis. Artificial Intelligence 90 (1997) 281-300
3. Bonet B., and Geffner H. Planning as heuristic search. Artificial Intelligence 129 1 (2001) 5-33
4. M. Büttner, J. Rintanen, Satisfiability planning with constraints on the number of actions, in: Proc. ICAPS, 2005, pp. 292-299
5. Y. Chen, X. Zhao, W. Zhang, Long distance mutual exclusion for propositional planning, in: Proc. IJCAI, 2007, pp. 1840-1845
6. N. Een, N. Sörensson, An extensible SAT-solver, in: Proc. SAT, 2003
7. Fox M., and Long D. The automatic inference of state invariants in TIM. Journal of Artificial Intelligence Research 9 (1998) 367-421
8. M. Fox, D. Long, Utilizing automatically inferred invariants in graph construction and search, in: Proc. ICAPS, 2000, pp. 102-111
9. Fox M., and Long D. PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research 20 (2003) 61-124
10. Gerevini A., Saetti A., and Serina I. Planning through stochastic local search and temporal action graphs in LPG. Journal of Artificial Intelligence Research 20 (2003) 239-290
11. A. Gerevini, L.K. Schubert, Inferring state constraints for domain independent planning, in: Proc. AAAI, 1998, pp. 905-912
12. T.J. Grant, Inductive learning of knowledge-based planning operators, PhD thesis, Rijksuniversiteit Limburg de Maastricht, 1996
13. P. Haslum, H. Geffner, Admissible heuristics for optimal planning, in: Proc. ICAPS, 2000, pp. 140-149
14. Helmert M. The Fast Downward planning system. Journal of Artificial Intelligence Research 26 (2006) 191-246
15. Jonsson P., and Bäckström C. State-variable planning under structural restrictions: Algorithms and complexity. Artificial Intelligence 100 1-2 (1998) 125-176
16. H. Kautz, SATPLAN04: Planning as satisfiability, in: Proc. IPC4, ICAPS, 2004
17. H. Kautz, SatPlan: Planning as satisfiability, in: Proc. IPC5, ICAPS, 2006
18. H. Kautz, D. McAllester, B. Selman, Encoding plans in propositional logic, in: Proc. KR, 1996, pp. 374-384
19. Kautz H., and Selman B. Pushing the envelope: Planning, propositional logic, and stochastic search. Proc. AAAI (1996), AAAI Press 1194-1201
20. H. Kautz B. Selman, The role of domain-specific knowledge in the planning as satisfiability framework, in: Proc. AIPS, 1998, pp. 181-189
21. H. Kautz, B. Selman, Unifying SAT-based and graph-based planning, in: Proc. IJCAI, 1999, pp. 318-325
22. G. Kelleher, A.G. Cohn, Automatically synthesising domain constraints from operator descriptions, in: Proc. ECAI, 1992
23. McCluskey T.L., and Porteous J.M. Engineering and compiling planning domain models to promote validity and efficiency. Artificial Intelligence 95 (1997) 1-65
24. D. McDermott, M. Ghallab, A. Howe, C. Knoblock, A. Ram, M. Veloso, D. Weld, D. Wilkins, PDDL: the planning domain definition language, Technical Report TR-98-003, Yale University, 1998
25. P. Morris, R. Feldman, Automatically derived heuristics for planning search, in: Proc. Irish Conference on Artificial Intelligence and Cognitive Science, 1989
26. J. Penberthy, D. Weld, Temporal planning with continuous change, in: Proc. AAAI, 1994, pp. 1010-1015
27. J. Rintanen, Planning: algorithms and complexity, Habilitation thesis, Albert-Ludwigs-Universitat Freiburg, 2005
28. Rintanen J., Heljanko K., and Niemelä I. Planning as satisfiability: Parallel plans and algorithms for plan search. Artificial Intelligence 12-13 (2006) 1031-1080
29. B. Selman, H. Kautz, Planning as satisfiability, in: Proc. ECAI, 1992, pp. 359-363
30. The Fifth International Planning Competition, http://zeus.ing.unibs.it/ipc-5/, 2006
31. The Third International Planning Competition, http://planning.cis.strath.ac.uk/competition/, 2002
32. van Beek P., and Chen X. CPlan: A constraint programming approach to planning. Proc. AAAI (1999), AAAI Press 585-590
33. M. van den Briel, S. Kambhampati, T. Vossen, IPPlan: Planning as integer programming, in: Proc. IPC5, ICAPS, 2006
34. V. Vidal, H. Geffner, CPT: An optimal temporal POCL planner based on constraint programming, in: Proc. IPC4, ICAPS, 2004
35. Vidal V., and Geffner H. Branching and pruning: An optimal temporal POCL planner based on constraint programming. Artificial Intelligence 170 3 (2006) 298-335