TY - GEN
T1 - Aggregation-disaggregation algorithm for ε2-singularly perturbed limiting average Markov control problems
AU - Abbad, Mohammed
AU - Filar, Jerzy A.
PY - 1992/1
Y1 - 1992/1
N2 - Finite state and action Markov decision processes (MDPs) are dynamic, stochastic systems controlled by a controller. These models are usually referred to as Markovian control problems (MCPs). The authors consider a singular perturbation of order 2 for a Markov decision process with the limiting average reward criterion. They define a singular perturbation of order 2 in the following sense: it is assumed that the underlying process is composed of n separate irreducible processes, and that a small ε-perturbation is such that it unites these processes into m separate irreducible processes. Then another small ε2-pertubration is such that it unites these latter processes into a single irreducible process. The singular perturbation of order 2 is formulated. The limit MCP that is entirely different from the original unperturbed MDP, which forms an appropriate asymptotic approximation to a whole family of perturbed problems, is given explicitly. Thus, only the single limit MCP needs to be solved. An aggregation-disaggregation algorithm is constructed for solving the limit MCP.
AB - Finite state and action Markov decision processes (MDPs) are dynamic, stochastic systems controlled by a controller. These models are usually referred to as Markovian control problems (MCPs). The authors consider a singular perturbation of order 2 for a Markov decision process with the limiting average reward criterion. They define a singular perturbation of order 2 in the following sense: it is assumed that the underlying process is composed of n separate irreducible processes, and that a small ε-perturbation is such that it unites these processes into m separate irreducible processes. Then another small ε2-pertubration is such that it unites these latter processes into a single irreducible process. The singular perturbation of order 2 is formulated. The limit MCP that is entirely different from the original unperturbed MDP, which forms an appropriate asymptotic approximation to a whole family of perturbed problems, is given explicitly. Thus, only the single limit MCP needs to be solved. An aggregation-disaggregation algorithm is constructed for solving the limit MCP.
UR - http://www.scopus.com/inward/record.url?scp=0026618378&partnerID=8YFLogxK
U2 - 10.1109/CDC.1991.261346
DO - 10.1109/CDC.1991.261346
M3 - Conference contribution
AN - SCOPUS:0026618378
SN - 0780304500
T3 - Proceedings of the IEEE Conference on Decision and Control
SP - 465
EP - 470
BT - Proceedings of the 30th IEEE Conference on Decision and Control
PB - Institute of Electrical and Electronics Engineers
T2 - 30th IEEE Conference on Decision and Control
Y2 - 11 December 1991 through 13 December 1991
ER -