Skip to main navigation Skip to search Skip to main content

Adaptive Computation of Optimal Nonrandomized Policies in Constrained Average-Reward MDPs

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

This paper deals with computation of optimal nonrandomized nonstationary policies and mixed stationary policies for average-reward Markov Decision Processes with multiple criteria and constraints. We consider problems with finite state and action sets satisfying the unichain condition. The described procedure for computing optimal nonrandomized policies can also be used for adaptive control problems.

Original languageEnglish
Title of host publication2009 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning, ADPRL 2009 - Proceedings
Pages96-100
Number of pages5
DOIs
StatePublished - 2009
Event2009 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning, ADPRL 2009 - Nashville, TN, United States
Duration: Mar 30 2009Apr 2 2009

Publication series

Name2009 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning, ADPRL 2009 - Proceedings

Conference

Conference2009 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning, ADPRL 2009
Country/TerritoryUnited States
CityNashville, TN
Period03/30/0904/2/09

Fingerprint

Dive into the research topics of 'Adaptive Computation of Optimal Nonrandomized Policies in Constrained Average-Reward MDPs'. Together they form a unique fingerprint.

Cite this