Solving Large MDPs Quickly with Partitioned Value Iteration
Value iteration is not typically considered a viable algorithm for solving large-scale MDPs because it converges too slowly. However, its performance can be dramatically improved by eliminating redundant or useless backups, and by backing up states in the right order. We present several methods d...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
BYU ScholarsArchive
2004
|
| Subjects: | |
| Online Access: | https://scholarsarchive.byu.edu/etd/47 https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1046&context=etd |