Difference between revisions of "Markov Decision Process (MDP)"

From
Jump to: navigation, search
m
Line 13: Line 13:
 
Used where outcomes are partly random and partly under the control of a decision maker. MDP is a discrete time stochastic control process. At each time step, the process is in some state s, and the decision maker may choose any action a that is available in state s. The process responds at the next time step by randomly moving into a new state  s', and giving the decision maker a corresponding reward R_{a}(s,s')} R_a(s,s').  The probability that the process moves into its new state s' is influenced by the chosen action.  Helping the convergence of certain algorithms a discount rate (factor) makes an infinite sum finite.
 
Used where outcomes are partly random and partly under the control of a decision maker. MDP is a discrete time stochastic control process. At each time step, the process is in some state s, and the decision maker may choose any action a that is available in state s. The process responds at the next time step by randomly moving into a new state  s', and giving the decision maker a corresponding reward R_{a}(s,s')} R_a(s,s').  The probability that the process moves into its new state s' is influenced by the chosen action.  Helping the convergence of certain algorithms a discount rate (factor) makes an infinite sum finite.
  
 +
<youtube>PYQAI6Td2wo</youtube>
 
<youtube>23FW_vsuETg</youtube>
 
<youtube>23FW_vsuETg</youtube>
 
<youtube>jpmZp3eX-wI</youtube>
 
<youtube>jpmZp3eX-wI</youtube>

Revision as of 20:46, 11 September 2018

Youtube search...

600px-Markov_Decision_Process.svg.png

Solutions:

Used where outcomes are partly random and partly under the control of a decision maker. MDP is a discrete time stochastic control process. At each time step, the process is in some state s, and the decision maker may choose any action a that is available in state s. The process responds at the next time step by randomly moving into a new state s', and giving the decision maker a corresponding reward R_{a}(s,s')} R_a(s,s'). The probability that the process moves into its new state s' is influenced by the chosen action. Helping the convergence of certain algorithms a discount rate (factor) makes an infinite sum finite.