MARKOVIAN ASSIGNMENT DECISION-PROCESS

被引:0
|
作者
GEETHA, S
NAIR, KPK
机构
来源
关键词
MARKOV DECISION PROCESSES; ASSIGNMENT PROBLEM; AVERAGE GAIN; DISCOUNTED REWARD; POLICY ITERATION; ALGORITHM; OPTIMAL SOLUTION;
D O I
暂无
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
A finite-state, discrete-time Markovian decision process, in which, each action in each state is a feasible solution to a state dependent assignment problem, is considered. The objective is to maximize the additive rewards realized by the assignments over an infinite time horizon. In the undiscounted case, the average gain per transition and in the discounted case, the discounted total gain respectively, are maximized. Properties of optimal solutions in the two cases are characterized and finite algorithms are presented.
引用
收藏
页码:421 / 428
页数:8
相关论文
共 50 条