Weak, strong, and strong cyclic planning via symbolic model checking

Artificial Intelligence

Volumn 147, Issue 1-2, 2003, Pages 35-84

  Cimatti, A ^a   Pistore, M ^a   Roveri, M ^a   Traverso, P ^a  

^a ITC IRST   (Italy)

Author keywords

Binary decision diagrams; Conditional planning; Planning in nondeterministic domains; Symbolic model checking

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DECISION THEORY; PROBLEM SOLVING; STATE SPACE METHODS; STRATEGIC PLANNING;

CONDITIONAL PLANNING;

ARTIFICIAL INTELLIGENCE;

EID: 0038517219     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(02)00374-0     Document Type: Article

References (68)

1. Abdulla P.A., Bjesse P., Eén N. Symbolic reachability analysis based on SAT-solvers. Graf S., Schwartzbach M. Proceedings of the Sixth Conference Tools and Algorithms for the Construction and Analysis of Systems, Berlin, Germany. Lecture Notes in Computer Science. 1785:2000;411-425 Springer, Berlin.
2. Asarin E., Maler O., Pnueli A. Symbolic controller synthesis for discrete and timed systems. Antsaklis P., Kohn W., Nerode A., Sastry S. Hybrid Systems II. Lecture Notes in Computer Science. 999:1995;1-20 Springer, Berlin.
3. Bacchus F., Kabanza F. Using temporal logic to express search control knowledge for planning. Artificial Intelligence. 16:(1-2):2000;123-191.
4. Barto A.G., Bradtke S.J., Singh S.P. Learning to act using real-time dynamic programming. Artificial Intelligence. 72:(1-2):1995;81-138.
5. Bertoli P., Cimatti A. Improving heuristics for planning as search in belief space. Proceedings of Sixth International Conference on AI Planning and Scheduling (AIPS'02), Toulouse, France. 2002;83-92.
6. Bertoli P., Cimatti A., Pistore M., Traverso P. Plan validation for extended goals under partial observability (preliminary report). Proceedings of the AIPS 2002 Workshop on Planning via Model Checking, Toulouse, France. 2002;14-22.
7. Bertoli P., Cimatti A., Roveri M. Conditional planning under partial observability as heuristic-symbolic search in belief space. Proceedings of the Sixth European Conference on Planning (ECP'01). 2001;379-384.
8. Bertoli P., Cimatti A., Roveri M. Heuristic search + symbolic model checking = efficient conformant planning. Nebel B. Proc. IJCAI-2001, Seattle, WA. 2001;467-472 Morgan Kaufmann, San Mateo, CA.
9. Bertoli P., Cimatti A., Roveri M., Traverso P. Planning in nondeterministic domains under partial observability via symbolic model checking. Nebel B. Proc. IJCAI-2001, Seattle, WA. 2001;473-478 Morgan Kaufmann, San Mateo, CA.
10. Biere A., Cimatti A., Clarke E.M., Zhu Y. Symbolic model checking without BDDs. Cleaveland R. Proceedings of the Fifth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '99). Lecture Notes in Computer Science. 1579:1999;193-207 Springer, Berlin.
11. Bonet B., Geffner H. Planning with incomplete information as heuristic search in belief space. Chien S., Kambhampati S., Knoblock C. Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling, Seattle, WA. 2000;52-61 AAAI Press.
12. Boutilier C., Dean T., Hanks S. Planning under uncertainty: Structural assumptions and computational leverage. Ghallab M., Milani A. New Directions in AI Planning. 1996;157-172 IOS Press, Amsterdam.
13. Boutilier C., Dean T., Hanks S. Decision-theoretic planning: Structural assumptions and computational leverage. J. Artificial Intelligence Res. 11:1999;1-94.
14. Brace K.S., Rudell R.L., Bryant R.E. Efficient implementation of a BDD package. Proceedings of the 27th ACM/IEEE Design Automation Conference, ACM/IEEE. 1990;40-45 IEEE Computer Society Press, Orlando, FL.
15. Bryant R.E. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C. 35:(8):1986;677-691.
16. 20 states and beyond. Inform. and Comput. 98:(2):1992;142-170.
17. Cimatti A., Clarke E.M., Giunchiglia F., Roveri M. NUSMV: A new symbolic model verifier. Halbwachs N., Peled D. Proceedings Eleventh Conference on Computer-Aided Verification (CAV'99), Trento, Italy. Lecture Notes in Computer Science. 1633:1999;495-499 Springer, Berlin.
18. Cimatti A., Clarke E.M., Giunchiglia F., Roveri M. NUSMV: A new symbolic model checker. Internat. J. Software Tools for Technology Transfer. 2:(4):2000.
19. Cimatti A., Giunchiglia E., Giunchiglia F., Traverso P. Planning via model checking: A decision procedure for AR. Steel S., Alami R. Proceeding of the Fourth European Conference on Planning, Toulouse, France. Lecture Notes in Artificial Intelligence. 1348:1997;130-142 Springer, Berlin.
20. Cimatti A., Giunchiglia E., Pistore M., Roveri M., Sebastiani R., Tacchella A. Integrating BDD-based and SAT-based symbolic model checking. Armando A. Proceedings of the Fourth International Workshop on Frontiers of Combining Systems. Lecture Notes in Artificial Intelligence. 2309:2002;49-56 Springer, Berlin.
21. Cimatti A., Roveri M. Conformant planning via model checking. Biundo S. Proceeding of the Fifth European Conference on Planning, Durham, UK. Lecture Notes in Artificial Intelligence. 1809:1999;21-34 Springer, Berlin.
22. Cimatti A., Roveri M. Conformant planning via symbolic model checking. J. Artificial Intelligence Res. 13:2000;305-338.
23. Cimatti A., Roveri M., Traverso P. Automatic OBDD-based generation of universal plans in non-deterministic domains. Proc. AAAI-98, Madison, WI. 1998;875-881 AAAI Press.
24. Cimatti A., Roveri M., Traverso P. Strong planning in non-deterministic domains via model checking. Proceeding of the Fourth International Conference on Artificial Intelligence Planning Systems (AIPS-98), Carnegie Mellon University, Pittsburgh. 1998;36-43 AAAI Press.
25. Clarke E.M., Emerson E.A. Synthesis of synchronization skeletons for branching time temporal logic. Logic of Programs: Workshop. Lecture Notes in Computer Science. 131:1981;52-71 Springer, Berlin.
26. Clarke E.M., Grumberg O., Peled D.A. Model Checking. 1999;MIT Press, Cambridge, MA.
27. Clarke E.M., Wing J.M. Formal methods: State of the art and future directions. ACM Comput. Surveys. 28:(4):1996;626-643.
28. Dal Lago U., Pistore M., Traverso P. Planning with a language for extended goals. Proc. AAAI-02, Edmonton, AB. 2002;447-454 AAAI Press/MIT Press.
29. Daniele M., Traverso P., Vardi M.Y. Strong cyclic planning revisited. Biundo S. Proceeding of the Fifth European Conference on Planning, Durham, UK. Lecture Notes in Artificial Intelligence. 1809:1999;35-48 Springer, Berlin.
30. De Giacomo G., Vardi M.Y. Automata-theoretic approach to planning for temporally extended goals. Biundo S. Proceeding of the Fifth European Conference on Planning, Durham, UK. Lecture Notes in Artificial Intelligence. 1809:1999;226-238 Springer, Berlin.
31. Edelkamp S., Helmert M. Exhibiting knowledge in planning problems to minimize state encoding length. Biundo S., Fox M. Proceedings of the Fifth European Conference on Planning (ECP'99). Lecture Notes in Artificial Intelligence. 1809:1999;135-147 Springer, Berlin.
32. Edelkamp S., Helmert M. On the implementation of mips. AIPS-Workshop on Model-Theoretic Approaches to Planning. 2000;18-25.
33. Emerson E.A. Temporal and modal logic. van Leeuwen J. Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics. 1990;Elsevier, Amsterdam. Chapter 16, pp. 995-1072.
34. Giunchiglia E., Kartha G.N., Lifschitz V. Representing action: Indeterminacy and ramifications. Artificial Intelligence. 95:(2):1997;409-438.
35. Giunchiglia F., Traverso P. Planning as model checking. Biundo S. Proceeding of the Fifth European Conference on Planning, Durham, UK. Lecture Notes in Artificial Intelligence. 1809:1999;1-20 Springer, Berlin.
36. Goldman R., Pelican M., Musliner D. Hard Real-time Mode Logic Synthesis for Hybrid Control: A CIRCA-based approach. Working notes of the 1999 AAAI Spring Symposium on Hybrid Control. 1999.
37. Goldman R.P., Musliner D.J., Krebsbach K.D., Boddy M.S. Dynamic abstraction planning. Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference (AAAI-97), (IAAI-97). 1997;680-686 AAAI Press.
38. Goldman R.P., Musliner D.J., Pelican M.J. Using model checking to plan hard real-time controllers. Proceeding of the AIPS2k Workshop on Model-Theoretic Approaches to Planning, Breckeridge, CO. 2000;2-9.
39. Hoey J., St-Aubin R., Hu A., Boutilier C. SPUDD: Stochastic planning using decision diagrams. Laskey K.B., Prade H. Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence (UAI-99). 1999;279-288 Morgan Kaufmann, San Francisco, CA.
40. Jensen R., Veloso M. OBDD-based universal planning for synchronized agents in non-deterministic domains. J. Artificial Intelligence Res. 13:2000;189-226.
41. Jensen R.M., Veloso M.M., Bowling M.H. OBDD-based optimistic and strong cyclic adversarial planning. Proceedings of the Sixth European Conference on Planning (ECP'01). 2001;265-276.
42. Kabanza F., Barbeau M., St-Denis R. Planning control rules for reactive agents. Artificial Intelligence. 95:(1):1997;67-113.
43. Kautz H., McAllester D., Selman B. Encoding plans in propositional logic. Aiello L.C., Doyle J., Shapiro S. KR'96: Principles of Knowledge Representation and Reasoning. 1996;374-384 Morgan Kaufmann, San Francisco, CA.
44. Koenig S., Simmons R. Real-time search in non-deterministic domains. Proc. IJCAI-95, Montreal, Quebec. 1995;1660-1667 Morgan Kaufmann, San Mateo, CA.
45. Koenig S., Simmons R. Solving robot navigation problems with initial pose uncertainty using real-time heuristic search. Simmons R.G., Veloso M., Smith S. Proceedings of the Second International Conference on Artificial Intelligence Planning Systems (AIPS-98). 1998;145-153 AAAI Press.
46. Kupferman O., Vardi M.Y. Synthesis with incomplete information. Proc. of 2nd International Conference on Temporal Logic. 1997;91-106.
47. Levesque H.J. What is planning in the presence of sensing? Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference. 1996;1139-1146 AAAI Press/MIT Press, Menlo Park, CA.
48. Maler O., Pnueli A., Sifakis J. On the synthesis of discrete controllers. Mayr E.W., Puech C. Proceedings of the Twelfth Annual Symposium on Theoretical Aspects of Computer Science (STACS-95). Lecture Notes in Computer Science. 900:1995;229-242 Springer, Berlin.
49. McMillan K. Symbolic Model Checking. 1993;Kluwer Academic, Dordrecht.
50. Peot M., Smith D. Conditional nonlinear planning. Hendler J. Proceedings of the First International Conference on AI Planning Systems, College Park, MD. 1992;189-197 Morgan Kaufmann, San Mateo, CA.
51. Petrick R., Bacchus F. A knowledge-based approach to planning with incomplete information and sensing. Proceedings of the Sixth International Conference on Artificial Intelligence Planning and Scheduling (AIPS'02). 2002;37-46.
52. Pistore M., Bettin R., Traverso P. Symbolic techniques for planning with extended goals in non-deterministic domains. Proceedings of the Sixth European Conference on Planning (ECP'01). 2001;253-264.
53. Pistore M., Traverso P. Planning as model checking for extended goals in non-deterministic domains. Nebel B. Proc. IJCAI-01, Seattle, WA. 2001;479-486 Morgan Kaufmann, San Mateo, CA.
54. Pnueli A. The temporal logic of programs. Proceedings of the 18th IEEE Symposium on the Foundations of Computer Science (FOCS-77), Providence, RI. 1977;46-57 IEEE Computer Society Press.
55. Pnueli A., Rosner R. On the synthesis of an asynchronous reactive module. Proceedings of the Sixth International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science. 372:1989;652-671 Springer, Berlin.
56. Pryor L., Collins G. Planning for contingency: A decision based approach. J. Artificial Intelligence Res. 4:1996;81-120.
57. Rintanen J. Constructing conditional plans by a theorem-prover. J. Artificial Intelligence Res. 10:1999;323-352.
58. Rintanen J. Improvements to the evaluation of quantified Boolean formulae. Dean T. Proc. IJCAI-99, Stockholm, Sweden. 1999;1192-1197 Morgan Kaufmann, San Mateo, CA.
59. Rintanen J. Backward plan construction for planning as search in belief space. Proceedings of the Sixth International Conference on Artificial Intelligence Planning and Scheduling (AIPS'02). 2002;93-102.
60. Schoppers M.J. Universal plans for reactive robots in unpredictable environments. Proc. IJCAI-87, Milan, Italy. 1987;1039-1046.
61. Smith D.E., Weld D.S. Conformant graphplan. Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and of the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98). 1998;889-896 AAAI Press, Menlo Park, CA.
62. F. Somenzi, CUDD: CU Decision Diagram package - Release 2.1.2. Department of Electrical and Computer Engineering - University of Colorado at Boulder, 1997.
63. Tovey C., Koenig S. Gridworlds as testbeds for planning with incomplete information. Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence. 2000;819-824 AAAI Press.
64. Traverso P., Veloso M., Giunchiglia F. AIPS2000 Workshop on Model-Theoretic Approaches to Planning, Breckeridge, CO. 2000.
65. Vardi M.Y. An automata-theoretic approach to fair realizability and synthesis. Wolper P. Proceedings of the 7th International Conference On Computer Aided Verification, Liege, Belgium. Lecture Notes in Computer Science. 939:1995;267-278 Springer, Berlin.
66. Vardi M.Y. Branching vs. linear time: Final showdown. Margaria T., Yi W. Proceedings of the Seventh International Conference on Tools and Algorithms for the Construction of Systems (TACAS-2001). Lecture Notes in Computer Science. 2031:2001;1-22 Springer, Berlin.
67. Warren D.H.D. Generating conditional plans and programs. Proceedings of the Summer Conference on Artificial Intelligence and Simulation of Behaviour (AISB-76), Edinburgh, Scotland. 1976;344-354.
68. Weld D.S., Anderson C.R., Smith D.E. Extending graphplan to handle uncertainty and sensing actions. Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98) and of the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98). 1998;897-904 AAAI Press, Menlo Park, CA.