Robust Policy Computation in Reward-Uncertain MDPs Using Nondominated Policies

Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010

Volumn , Issue , 2010, Pages 1127-1133

  Regan, Kevin ^a   Boutilier, Craig ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; OPTIMIZATION;

DECISION CRITERIONS; MARKOV DECISION PROCESSES; MINIMAX REGRET; NON-DOMINATED SETS; REWARD FUNCTION; ROBUST OPTIMIZATION; ROBUST SOLUTIONS; SPEED UP; VALUE FUNCTIONS;

MARKOV PROCESSES;

EID: 85167440387     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Bagnell, A.; Ng, A.; and Schneider, J. 2003. Solving uncertain Markov decision problems. Technical Report CMU-RITR-01-25, Carnegie Mellon University, Pittsburgh.
2. Boger, J.; Poupart, P.; Hoey, J.; Boutilier, C.; Fernie, G.; and Mihailidis, A. 2006. A planning system based on Markov decision processes to guide people with dementia through activities of daily living. IEEE Transactions on Information Technology in Biomedicine 10(2):323-333.
3. Boutilier, C.; Das, R.; Kephart, J. O.; Tesauro, G.; and Walsh, W. E. 2003. Cooperative negotiation in autonomic systems using incremental utility elicitation. In Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence (UAI-03), 89-97.
4. Boutilier, C.; Dean, T.; and Hanks, S. 1999. Decision theoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research 11:1-94.
5. Braziunas, D., and Boutilier, C. 2005. Local utility elicitation in GAI models. In Proceedings of the Twenty-first Conference on Uncertainty in Artificial Intelligence (UAI-05), 42-49.
6. Cheng, H.-T. 1988. Algorithms for Partially Observable Markov Decision Processes. Ph.D. Dissertation, University of British Columbia, Vancouver.
7. Delage, E., and Mannor, S. 2007. Percentile optimization in uncertain Markov decision processes with application to efficient exploration. In Proceedings of the Twenty-fourth International Conference on Machine Learning (ICML-07), 225-232.
8. Iyengar, G. 2005. Robust dynamic programming. Mathematics of Operations Research 30(2):257.
9. Kaelbling, L. P.; Littman, M. L.; and Cassandra, A. R. 1998. Planning and acting in partially observable stochastic domains. Artificial Intelligence 101(1-2):99-134.
10. McMahan, B.; Gordon, G.; and Blum, A. 2003. Planning in the presence of cost functions controlled by an adversary. In Proceedings of the Twentieth International Conference on Machine Learning (ICML-03), 536-543.
11. Nilim, A., and Ghaoui, L. E. 2005. Robust control of markov decision processes with uncertain transition matrices. Operations Research 53(5):780-798.
12. Puterman, M. 1994. Markov decision processes: Discrete stochastic dynamic programming. Wiley, New York.
13. Regan, K., and Boutilier, C. 2009. Regret-based reward elicitation for Markov decision processes. In Proceedings of the Twenty-fifth Conference on Uncertainty in Artificial Intelligence (UAI-09).
14. Savage, L. J. 1954. The Foundations of Statistics. New York: Wiley.
15. Xu, H., and Mannor, S. 2009. Parametric regret in uncertain Markov decision processes. In 48th IEEE Conference on Decision and Control, 3606-3613.