APPSSAT: Approximate probabilistic planning using stochastic satisfiability

International Journal of Approximate Reasoning

Volumn 45, Issue 2, 2007, Pages 402-419

  Majercik, Stephen M ^a  

^a BOWDOIN COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY; PROBLEM SOLVING; REAL TIME SYSTEMS; STOCHASTIC MODELS;

OPTIMAL PLAN; PROBABILISTIC CONTINGENT PLANNER; TIME-CRITICAL DOMAINS;

STRATEGIC PLANNING;

EID: 34249930117     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijar.2006.06.016     Document Type: Article

References (22)

1. Majercik S.M., and Littman M.L. Contingent planning under uncertainty via stochastic satisfiability. Artificial Intelligence 147 (2003) 119-162
2. Littman M.L., Majercik S.M., and Pitassi T. Stochastic Boolean satisfiability. Journal of Automated Reasoning 27 (2001) 251-296
3. Drummond M., and Bresina J. Anytime synthetic projection: maximizing the probability of goal satisfaction. Proceedings of the Eighth National Conference on Artificial Intelligence (1990), Morgan Kaufman 138-144
4. N. Onder, M.E. Pollack, Contingency selection in plan generation, in: Proceedings of the Fourth European Conference on Planning, 1997, pp. 364-376.
5. Koller D., and Parr R. Computing factored value functions for policies in structured MDPs. Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (1999), The AAAI Press/The MIT Press 1332-1339
6. D. Koller, R. Parr, Policy iteration for factored MDPs, in: Proceedings of the Sixteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI 2000), 2000, pp. 326-334.
7. C. Guestrin, D. Koller, R. Parr, Max-norm projections for factored MDPs, in: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001, pp. 673-682.
8. P. Poupart, C. Boutilier, D. Schuurmans, R. Patrascu, Piecewise linear value function approximation for factored MDPs, in: Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-2002), 2002, pp. 292-299.
9. C. Boutilier, R. Dearden, Approximating value trees in structured dynamic programming, in: Proceedings of the Thirteenth International Conference on Machine Learning, 1996, pp. 56-62.
10. R. St-Aubin, J. Hoey, C. Boutilier, APRICODD: Approximate policy construction using decision diagrams, in: Advances in Neural Information Processing Systems 13 (NIPS-2000), 2000, pp. 1089-1095.
11. Z. Feng, E. Hansen, Approximate planning for factored POMDPs, in: Sixth European Conference on Planning (ECP-01), 2001.
12. P. Poupart, C. Boutilier, VDCBPI: an approximate scalable algorithm for large scale POMDPs, in: Advances in Neural Information Processing Systems 17 (NIPS-2004), 2004, pp. 1081-1088.
13. S. Sanner, C. Boutilier, Approximate linear programming for first-order MDPs, in: Proceedings of the Twenty-first Conference on Uncertainty in Artificial Intelligence (UAI-05), 2005, pp. 509-517.
14. Kearns M.J., Mansour Y., and Ng A.Y. A sparse sampling algorithm for near-optimal planning in large Markov decision processes. Machine Learning 49 (2002) 193-208
15. Kearns M., Mansour Y., and Ng A. Approximate planning in large POMDPs via reusable trajectories. Advances in Neural Information Processing Systems 12 (Proceedings of the 1999 Conference) (2000), MIT Press
16. D.A. McAllester, S. Singh, Approximate planning for factored POMDPs using belief state simplification, in: Proceedings of the Fifteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-99), 1999, pp. 409-416.
17. Zhang N.L., and Lin W. A model approximation scheme for planning in partially observable stochastic domains. Journal of Artificial Intelligence Research 7 (1997) 199-230
18. G. Theocharous, L. Pack Kaelbling, Approximate planning in POMDPs with macro-actions, in: Advances in Neural Information Processing Systems 16 (NIPS-2003), 2003.
19. A. Fern, S. Yoon, R. Givan, Approximate policy iteration with a policy language bias, in: Advances in Neural Information Processing Systems 16 (NIPS-2003), 2003.
20. D. Blatt, S. Murphy, J. Zhu, A-learning for approximate planning, Technical Report 04-63, The Methodology Center, Pennsylvania State University, 2004.
21. Papadimitriou C.H. Games against nature. Journal of Computer Systems Science 31 (1985) 288-301
22. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik, Chaff: Engineering an efficient SAT solver, in: 39th Design Automation Conference (DAC 2001), 2001.