Geometric interpretation of Hamiltonian cycles problem via singularly perturbed Markov decision processes

被引:2
作者
Ejov, V [1 ]
Filar, JA [1 ]
Thredgold, J [1 ]
机构
[1] Univ S Australia, Ctr Ind & Appl Math, Mawson Lakes, SA 5095, Australia
基金
澳大利亚研究理事会;
关键词
Hamiltonian cycle; Markov decision process; perturbation parameter; directed graph;
D O I
10.1080/02331930310001611529
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider the Hamiltonian cycle problem (HCP) embedded in a singularly perturbed Markov decision process (MDP). More specifically, we consider the HCP as an optimization problem over the space of long-run state-action frequencies induced by the MDP's stationary policies. We also consider two quadratic functionals over the same space. We show that when the perturbation parameter, epsilon, is sufficiently small the Hamiltonian cycles of the given directed graph are precisely the maximizers of one of these quadratic functionals over the frequency space intersected with an appropriate (single) contour of the second quadratic functional. In particular, all these maximizers have a known Euclidean distance of z(m)(epsilon) from the origin. Geometrically, this means that Hamiltonian cycles, if any, are the points in the frequency polytope where the circle of radius z(m)(epsilon) intersects a certain ellipsoid.
引用
收藏
页码:441 / 458
页数:18
相关论文
共 12 条
[1]  
Andramonov M, 2000, NONCON OPTIM ITS APP, V42, P31
[2]   Constrained discounted Markov decision processes and Hamiltonian Cycles [J].
Feinberg, EA .
MATHEMATICS OF OPERATIONS RESEARCH, 2000, 25 (01) :130-140
[3]  
Filar J., 1996, COMPETITIVE MARKOV D
[4]  
FILAR J, 2003, IN PRESS J GLOBAL OP
[5]   HAMILTONIAN CYCLES AND MARKOV-CHAINS [J].
FILAR, JA ;
KRASS, D .
MATHEMATICS OF OPERATIONS RESEARCH, 1994, 19 (01) :223-237
[6]  
Filar JA., 2000, ANZIAM J, V42, pC556
[7]  
KALLENBERG LCM, 1983, MATH CENTRE TRACT, V148
[8]  
Karp R. M., 1977, Mathematics of Operations Research, V2, P209, DOI 10.1287/moor.2.3.209
[9]  
MURRAY W, 2003, UNPUB MATH PROGRAMMI
[10]   An efficient algorithm for the Knight's tour problem [J].
Parberry, I .
DISCRETE APPLIED MATHEMATICS, 1997, 73 (03) :251-260