Bounds for the maximum-time stochastic shortest path problem
<p>A stochastic shortest path problem is an undiscounted infinite-horizon Markov decision process with an absorbing and cost-free target state, where the objective is to reach the target state while optimizing total expected cost. In almost all cases, the objective in solving a stochastic shor...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
MSSTATE
2014
|
| Subjects: | |
| Online Access: | http://sun.library.msstate.edu/ETD-db/theses/available/etd-07312014-152039/ |