Using cyclic markov decision process to determine optimum policy
AssigneeInternational Business Machines Corporation
InventorsTakayuki Osogami, Raymond H. Rudy
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorsTakayuki Osogami, Raymond H. Rudy
Estimating the term…
A method for determining an optimum policy by using a Markov decision process in which T subspaces each have at least one state having a cyclic structure includes identifying, with a processor, subspaces that are part of a state space; selecting a t-th (t is a natural number, t≦T) subspace among the identified subspaces; computing a probability of, and an expected value of a cost of, reaching from one or more states in the selected t-th subspace to one or more states in the t-th subspace in a following cycle; and recursively computing a value and an expected value of a cost based on the computed probability and expected value of the cost, in a sequential manner starting from a (t −1)-th subspace.
A method for determining an optimum policy by using a Markov decision process in which T subspaces each have at least one state having a cyclic structure, comprising:
Dependencies are inferred from the claim text.