Utility models for goal-directed, decision-theoretic planners

Computational Intelligence

Volumn 14, Issue 3, 1998, Pages 392-429

  Haddawy, Peter ^a   Hanks, Steve ^b  

^a University of Wisconsin Milwaukee   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Decision theory; Goals; Planning; Preferences; Utility

Indexed keywords

ALGORITHMS; DECISION THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING;

DECISION THEORETIC AGENTS;

ARTIFICIAL INTELLIGENCE;

EID: 0032137162     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/0824-7935.00068     Document Type: Article

References (48)

1. ALLEN, J., H. KAUTZ, R. PELAVIN, and J. TENENBERG. 1991. Reasoning about Plans. Morgan Kaufmann, San Francisco.
2. BELL, D. E. 1977. A decision analysis of objectives for a forest pest problem. In Conflicting Objectives in Decisions. Edited by D. E. Bell, R. L. Keeney, and H. Raiffa. Wiley, New York, ch. 18, pp. 389-421.
3. BELLMAN, R. E. and L. A. ZADEH. 1980. Decision-making in a fuzzy environment. Management Science, 17:B141-B164.
4. BODDY, M. 1991. Solving time-dependent problems: A decision-theoretic approach to planning in dynamic environments. PhD thesis, Brown University, Department of Computer Science, May.
5. BOUTILIER, C., T. DEAN, and S. HANKS. 1995. Decision theoretic planning: Structural assumptions and computational leverage. In Proceedings of the Second European Workshop on Planning.
6. BOUTILIER, C., and R. Dearden. 1994. Using abstractions for decision-theoretic planning with time constraints. In Proceedings of the Twelfth National Conference on Artificial Intelligence, Seattle. AAAI Press/The MIT Press, Menlo Park, CA/Cambridge, pp. 1016-1022.
7. BOUTILIER, C., R. DEARDEN, and M. GOLDSZMIDT. 1995. Exploiting structure in policy construction. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, Montreal. Morgan Kaufmann, San Francisco, pp. 1104-1111.
8. BOUTILIER, C., and D. POOLE. 1996. Computing optimal policies for partially observable decision processes using compact representations. In Proceedings of the Thirteenth National Conference on Artificial Intelligence. AAAI Press/The MIT Press, Menlo Park, CA/Cambridge.
9. BOUTILIER, C., and M. L. PUTERMAN. 1995. Process-oriented planning and average-reward optimality. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, Montreal. Morgan Kaufmann, San Francisco, pp. 1096-1103.
10. DEAN, T., J. FIRBY, and D. MILLER. 1988. Hierarchical planning involving deadlines, travel times, and resources. Computational Intelligence, 4(4):381-398.
11. DEAN, T., L. KAELBLING, J. KIRMAN, and A. NICHOLSON. 1993. Planning with deadlines in stochastic domains. In Proceedings of the Eleventh National Conference on Artificial Intelligence, AAAI, Washington, DC, pp. 574-579.
12. DEAN, T., and K. KANAZAWA. 1989. A model for projection and action. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Morgan Kaufmann, San Francisco, pp. 985-990.
13. DEAN, T., and S. H. LIN. 1995. Decomposition techniques for planning in stochastic domains. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Morgan Kaufmann, San Francisco, pp. 1121-1127.
14. DOAN, A., and P. HADDAWY. 1996. Sound abstraction of probabilistic actions in the constraint mass assignment framework. In Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann, San Francisco, pp. 228-235.
15. DRUMMOND, M. 1989. Situated control rules. In Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning. Morgan Kaufmann, San Francisco, pp. 103-113.
16. DUBOIS, D., and H. PRADE. 1984. Criteria aggregation and ranking of alternatives in the framework of fuzzy set theory. In Fuzzy Sets and Decision Analysis. Edited by H. J. Zimmerman, L. A. Zadeh, and B. R. Gaines. North Holland, Amsterdam, pp. 209-240.
17. ETZIONI, O. 1991. Embedding decision-analytic control in a learning architecture. Artificial Intelligence, 1-3(49):129-160.
18. FELDMAN, J. R., and R. F. SPROULL. 1975. Decision theory and artificial intelligence II: The hungry monkey. Cognitive Science, 1:158-192.
19. HADDAWY, P. 1991. Representing plans under uncertainty: A logic of time, chance, and action. PhD thesis, University of Illinois (Report no. UIUCDCS-R-91-1719).
20. HADDAWY, P., A. DOAN, and R. GOODWIN. 1995. Efficient decision-theoretic planning: Techniques and empirical analysis. In Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann, San Francisco, pp. 229-236.
21. HADDAWY, P., A. DOAN, and C. E. KAHN Jr. 1996. Decision-theoretic refinement planning in medical decision making: Management of acute deep venous thrombosis. Medical Decision Making, 16(4):315-325.
22. HADDAWY, P., and S. HANKS. 1990. Issues in decision-theoretic planning: symbolic goals and numeric utilities. In DARPA Workshop on Innovative Approaches to Planning, Scheduling, and Control. Morgan Kaufmann, San Francisco.
23. HADDAWY, P., and S. HANKS. 1993. Utility models for goal-directed decision-theoretic planners. Technical Report 93-06-04, University of Washington, Department of Computer Science & Engineering, September. Available via anonymous FTP from ~ftp/pub/ai/cs.washington.edu.
24. HADDAWY, P., and M. SUWANDI. 1994. Decision-theoretic refinement planning using inheritance abstraction. In Proceedings of the Second International Conference on AI Planning Systems. Morgan Kaufmann. San Francisco, pp. 266-271.
25. HANKS, S. 1990a. Practical temporal projection. In Proceedings of the Eighth National Conference on Artificial Intelligence. AAAI Press/The MIT Press, Menlo Park, CA/Cambridge.
26. HANKS, S. 1990b. Projecting plans for uncertain worlds. PhD thesis, Yale University, Department of Computer Science, January.
27. HORVITZ, E. J., G. F. COOPER, and D. E. HECKERMAN. 1989. Reflection and action under scarce resources: Theoretical principles and empirical study. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Morgan Kaufmann, San Francisco, pp. 1121-1127.
28. KEENEY, R. L., and H. RAIFFA. 1976. Decisions with Multiple Objectives: Preferences and Value Tradeoffs. John Wiley & Sons, New York.
29. KOENIG, S. 1992. Optimal probabilistic and decision-theoretic planning using Markovian decision theory. PhD thesis, Computer Science Division (EECS), UC Berkeley, May.
30. LITTMAN, M. L., A. R. CASSANDRA, and L. P. KAELBLING. 1995. Learning policies for partially observable environments: Scaling up. In Proceedings of the Twelfth International Conference on Machine Learning. Morgan Kaufmann, San Francisco.
31. MCDERMOTT, D. 1982. A temporal logic for reasoning about processes and plans. Cognitive Science, 6:101-155.
32. PARR, R., and S. J. RUSSELL. 1995. Approximating optimal policies for partially observable stochastic domains. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Morgan Kaufmann, San Francisco.
33. PEMBERTHY, J. S., and D. WELD. 1992. UCPOP: A sound, complete, partial order planner for ADL. in Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning, Morgan Kaufmann, San Francisco, pp. 103-114. Available via anonymous FTP from ~ftp/pub/ai/cs.washington,edu.
34. FEREZ, A. 1995. Learning search control knowledge to improve plan quality. Technical Report CMU-CS-95-175, Carnegie-Mellon University, July.
35. PUTERMAN, M. L. 1994. Markov Decision Processes. John Wiley, New York.
36. RAIFFA, H. 1968. Decision Analysis. Addison-Wesley, Reading, MA.
37. RUSSELL, S. J., and E. H. WEFALD. 1991. Do the Right Thing: Studies in Limited Rationality. MIT Press, Cambridge, MA.
38. TASH, J., and S. RUSSELL. 1994. Control strategies for a stochastic planner. In Proceedings of the Twelfth National Conference on Artificial Intelligence, Seattle. AAAI Press/The MIT Press, Menlo Park, CA/Cambridge, pp. 1079-1085.
39. VERE, S. 1983. Planning in time: Windows and durations for activities and goals. IEEE Transactions on Pattern Analysis and Machine Intelligence, 5(3):246-267.
40. VON NEUMANN, J., and O. MORGENSTERN. 1947. Theory of Games and Economic Behavior, 2nd ed. Princeton University Press, Princeton, NJ.
41. WELLMAN, M. P. 1990. Formulation of Tradeoffs in Planning Under Uncertainty. Pitman, London.
42. WELLMAN. M. P., and J. Doyle. 1991. Preferential semantics for goals. In Proceedings of the Ninth National Conference on Artificial Intelligence. AAAI Press/The MIT Press, Menlo Park, CA/Cambridge.
43. WELLMAN, M. P., and J. Doyle. 1992. Modular utility representation for decision-theoretic planning. In Proceedings of the First International Conference on AI Planning Systems. Morgan Kaufmann, San Francisco.
44. WHITMORE, G. A., and M. C. FINDLAY. 1978. Stochastic Dominance. Lexington Books. Lexington, MA.
45. WILLIAMSON, M. 1996. A value-directed approach to planning. PhD thesis, University of Washington, Department of Computer Science and Engineering, June.
46. WILLIAMSON, M., and S. HANKS. 1994. Optimal planning with a goal-directed utility model. In Proceedings of the Second International Conference on AI Planniing Systems. Morgan Kaufmann, San Francisco.
47. WILLIAMSON, M., and S. HANKS. 1996. Flaw-selection strategies for value-directed planning. In Proceedings of the Third International Conference on AI Planning Systems. Morgan Kaufmann, San Francisco.
48. ZIMMERMAN, H., L. A. ZADEH, and B. R. GAINES. 1984. Fuzzy Sets and Decision Analysis. TIMS Studies in the Management Sciences, vol. 20. North Holland, Amsterdam.