Concise finite-domain representations for PDDL planning tasks

Artificial Intelligence

Volumn 173, Issue 5-6, 2009, Pages 503-535

  Helmert, Malte ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Automated planning; PDDL; Problem reformulation; SAS+

Indexed keywords

LOGIC PROGRAMMING; SYNTHETIC APERTURE SONAR;

AUTOMATED PLANNING; COMMON FEATURES; DOMAIN REPRESENTATIONS; DOMAIN STATE; EFFICIENT METHODS; FINITE-DOMAIN VARIABLES; INTERNATIONAL PLANNING COMPETITIONS; NORMAL FORMS; PDDL; PLANNING SYSTEMS; PLANNING TASKS; PROBLEM REFORMULATION; PROGRAMMING TECHNIQUES; REACHABILITY ANALYSIS; SAS+;

PLANNING;

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

References (49)

1. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., and Protasi M. Complexity and Approximation (1999), Springer-Verlag
2. + planning. Computational Intelligence 11 4 (1995) 625-655
3. J. Benton, M. van den Briel, S. Kambhampati, A hybrid linear programming and relaxed plan heuristic for partial satisfaction planning problems, in: Boddy et al. [4], pp. 34-41
4. In: Boddy M., Fox M., and Thiébaux S. (Eds). Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007) (2007), AAAI Press
5. Bonet B., and Geffner H. Planning as heuristic search. Artificial Intelligence 129 1 (2001) 5-33
6. Bylander T. The computational complexity of propositional STRIPS planning. Artificial Intelligence 69 1-2 (1994) 165-204
7. Y. Chen, X. Zhao, W. Zhang, Long-distance mutual exclusion for propositional planning, in: M.M. Veloso (Ed.), Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), 2007
8. Creignou N., Khanna S., and Sudan M. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications vol. 7 (2001), SIAM
9. S. Cresswell, M. Fox, D. Long, Extending TIM domain analysis to handle ADL constructs, in: AIPS '02 Workshop on Knowledge Engineering Tools and Techniques for A.I. Planning, 2002
10. Dechter R. Constraint Processing (2003), Morgan Kaufmann
11. Do M.B., and Kambhampati S. Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP. Artificial Intelligence 132 2 (2001) 151-182
12. Dowling W.F., and Gallier J.H. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming 1 3 (1984) 367-383
13. Ebbinghaus H.-D., Flum J., and Thomas W. Mathematical Logic. 2nd ed. (1994), Springer-Verlag
14. S. Edelkamp, Planning with pattern databases, in: A. Cesta, D. Borrajo (Eds.), Pre-proceedings of the Sixth European Conference on Planning (ECP'01), Toledo, Spain, 2001
15. Edelkamp S., and Helmert M. Exhibiting knowledge in planning problems to minimize state encoding length. In: Biundo S., and Fox M. (Eds). Recent Advances in AI Planning. 5th European Conference on Planning (ECP'99). Lecture Notes in Artificial Intelligence vol. 1809 (1999), Springer-Verlag, Heidelberg
16. S. Edelkamp, M. Helmert, On the implementation of MIPS, in: P. Traverso, M. Veloso, F. Giunchiglia (Eds.), Proceedings of the AIPS-2000 Workshop on Model-Theoretic Approaches to Planning, 2000
17. Edelkamp S., and Helmert M. The model checking integrated planning system (MIPS). AI Magazine 22 3 (2001) 67-71
18. S. Edelkamp, J. Hoffmann, PDDL2.2: The language for the classical part of the 4th International Planning Competition, Tech. Rep. 195, Albert-Ludwigs-Universität Freiburg, Institut für Informatik, 2004
19. Erol K., Nau D.S., and Subrahmanian V.S. Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence 76 1-2 (1995) 65-88
20. Fox M., and Long D. The automatic inference of state invariants in TIM. Journal of Artificial Intelligence Research 9 (1998) 367-421
21. 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
22. Garey M.R., and Johnson D.S. Computers and Intractability - A Guide to the Theory of NP-Completeness (1979), Freeman
23. Gazen B.C., and Knoblock C.A. Combining the expressivity of UCPOP with the efficiency of Graphplan. In: Steel S., and Alami R. (Eds). Recent Advances in AI Planning. 4th European Conference on Planning (ECP'97). Lecture Notes in Artificial Intelligence vol. 1348 (1997), Springer-Verlag
24. A. Gerevini, D. Long, Plan constraints and preferences in PDDL3, Tech. Rep. R. T. 2005-08-47, Dipartimento di Elettronica per l'Automazione, Università degli Studi di Brescia, 2005
25. Gerevini A., and Schubert L. Inferring state constraints for domain-independent planning. In: Rich C., and Mostow J. (Eds). Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98) (1998), AAAI Press
26. A. Gerevini, L. Schubert, Discovering state constraints for planning: DISCOPLAN, Tech. Rep. 2005-09-48, Department of Electronics for Automation, University of Brescia, 2005
27. Haslum P., Botea A., Helmert M., Bonet B., and Koenig S. Domain-independent construction of pattern database heuristics for cost-optimal planning. Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence (AAAI-2007) (2007), AAAI Press
28. Helmert M. A planning heuristic based on causal graph analysis. In: Zilberstein S., Koehler J., and Koenig S. (Eds). Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004) (2004), AAAI Press
29. Helmert M. The Fast Downward planning system. Journal of Artificial Intelligence Research 26 (2006) 191-246
30. M. Helmert, H. Geffner, Unifying the causal graph and additive heuristics, in: Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS 2008), 2008
31. M. Helmert, P. Haslum, J. Hoffmann, Flexible abstraction heuristics for optimal sequential planning, in: Boddy et al. [4], pp. 176-183
32. Hoffmann J. Where 'ignoring delete lists' works: Local search topology in planning benchmarks. Journal of Artificial Intelligence Research 24 (2005) 685-758
33. Hoffmann J., and Nebel B. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14 (2001) 253-302
34. Jonsson P., and Bäckström C. State-variable planning under structural restrictions: Algorithms and complexity. Artificial Intelligence 100 1-2 (1998) 125-176
35. Kautz H., and Selman B. Planning as satisfiability. In: Neumann B. (Ed). Proceedings of the 10th European Conference on Artificial Intelligence (ECAI 92) (1992), John Wiley and Sons
36. Kautz H., and Selman B. Pushing the envelope: Planning, propositional logic, and stochastic search. Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96) (1996), AAAI Press
37. J. Koehler, J. Hoffmann, Handling of inertia in a planning system, Tech. Rep. 122, Albert-Ludwigs-Universität Freiburg, Institut für Informatik, 1999
38. McDermott D. The 1998 AI Planning Systems competition. AI Magazine 21 2 (2000) 35-55
39. Pednault E.P.D. ADL: Exploring the middle ground between STRIPS and the situation calculus. In: Brachman R.J., Levesque H.J., and Reiter R. (Eds). Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning (KR'89) (1989), Morgan Kaufmann
40. Richter S., Helmert M., and Westphal M. Landmarks revisited. Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI-2008) (2008), AAAI Press
41. Rintanen J. A planning algorithm not based on directional search. In: Cohn A.G., Schubert L., and Shapiro S.C. (Eds). Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98) (1998), Morgan Kaufmann
42. Rintanen J. An iterative algorithm for synthesizing invariants. In: Kautz H., and Porter B. (Eds). Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000) (2000), AAAI Press
43. J. Rintanen, Compact representation of sets of binary constraints, in: Proceedings of the 17th European Conference on Artificial Intelligence (ECAI 2006), 2006
44. U. Scholz, Extracting state constraints from PDDL-like planning domains, in: AIPS-2000 Workshop on Analyzing and Exploiting Domain Knowledge for Efficient Planning, 2000
45. Ullman J.D. Principles of Database and Knowledge-Base Systems, vol. I: Classical Database Systems (1988), Computer Science Press
46. Ullman J.D. Principles of Database and Knowledge-Base Systems, vol. II: The New Technologies (1989), Computer Science Press
47. van Beek P., and Chen X. CPlan: A constraint programming approach to planning. Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99) (1999), AAAI Press
48. van den Briel M., Benton J., Kambhampati S., and Vossen T. An LP-based heuristic for optimal planning. In: Bessiere C. (Ed). Proceedings of the Thirteenth International Conference on Principles and Practice of Constraint Programming (CP 2007). Lecture Notes in Computer Science vol. 4741 (2007), Springer-Verlag
49. van den Briel M., Vossen T., and Kambhampati S. Reviving integer programming approaches for AI planning: A branch-and-cut framework. In: Biundo S., Myers K., and Rajan K. (Eds). Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005) (2005), AAAI Press