Contingent planning under uncertainty via stochastic satisfiability

Artificial Intelligence

Volumn 147, Issue 1-2, 2003, Pages 119-162

  Majercik, Stephen M ^a   Littman, Michael L ^b  

^a BOWDOIN COLLEGE   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Contingent planning; Decision theoretic planning; Incomplete knowledge; Partially observable Markov decision processes; Planning as satisfiability; Probabilistic planning; Probability of success; Stochastic satisfiability; Uncertainty

Indexed keywords

DECISION THEORY; MARKOV PROCESSES; PLANNING; PROBABILISTIC LOGICS; PROBLEM SOLVING;

CONTINGENT PLANNING;

ARTIFICIAL INTELLIGENCE;

EID: 0038178319     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(02)00379-X     Document Type: Article

References (75)

1. Ballard B.W. The *-minimax search procedure for trees containing chance nodes. Artificial Intelligence. 21:(3):1983;327-350.
2. Barto A.G., Bradtke S.J., Singh S.P. Learning to act using real-time dynamic programming. Artificial Intelligence. 72:(1):1995;81-138.
3. Bayardo R.J. Jr, Schrag R.C. Using CSP look-back techniques to solve real-world SAT instances. Proceedings of the Fourteenth National Conference on Artificial Intelligence. 1997;203-208 AAAI Press/MIT Press.
4. Bellman R. Dynamic Programming. 1957;Princeton University Press, Princeton, NJ.
5. Blum A.L., Furst M.L. Fast planning through planning graph analysis. Artificial Intelligence. 90:(1-2):1997;279-298.
6. Blum A.L., Langford J.C. Probabilistic planning in the Graphplan framework. Working Notes of the Workshop on Planning as Combinatorial Search, held in conjunction with the Fourth International Conference on Artificial Intelligence Planning. 1998.
7. Blum A.L., Langford J.C. Probabilistic planning in the Graphplan framework. Proceedings of the Fifth European Conference on Planning. 1999;320-332.
8. Bonet B., Geffner H. GPT: A tool for planning with uncertainty and partial information. Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence Workshop on Planning under Uncertainty and Incomplete Information. 2001; http://citeseer.nj.nec.com/449314.html.
9. Boutilier C., Dean T., Hanks A. Decision-theoretic planning: Structural assumptions and computational leverage. J. Artificial Intelligence Res. 11:1999;1-94.
10. Boutilier C., Dearden R. Approximating value trees in structured dynamic programming. Saitta L. Proceedings of the Thirteenth International Conference on Machine Learning. 1996;54-62.
11. Boutilier C., Dearden R., Goldszmidt M. Exploiting structure in policy construction. Proc. IJCAI-95, Montreal, Quebec. 1995;1104-1113.
12. Boutilier C., Poole D. Computing optimal policies for partially observable decision processes using compact representations. Proceedings of The Thirteenth National Conference on Artificial Intelligence. 1996;1168-1175 AAAI Press/MIT Press.
13. Bylander T. The computational complexity of propositional STRIPS planning. Artificial Intelligence. 69:1994;161-204.
14. Cassandra A., Littman M.L., Zhang N.L. Incremental pruning: A simple, fast, exact method for partially observable Markov decision processes. Proceedings of the Thirteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-97). 1997;54-61 Morgan Kaufmann, San Francisco, CA, http://www.cs.duke.edu/mlittman/docs/uai97-pomdp.ps.
15. Condon A. The complexity of stochastic games. Inform. and Comput. 96:(2):1992;203-224.
16. Davis M., Logemann G., Loveland D. A machine program for theorem proving. Comm. ACM. 5:1962;394-397.
17. Davis M., Putnam H. A computing procedure for quantification theory. J. ACM. 7:1960;201-215.
18. Denardo E.V. Dynamic Programming: Models and Applications. 1982;Prentice-Hall, Englewood Cliffs, NJ.
19. Draper D., Hanks S., Weld D. Probabilistic planning with information gathering and contingent execution. Proceedings of the AAAI Spring Symposium on Decision Theoretic Planning. 1994;76-82.
20. Ernst M.D., Millstein T.D., Weld D.S. Automatic SAT-compilation of planning problems. Proc. IJCAI-97, Nagoya, Japan. 1997;1169-1176.
21. Fikes R.E., Nilsson N.J. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence. 2:1971;189-208. Reprinted Allen J., Hendler J., Tate A. Readings in Planning. 1990;Morgan Kaufmann, San Mateo, CA.
22. Fikes R.E., Nilsson N.J. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence. 2:1971;189-208. Reprinted Allen J., Hendler J., Tate A. Readings in Planning. 1990;Morgan Kaufmann, San Mateo, CA.
23. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco, CA.
24. Giunchiglia E., Kartha G. Neelakantan, Lifschitz V. Representing action: Indeterminacy and ramifications. Artificial Intelligence. 95:(2):1997;409-438 http://citeseer.nj.nec.com/giunchiglia97representing.html.
25. Goldman R.P., Boddy M.S. Conditional linear planning. Hammond K. The Second International Conference on Artificial Intelligence Planning Systems. 1994;80-85 AAAI Press/MIT Press.
26. Goldman R.P., Boddy M.S. Representing uncertainty in simple planners. Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR-94). 1994;238-245.
27. S. Hanks, D. McDermott. Modeling, a dynamic and uncertain world I: Symbolic and probabilistic reasoning about change, Technical Report, Department of Computer Science and Engineering, University of Washington, Seattle, WA, 1993.
28. Hansen E.A., Feng Z. Dynamic programming for POMDPs using a factored state representation. Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS). 2000;130-139 http://citeseer.nj.nec.com/hansen00dynamic.html.
29. Hoey J., St-Aubin R., Hu A., Boutilier C. SPUDD: Stochastic planning using decision diagrams. Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence. 1999;279-288 http://citeseer.nj.nec.com/hoey99spudd.html.
30. Howard R.A. Dynamic Programming and Markov Processes. 1960;MIT Press, Cambridge, MA.
31. Kaelbling L.P., Littman M.L., Cassandra A.R. Planning and acting in partially observable stochastic domains. Artificial Intelligence. 101:(1-2):1998;99-134.
32. Kautz H., McAllester D., Selman B. Encoding plans in propositional logic. Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR-96). 1996;374-385.
33. Kautz H., McAllester D., Selman B. Exploiting variable dependency in local search. Abstracts of the Poster Sessions of IJCAI-97. 1997;Nagoya, Japan.
34. Kautz H., Selman B. Planning as satisfiability. Proceedings of Tenth European Conference on Artificial Inttelligence (ECAI-92). 1992;359-363.
35. Kautz H., Selman B. Pushing the envelope: Planning, propositional logic, and stochastic search. Proceedings of the Thirteenth 'National Conference on Artificial Intelligence. 1996;1194-1201 AAAI Press/MIT Press.
36. Kautz H., Selman B. BLACKBOX: A new approach to the application of theorem proving to problem solving. Working Notes of the Workshop on Planning as Combinatorial Search. 1998;58-60. Held in conjunction with the Fourth International Conference on Artificial Intelligence Planning.
37. Kautz H., Selman B. The role of domain-specific knowledge in the planning as satisfiability framework. Proceedings of the Fourth International Conference on Artificial Intelligence Planning. 1998;181-189 AAAI Press.
38. Kautz H., Selman B. Unifying SAT-based and graph-based planning. Proc. IJCAI-99, Stockholm, Sweden. 1999;318-325.
39. Kearns M., Mansour Y., Ng A.Y. A sparse sampling algorithm for near-optimal planning in large Markov decision processes. Proc. IJCAI-99, Stockholm, Sweden. 1999;1324-1331 AAAI Press/MIT Press.
40. Koller D., Parr R. Computing factored value functions for policies in structured MDPs. Proc. IJCAI-99, Stockholm, Sweden. 1999;1332-1339 AAAI Press/MIT Press.
41. Koller D., Parr R. Policy iteration for factored MDPs. Proceedings of the Sixteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI 2000). 2000.
42. Kushmerick N., Hanks S., Weld D.S. An algorithm for probabilistic planning. Artificial Intelligence. 76:(1-2):1995;239-286.
43. Li C.M., Anbulagan. Heuristics based on unit propagation for satisfiability problems. Proc. IJCAI-97, Nagoya, Japan. 1997;366-371.
44. Littman M.L. Probabilistic propositional planning: Representations and complexity. Proceedings of the Fourteenth National Conference on Artificial Intelligence. 1997;748-754 AAAI Press/MIT Press, http://www.cs.duke.edu/mlittman/docs/aaai97-planning.ps.
45. Littman M.L., Goldsmith J., Mundhenk M. The computational complexity of probabilistic plan existence and evaluation. J. Artificial Intelligence Res. 9:1998;1-36.
46. Littman M.L., Majercik S.M., Pitassi T. Stochastic Boolean satisfiability. J. Automat. Reason. 27:(3):2001;251-296.
47. Madani O., Hanks S., Condon A. On the undecidability of probabilistic planning and infinite-horizon partially observable Markov decision problems. Proceedings of the Sixteenth National Conference on Artificial Intelligence. 1999;541-548 AAAI Press/MIT Press.
48. Majercik S.M. C-MAXPLAN: Contingent planning in the MAXPLAN framework. Proceedings of the AAAI Spring Symposium on Search Techniques for Problem Solving Under Uncertainty and Incomplete Information, Stanford, CA. 1999.
49. 2: Approximate probabilistic planning out of stochastic satisfiability. Proceedings of the Eighteenth National Conference on Artificial Intelligence Workshop on Probabilistic Approaches in Search. 2002;. To appear.
50. Majercik S.M., Littman M.L. MAXPLAN: A new approach to probabilistic planning. Simmons R., Veloso M., Smith S. Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems. 1998;86-93 AAAI Press.
51. Majercik S.M., Littman M.L. Using caching to solve larger probabilistic planning problems. Proceedings of the Fifteenth National Conference on Artificial Intelligence. 1998;954-959 AAAI Press/MIT Press.
52. Majercik S.M., Rusczek A.P. Faster probabilistic planning through more efficient stochastic satisfiability problem encodings. Proceedings of the Sixth International Conference on Artificial Intelligence Planning Systems. 2002;AAAI Press.
53. S.M. Majercik, Planning under uncertainty via stochastic satisfiability, PhD Thesis, Department of Computer Science, Duke University, September 2000.
54. Mali A.D., Kambhampati S. On the utility of plan-space (causal) encodings. Proceedings of the Sixteenth National Conference on Artificial Intelligence. 1999;557-563 AAAI Press/MIT Press.
55. McAllester D., Selman B., Kautz H. Evidence for invariants in local search. Proceedings of the Fourteenth National Conference on Artificial Intelligence. 1997;321-326 AAAI Press/MIT Press.
56. Nilsson N.J. Principles of Artificial Intelligence. 1980;Tioga, Palo Alto, CA.
57. N. Onder, Personal communication, 1998.
58. N. Onder, Personal communication, 2000.
59. Onder N., Pollack M.E. Contingency selection in plan generation. Proceedings of the Fourth European Conference on Planning: Recent Advances in AI Planning. 1997;364-376.
60. Onder N., Pollack M.E. Conditional, probabilistic planning: A unifying algorithm and effective search control mechanisms. Proceedings of the Sixteenth National Conference on Artificial Intelligence. 1999;577-584 AAAI Press/MIT Press.
61. Papadimitriou C.H. Games against nature. J. Computer Systems Sci. 31:1985;288-301.
62. Papadimitriou C.H. Computational Complexity. 1994;Addison-Wesley, Reading, MA.
63. Peot M.A., Smith D.E. Conditional nonlinear planning. Proceedings of the First International Conference on Artificial Intelligence Planning Systems. 1992;189-197.
64. M.A. Peot, Decision-theoretic planning, PhD Thesis, Department of Engineering-Economic Systems and Operations Research, Stanford University, May 1998.
65. Pryor L., Collins G. Planning for contingencies: A decision-based approach. J. Artificial Intelligence Res. 4:1996;287-339.
66. Puterman M.L., Shin M.C. Modified policy iteration algorithms for discounted Markov decision processes. Management Sci. 24:1978;1127-1137.
67. Schöning U. A probabilistic algorithm for k-SAT and constraint satisfaction problems. Proceedings of the Fortieth Annual IEEE Symposium on Foundations of Computer Science. 1999;410-414.
68. Schubert L. Monotonic solution of the frame problem in the situation calculus; An efficient method for worlds with fully specified actions. Kyburg H., Loui R., Carlson G. Knowledge Representation and Defeasible Reasoning. 1990;23-67 Kluwer Academic, Dordrecht.
69. Selman B., Kautz H., Cohen B. Local search strategies for satisfiability testing. Johnson D.S., Trick M.A. Cliques, Coloring, and Satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 26:1996;American Mathematical Society, Providence, RI.
70. Smith D.E., Weld D.S. Conformant Graphplan. Proceedings of the Fifteenth National Conference on Artificial Intelligence. 1998;889-896 AAAI Press/MIT Press.
71. Walsh T. Stochastic constraint programming. Proceedings of Fifteenth European Conference on Artificial Intelligence (ECAI-2002). 2002;. To appear.
72. Warren D. Generating conditional plans and programs. Proceedings of the Summer Conference on AI and Simulation of Behavior. 1976;344-354 University of Edinburgh.
73. 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. 1998;897-904 AAAI Press/MIT Press.
74. Zhang H., Stickel M.E. Implementing the Davis-Putnam method. J. Automat. Reason. 24:(1-3):2000;277-296.
75. Zwick U., Paterson M. The complexity of mean payoff games on graphs. Theoret. Comput. Sci. 158:(1-2):1996;343-359.