Q-learning and policy iteration algorithms for stochastic shortest path problems
We consider the stochastic shortest path problem, a classical finite-state Markovian decision problem with a termination state, and we propose new convergent Q-learning algorithms that combine elements of policy iteration and classical Q-learning/value iteration. These algorithms are related to the...
Main Authors: | , |
---|---|
Other Authors: | , |
Format: | Article |
Language: | English |
Published: |
Springer-Verlag,
2015-02-03T19:29:00Z.
|
Subjects: | |
Online Access: | Get fulltext |