Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes.
Aaron BohyVéronique BruyèreJean-François RaskinPublished in: CoRR (2014)
Keyphrases
- markov decision processes
- shortest path
- policy iteration
- shortest path algorithm
- factored mdps
- reinforcement learning
- optimal policy
- reachability analysis
- finite state
- shortest path problem
- planning under uncertainty
- path length
- strongly connected components
- partially observable markov decision processes
- learning algorithm
- road network
- state space
- reinforcement learning algorithms
- shortest distance
- transition matrices
- stochastic shortest path