Chapter 22 Automated Planning

Foundations of Artificial Intelligence

Volumn 3, Issue , 2008, Pages 841-867

  Cimatti, Alessandro ^a   Pistore, Marco ^a   Traverso, Paolo ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 40849137936     PISSN: 15746526     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1574-6526(07)03022-2     Document Type: Review

References (55)

1. Bacchus F., and Kabanza F. Using temporal logic to express search control knowledge for planning. Artificial Intelligence 116 1-2 (2000) 123-191
2. Baral C., and Zhao J. Goal specification in presence of non-deterministic actions. In: Mántaras R.L.d., and Saitta L. (Eds). Proceedings of the 16th European Conference on Artificial Intelligence (ECAI-04) (2004), IOS Press 273-277
3. P. Bertoli, A. Cimatti, and M. Pistore. Strong cyclic planning under partial observability. In Proceedings of the 17th European Conference on Artificial Intelligence (ECAI-06), pages 580-584, Riva del Garda, Italy, August 2006. IOS Press
4. P. Bertoli, A. Cimatti, M. Pistore, and P. Traverso. A framework for planning with extended goals and partial observability. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS-03), June 2003
5. Bertoli P., Cimatti A., Roveri M., and Traverso P. Strong planning under partial observability. Artificial Intelligence 170 4-5 (2006) 337-384
6. P. Bertoli and M. Pistore. Planning with extended goals and partial observability. In Proceedings the International Conference on Automated Planning and Scheduling (ICAPS-04), June 2004
7. Blum A.L., and Furst M.L. Fast planning through planning graph analysis. Artificial Intelligence 90 1-2 (1997) 279-298
8. Boutilier C., Dean T., and Hanks S. Decision-theoretic planning: structural assumptions and computational leverage. Journal of Artificial Intelligence Research (JAIR) 11 (1999) 1-94
9. R. Brafman and J. Hoffmann. Conformant planning via heuristic forward search: a new approach. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS-04), June 2004
10. Bryant R.E. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35 8 (August 1986) 677-691
11. Castellini C., Giunchiglia E., and Tacchella A. SAT-based planning in complex domains: Concurrency, constraints and nondeterminism. Artificial Intelligence 147 (2003) 85-118
12. A. Cimatti, E. Giunchiglia, F. Giunchiglia, and P. Traverso. Planning via model checking: a decision procedure for AR. In Proceeding of the Fourth European Conference on Planning (ECP-97), September 1997. Springer-Verlag
13. Cimatti A., Pistore M., Roveri M., and Traverso P. Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence 147 1-2 (July 2003) 35-84
14. Cimatti A., Roveri M., and Bertoli P. Conformant planning via symbolic model checking and heuristic search. Artificial Intelligence 159 1-2 (November 2004) 127-206
15. A. Cimatti, M. Roveri, and P. Traverso. Automatic OBDD-based generation of universal plans in non-deterministic domains. In Proceeding of the Fifteenth National Conference on Artificial Intelligence (AAAI-98), Madison, WI, 1998. AAAI-Press
16. Clarke E.M., Emerson E.A., and Sistla A.P. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8 2 (1986) 244-263
17. U. Dal Lago, M. Pistore, and P. Traverso. Planning with a language for extended goals. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02), pages 447-454, Edmonton, Alberta, Canada, July 2002. AAAI-Press/The MIT Press
18. G. De Giacomo and M.Y. Vardi. Automata-theoretic approach to planning for temporally extended goals. In Proceeding of the Fifth European Conference on Planning (ECP-99), September 1999. Springer-Verlag
19. S. Edelkamp and M. Helmert. On the implementation of MIPS. In AIPS-Workshop on Model-Theoretic Approaches to Planning, pages 18-25, 2000
20. Eiter T., Faber W., Leone N., Pfeifer G., and Polleres A. A logic programming approach to knowledge-state planning, II: The DLVK system. Artificial Intelligence 144 1-2 (2003) 157-211
21. Emerson E.A. Temporal and modal logic. In: van Leeuwen J. (Ed). Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics (1990), Elsevier 995-1072 (Chapter 16)
22. Fikes R.E., and Nilsson N.J. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2 3-4 (1971) 189-208
23. Gelfond M., and Lifschitz V. Representing actions and change by logic programs. Journal of Logic Programming 17 2-4 (1993) 301-321
24. Ghallab M., Nau D., and Traverso P. Automated Planning: Theory and Practice (2004), Morgan Kaufmann Publishers, Inc.
25. E. Giunchiglia. Planning as satisfiability with expressive action languages: Concurrency, constraints and nondeterminism. In Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR-00), 2000
26. Giunchiglia E., Kartha G.N., and Lifschitz V. Representing action: Indeterminacy and ramifications. Artificial Intelligence 95 2 (1997) 409-438
27. E. Giunchiglia and V. Lifschitz. An action language based on causal explanation: Preliminary report. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98), Menlo Park, July 26-30 1998. AAAI Press
28. Goldman R.P., Musliner D.J., Krebsbach K.D., and Boddy M.S. Dynamic abstraction planning. Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI-97) and Ninth Innovative Applications of Artificial Intelligence Conference (IAAI-97) (1997), AAAI Press 680-686
29. R.P. Goldman, D.J. Musliner, and M.J. Pelican. Using model checking to plan hard real-time controllers. In Proceeding of the AIPS2k Workshop on Model-Theoretic Approaches to Planning, Breckeridge, CO, April 2000
30. R.P. Goldman, M. Pelican, and D.J. Musliner. Hard real-time mode logic synthesis for hybrid control: A CIRCA-based approach, March 1999. Working notes of the 1999 AAAI Spring Symposium on Hybrid Control
31. Hoffmann J. FF: The fast-forward planning system. AI Magazine 22 3 (2001) 57-62
32. J. Hoffmann and R. Brafman. Contingent planning via heuristic forward search with implicit belief states. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS-05), 2005
33. Jensen R.M., and Veloso M.M. OBDD-based universal planning for synchronized agents in non-deterministic domains. Journal of Artificial Intelligence Research (JAIR) 13 (2000) 189-226
34. R.M. Jensen, M.M. Veloso, and M.H. Bowling. OBDD-based optimistic and strong cyclic adversarial planning. In Proceedings of the Sixth European Conference on Planning (ECP-01), 2001
35. Kabanza F., Barbeau M., and St-Denis R. Planning control rules for reactive agents. Artificial Intelligence 95 1 (1997) 67-113
36. H.A. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96) and Eighth Innovative Applications of Artificial Intelligence Conference (IAAI-96), 1996
37. Levesque H.J., Reiter R., Lesperance Y., Lin F., and Scherl R. Golog: a logic programming language for dynamic domains. Journal of Logic Programming 31 (1997) 59-83
38. McDermott D. PDDL-the planning domain definition language. Web page: (1998). http://www.cs.yale.edu/homes/dvm
39. E. Pednault. ADL: Exploring the middle ground between STRIPS and the situation calculus. In Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR-89), 1989
40. J.S. Penberthy and D.S. Weld. UCPOP: A sound, complete, partial order planner for ADL. In B. Nebel, C. Rich, and W. Swartout, editors, Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), pages 103-114, Cambridge, MA, October 1992. Morgan Kaufmann
41. M. Peot and D. Smith. Conditional nonlinear planning. In J. Hendler, editor, Proceedings of the First International Conference on AI Planning Systems (ICAPS-92), pages 189-197, College Park, MD, June 15-17 1992. Morgan Kaufmann
42. R. Petrick and F. Bacchus. A knowledge-based approach to planning with incomplete information and sensing. In Proceedings of the Sixth International Conference on Artificial Intelligence Planning and Scheduling (AIPS-02), 2002
43. R. Petrick and F. Bacchus. Extending the knowledge-based approach to planning with incomplete information and sensing. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS-04), pages 2-11, 2004
44. Pistore M., and Traverso P. Planning as model checking for extended goals in non-deterministic domains. Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01) (2001), AAAI Press
45. Pryor L., and Collins G. Planning for contingency: A decision based approach. J. of Artificial Intelligence Research 4 (1996) 81-120
46. Reiter R. The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression. In: Lifschitz V. (Ed). Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy (1991), Academic Press 359-380
47. Rintanen J. Constructing conditional plans by a theorem-prover. Journal of Artificial Intelligence Research 10 (1999) 323-352
48. J. Rintanen. Improvements to the evaluation of quantified Boolean formulae. In T. Dean, editor, Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pages 1192-1197. Morgan Kaufmann Publishers, August 1999
49. J. Rintanen. Backward plan construction for planning as search in belief space. In Proceedings of the International Conference on AI Planning and Scheduling (AIPS-02), 2002
50. Rintanen J. Research on conditional planning with partial observability: The Jussi-POP/BBSP planning system. Web page: (2004). http://www.informatik.uni-freiburg.de/rintanen/planning.html
51. Scherl R.B., and Levesque H.J. Knowledge, action, and the frame problem. Artificial Intelligence 144 1-2 (2003) 1-39
52. D.E. Smith and D.S. Weld. Conformant Graphplan. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and of the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pages 889-896, Menlo Park, July 26-30, 1998. AAAI Press
53. Son T.C., and Baral C. Formalizing sensing actions-a transition function based approach. Artificial Intelligence 125 1-2 (2001) 19-91
54. D. Warren. Generating conditional plans and programs. In Proceedings of the Summer Conference on Artificial Intelligence and Simulation of Behaviour (AISB-76), 1976
55. D.S. Weld, C.R. Anderson, and D.E. Smith. Extending Graphplan to handle uncertainty and sensing actions. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and of the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pages 897-904, Menlo Park, July 26-30, 1998. AAAI Press