Topological Value Iteration Algorithms

@article{Dai2011TopologicalVI,
  title={Topological Value Iteration Algorithms},
  author={Peng Dai and Mausam and Daniel S. Weld and Judy Goldsmith},
  journal={J. Artif. Intell. Res.},
  year={2011},
  volume={42},
  pages={181-209}
}
Value iteration is a powerful yet inefficient algorithm for Markov decision processes (MDPs) because it puts the majority of its effort into backing up the entire state space, which turns out to be unnecessary in many cases. In order to overcome this problem, many approaches have been proposed. Among them, ILAO* and variants of RTDP are state-of-the-art ones. These methods use reachability analysis and heuristic search to avoid some unnecessary backups. However, none of these approaches build… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

Multi-partition time aggregation for Markov Chains

2017 IEEE 56th Annual Conference on Decision and Control (CDC) • 2017
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 46 references

Dynamic programming.

Science • 1966
View 6 Excerpts
Highly Influenced

Non-Deterministic Planning Track of the 2006 International Planning Competition.. http://www.ldc.usb.ve/ ̃bonet/ipc5

B. Bonet
2006
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…