Decision-theoretic planning

AI Magazine

Volumn 20, Issue 2, 1999, Pages 37-54

  Blythe, Jim ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; HEURISTIC METHODS; MARKOV PROCESSES; PROBABILITY;

BURIDAN; DECISION THEORETIC PLANNING; MARKOV DECISION PROCESS; PLANNING ALGORITHM;

DECISION THEORY;

EID: 0032666946     PISSN: 07384602     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (59)

1. Blum, A., and Furst, M. 1997. Fast Planning through Planning Graph Analysis. Artificial Intelligence 90(1-2): 281-300.
2. Blythe, J. 1998. Planning under Uncertainty in Dynamic Domains. Ph.D. dissertation, Computer Science Department, Carnegie Mellon University.
3. Blythe, J. 1996. Decompositions of Markov Chains for Reasoning about External Change in Planners. In Proceedings of the Third International Conference on Artificial Intelligence Planning Systems, ed. B. Drabble, 27-34. Menlo Park, Calif.: AAAI Press.
4. Blythe, J. 1995. The Footprint Principle for Heuristics for Probabilistic Planners. In New Directions in AI Planning, eds. M. Ghallab and A. Milani, 173-185. Amsterdam, The Netherlands: IOS.
5. Blythe, J. 1994. Planning with External Events. In Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence, eds. R. L. de Mantaras and D. Poole, 94-101. San Francisco, Calif.: Morgan Kaufmann.
6. Blythe, J., and Veloso, M. 1997. Using Analogy in Conditional Planners. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, 668-673. Menlo Park, Calif.: American Association for Artificial Intelligence.
7. Boutilier, C., and Dearden, R. 1994. Using Abstractions for Decision-Theoretic Planning with Time Constraints. In Proceedings of the Twelfth National Conference on Artificial Intelligence, 1016-1022. Menlo Park, Calif.: American Association for Artificial Intelligence.
8. Boutilier, C.; Brafman, R.; and Geib, C. 1998. Structured Reachability Analysis for Markov Decision Processes. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, 24-32. San Francisco, Calif.: Morgan Kaufmann.
9. Boutilier, C.; Brafman, R. I.; and Geib, C. 1997. Prioritized Goal Decomposition of Markov Decision Processes: Toward a Synthesis of Classical and Decision Theoretic Planning. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
10. Boutilier, C.; Dean, T.; and Hanks, S. 1995. Planning under Uncertainty: Structural Assumptions and Computational Leverage. In New Directions in AI Planning, eds. M. Ghallab and A. Milani, 157-172. Amsterdam, The Netherlands: IOS.
11. Boutilier, C.; Dearden, R.; and Goldszmidt, M. 1995. Exploiting Structure in Policy Construction. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1104-1111. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
12. Brafman, R. 1997. A Heuristic Variable Grid Solution Method of POMDPs. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, 727-733. Menlo Park, Calif.: American Association for Artificial Intelligence.
13. Cassandra, A. R.; Kaelbling, L. P.; and Littman, M. L. 1994. Acting Optimally in Partially Observable Stochastic Domains. In Proceedings of the Twelfth National Conference on Artificial Intelligence, 1023 -1028. Menlo Park, Calif.: American Association for Artificial Intelligence.
14. Davis, M.; Logemann, G.; and Loveland, D. 1962. A Machine Program for Theorem Proving. Communications of the ACM 5:394-397.
15. Dean, T., and Givan, R. 1997. Model Minimization in Markov Decision Processes. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, 106-111. Menlo Park, Calif.: American Association for Artificial Intelligence.
16. Dean, T., and Lin, S.-H. 1995. Decomposition Techniques for Planning in Stochastic Domains. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1121-1127. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
17. Dean, T.; Kaelbling, L.; Kirman, J.; and Nicholson, A. 1995. Planning under Time Constraints in Stochastic Domains. Artificial Intelligence 76(1-2): 35-74.
18. Dean, T.; Kaelbling, L. P.; Kirman, J.; and Nicholson, A. 1993. Planning with Deadlines in Stochastic Domains. In Proceedings of the Eleventh National Conference on Artificial Intelligence, 574-579. Menlo Park, Calif.: American Association for Artificial Intelligence.
19. Draper, D.; Hanks, S.; and Weld, D. 1994. Probabilistic Planning with Information Gathering and Contingent Execution. In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, ed. K. Hammond, 31-37. Menlo Park, Calif.: AAAI Press.
20. Feldman, J. A., and Sproull, R. F. 1977. Decision Theory and Artificial Intelligence II: The Hungry Monkey. Cognitive Science 1:158-192.
21. Fikes, R. E., and Nilsson, N. J. 1971. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving. Artificial Intelligence 2:189-208.
22. Friedland, P. E., and Iwasaki, Y. 1985. The Concept and Implementation of Skeletal Plans. Journal of Automated Reasoning 1(2): 161-208.
23. Givan, R., and Dean, T. 1997. Model Minimization, Regression, and Propositional STRIPS Planning. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
24. Goldman, R. P., and Boddy, M. S. 1994. Epsilon-Safe Planning. In Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence, eds. R. L. de Mantaras and D. Poole, 253-261. San Francisco, Calif.: Morgan Kaufmann.
25. Goodwin, R., and Simmons, R. 1998. Search Control of Plan Generation in Decision-Theoretic Planning. In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, eds. R. Simmons and S. Smith, 94-101. Menlo Park, Calif.: AAAI Press.
26. Haddawy, P., and Hanks, S. 1998a. Utility Models for Goal-Directed Decision-Theoretic Planners. Computational Intelligence 14(3): 392-429.
27. Haddawy, P., and Hanks, S., eds. 1998b. Working Notes of the AAAI Spring Symposium on Interactive and Mixed-Initiative Decision-Theoretic Systems. Menlo Park, Calif.: AAAI Press.
28. Haddawy, P., and Suwandi, M. 1994. Decision-Theoretic Refinement Planning Using Inheritance Abstraction. In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, ed. K. Hammond. Menlo Park, Calif.: AAAI Press.
29. Haddawy, P.; Doan, A.; and Goodwin, R. 1995. Efficient Decision-Theoretic Planning: Techniques and Empirical Analysis. In Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, eds. P. Besnard and S. Hanks, 229-326. San Francisco, Calif.: Morgan Kaufmann.
30. Haddawy, P.; Doan, A.; and Kahn, C. E. 1996. Decision-Theoretic Refinement Planning in Medical Decision Making: Management of Acute Deep Venous Thrombosis. Medical Decision Making 16(4): 315-325.
31. Howard, R. A. 1960. Dynamic Programming and Markov Processes. Cambridge, Mass.: MIT Press.
32. Kautz, H. A., and Selman, B. 1996. Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence. Menlo Park, Calif.: American Association for Artificial Intelligence.
33. Knoblock, C. A. 1991. Automatically Generating Abstractions for Problem Solving. Ph.D. dissertation, Computer Science Department, Carnegie Mellon University.
34. Kushmerick, N.; Hanks, S.; and Weld, D. 1995. An Algorithm for Probabilistic Planning. Artificial Intelligence 76(1-2): 239-286.
35. Kushmerick, N.; Hanks, S.; and Weld, D. 1994. An Algorithm for Probabilistic Least-Commitment Planning. In Proceedings of the Twelfth National Conference on Artificial Intelligence, 1073-1078. Menlo Park, Calif.: American Association for Artificial Intelligence.
36. Littman, M. L. 1996. Algorithms for Sequential Decision Making. Ph.D. dissertation, Department of Computer Science, Brown University.
37. Littman, M. L.; Goldsmith, J.; and Mundhenk, M. 1998. The Computational Complexity of Probabilistic Planning. Journal of Artificial Intelligence Research 9:1-36.
38. Luce, R. D., and Raiffa, H. 1957. Games and Decisions: Introduction and Critical Survey. New York: Wiley.
39. McDermott, D. 1992. Transformational Planning of Reactive Behavior. Technical Report, YALEU/CSD/RR/941, Department of Computer Science, Yale University.
40. Majercik, S. M., and Littman, M. L. 1998. MAXPLAN: A New Approach to Probabilistic Planning. In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, eds. R. Simmons and S. Smith, 86-93. Menlo Park, Calif.: AAAI Press.
41. Newell, A., and Simon, H. A. 1963. GPS: A Program That Simulates Human Thought. In Computers and Thought, eds. E. A. Feigenbaum and J. Feldman, 279-293. New York: McGraw-Hill.
42. Onder, N., and Pollack, M. 1997. Contingency Selection in Plan Generation. Paper presented at the European Conference on Planning, 24-26 September, Toulouse, France.
43. Parr, R., and Russell, S. 1995. Approximating Optimal Policies for Partially Observable Stochastic Domains. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1088-1094. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
44. Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems. San Francisco, Calif.: Morgan Kaufmann.
45. Penberthy, J. S., and Weld, D. S. 1992. UCPOP: A Sound, Complete, Partial-Order Planner for ADL. Paper presented at the Third International Conference on Principles of Knowledge Representation and Reasoning, October, Cambridge, Massachusetts.
46. Peot, M. A., and Smith, D. E. 1992. Conditional Nonlinear Planning. In Proceedings of the First International Conference on Artificial Intelligence Planning Systems, ed. J. Hendler, 189-197. San Francisco, Calif.: Morgan Kaufmann.
47. Pérez, M. A., and Carbonell, J. 1994. Control Knowledge to Improve Plan Quality. In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, ed. K. Hammond, 323-328. Menlo Park, Calif.: AAAI Press.
48. Pryor, L., and Collins, G. 1996. Planning for Contingencies: A Decision-Based Approach. Journal of Artificial Intelligence Research 4:287-339.
49. Puterman, M. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. New York: Wiley.
50. Smith, D. E., and Weld, D. 1998. Conformant GRAPHPLAN. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, 889-896. Menlo Park, Calif.: American Association for Artificial Intelligence.
51. Tash, J. K., and Russell, S. 1994. Control Strategies for a Stochastic Planner. In Proceedings of the Twelfth National Conference on Artificial Intelligence, 1079-1085. Menlo Park, Calif.: American Association for Artificial Intelligence.
52. Tate, A. 1977. Generating Project Networks. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence, 888-893. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
53. Veloso, M.; Carbonell, J.; Pérez, A.; Borrajo, D.; Fink, E.; and Blythe, J. 1995. Integrating Planning and Learning: The PRODIGY Architecture. Journal of Experimental and Theoretical AI 7(1): 81-120.
54. Weld, D. 1994. An Introduction to Least-Commitment Planning. AI Magazine 15(4): 27-61.
55. Weld, D.; Anderson, C.; and Smith, D. E. 1998. Extending GRAPHPLAN to Handle Uncertainty and Sensing Actions. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, 897-904. Menlo Park, Calif.: American Association for Artificial Intelligence.
56. Wellman, M. P. 1990. Formulation of Trade-Offs in Planning under Uncertainty. New York: Pitman.
57. Wellman, M. P.; Breese, J. S.; and Goldman, R. P. 1992. From Knowledge Bases to Decision Models. Knowledge Engineering Review 7(1): 35-53.
58. Wilkins, D. E.; Myers, K. L.; Lowrance, J. D.; and Wesley, L. P. 1995. Planning and Reacting in Uncertain and Dynamic Environments. Journal of Experimental and Theoretical AI 7(1): 197-227.
59. Williamson, M., and Hanks, S. 1994. Optimal Planning with a Goal-Directed Utility Model. In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, ed. K. Hammond, 176-181. Menlo Park, Calif.: AAAI Press.