Computer Science – Discrete Mathematics
Scientific paper
2009-11-17
EPTCS 10, 2009, pp. 44-61
Computer Science
Discrete Mathematics
Scientific paper
10.4204/EPTCS.10.4
We present an extension of two policy-iteration based algorithms on weighted graphs (viz., Markov Decision Problems and Max-Plus Algebras). This extension allows us to solve the following inverse problem: considering the weights of the graph to be unknown constants or parameters, we suppose that a reference instantiation of those weights is given, and we aim at computing a constraint on the parameters under which an optimal policy for the reference instantiation is still optimal. The original algorithm is thus guaranteed to behave well around the reference instantiation, which provides us with some criteria of robustness. We present an application of both methods to simple examples. A prototype implementation has been done.
André Etienne
Fribourg Laurent
No associations
LandOfFree
An Inverse Method for Policy-Iteration Based Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Inverse Method for Policy-Iteration Based Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Inverse Method for Policy-Iteration Based Algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-650566