The (optimal) design of many engineering systems can be adequately recast as a Markov decision process, where requirements on system performance are captured in the form of constraints. In this paper, various optimality results for constrained Markov decision processes are briefly reviewed; the corresponding implementation issues are discussed and shown to lead to several problems of parameter estimation. Simple situations where such constrained problems naturally arise, are presented in the context of queueing systems, in order to illustrate various points of the theory. In each case, the structure of the optimal policy is exhibited
AbstractThe time average reward for a discrete-time controlled Markov process subject to a time-aver...
This piece is a follow-up of the research started by the authors on the constrained optimal control ...
http://deepblue.lib.umich.edu/bitstream/2027.42/4187/5/bac0309.0001.001.pdfhttp://deepblue.lib.umich...
The first part considers discrete-time constrained Markov Decision Processes (MDPs). At each epoch, ...
This paper presents a problem of optimal flow control for discrete-time M|M|l queues, where the deci...
In this talk we consider queueing systems which are subject to control (e.g. admission control, rout...
100 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.In this thesis we consider th...
The purpose of flow control is to reduce the congestion experienced in many systems, such as data ne...
This paper presents a problem of optimal flow control for discrete M|M|1 queues. The problem is cast...
We consider the optimization of finite-state, finite-action Markov Decision processes, under constra...
Two types of traffic, e.g., voice and data, share a single synchronous and noisy communication chann...
We review models for the optimal control of networks of queues, Our main emphasis on models based on...
International audienceThis paper deals with discrete-time Markov Decision Processes (MDP's) under co...
We develop an algorithm to compute optimal policies for Markov decision processes subject to constra...
In constrained Markov decision problems, optimal policies are often found to depend on quantities wh...
AbstractThe time average reward for a discrete-time controlled Markov process subject to a time-aver...
This piece is a follow-up of the research started by the authors on the constrained optimal control ...
http://deepblue.lib.umich.edu/bitstream/2027.42/4187/5/bac0309.0001.001.pdfhttp://deepblue.lib.umich...
The first part considers discrete-time constrained Markov Decision Processes (MDPs). At each epoch, ...
This paper presents a problem of optimal flow control for discrete-time M|M|l queues, where the deci...
In this talk we consider queueing systems which are subject to control (e.g. admission control, rout...
100 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.In this thesis we consider th...
The purpose of flow control is to reduce the congestion experienced in many systems, such as data ne...
This paper presents a problem of optimal flow control for discrete M|M|1 queues. The problem is cast...
We consider the optimization of finite-state, finite-action Markov Decision processes, under constra...
Two types of traffic, e.g., voice and data, share a single synchronous and noisy communication chann...
We review models for the optimal control of networks of queues, Our main emphasis on models based on...
International audienceThis paper deals with discrete-time Markov Decision Processes (MDP's) under co...
We develop an algorithm to compute optimal policies for Markov decision processes subject to constra...
In constrained Markov decision problems, optimal policies are often found to depend on quantities wh...
AbstractThe time average reward for a discrete-time controlled Markov process subject to a time-aver...
This piece is a follow-up of the research started by the authors on the constrained optimal control ...
http://deepblue.lib.umich.edu/bitstream/2027.42/4187/5/bac0309.0001.001.pdfhttp://deepblue.lib.umich...