Random sampling of states in dynamic programming

Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference

Volumn , Issue , 2008, Pages

  Atkeson, Christopher G ^a   Stephens, Benjamin ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE DYNAMIC PROGRAMMING; DETERMINISTICS; LOCAL MODEL; OPTIMIZERS; RANDOM SAMPLING; STATE POLICY; STATE-VALUE FUNCTIONS; STEADY STATE; TIME INVARIANTS; VALUE FUNCTIONS;

DYNAMIC PROGRAMMING;

EID: 85162005214     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. J. Rust. Using randomization to break the curse of dimensionality. Econometrica, 65(3):487-516, 1997. (Pubitemid 127466157)
2. M. Hauskrecht. Incremental methods for computing bounds in partially observable Markov decision processes. In Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97), pages 734-739, Providence, Rhode Island, 1997. AAAI Press / MIT Press.
3. N.L. Zhang and W. Zhang. Speeding up the convergence of value iteration in partially observable Markov decision processes. JAIR, 14:29-51, 2001. (Pubitemid 33738058)
4. J. Pineau, G. Gordon, and S. Thrun. Point-based value iteration: An anytime algorithm for POMDPs. In International Joint Conference on Artificial Intelligence (IJCAI), 2003.
5. T. Smith and R. Simmons. Heuristic search value iteration for POMDPs. In Uncertainty in Artificial Intelligence, 2004.
6. M.T.J. Spaan and Nikos V. A point-based POMDP algorithm for robot planning. In Proceedings of the IEEE International Conference on Robotics and Automation, pages 2399-2404, New Orleans, Louisiana, April 2004.
7. S. Thrun. Monte Carlo POMDPs. In S.A. Solla, T.K. Leen, and K.-R.Müller, editors, Advances in Neural Information Processing 12, pages 1064-1070. MIT Press, 2000.
8. C. G. Atkeson. Using local trajectory optimizers to speed up global optimization in dynamic programming. In Jack D. Cowan, Gerald Tesauro, and Joshua Alspector, editors, Advances in Neural Information Processing Systems, volume 6, pages 663-670. Morgan Kaufmann Publishers, Inc., 1994.
9. F. L. Lewis and V. L. Syrmos. Optimal Control, 2nd Edition. Wiley-Interscience, 1995.
10. C. Szepesvári. Efficient approximate planning in continuous space Markovian decision problems. AI Communications, 13(3):163-176, 2001. (Pubitemid 33018021)
11. J. N. Tsitsiklis and Van B. Roy. Regression methods for pricing complex American-style options. IEEE-NN, 12:694-703, July 2001. (Pubitemid 32732812)
12. V. D. Blondel and J. N. Tsitsiklis. A survey of computational complexity results in systems and control, 2000.
13. R. Munos and A. W. Moore. Variable resolution discretization in optimal control. Machine Learning Journal, 49:291-323, 2002. (Pubitemid 34325691)
14. S. M. LaValle. Planning Algorithms. Cambridge University Press, 2006.
15. C. G. Atkeson. Randomly sampling actions in dynamic programming. In 2007 IEEE In- ternational Symposium on Approximate Dynamic Programming and Reinforcement Learning (ADPRL), 2007.
16. C. G. Atkeson and J. Morimoto. Nonparametric representation of a policies and value functions: A trajectory based approach. In Advances in Neural Information Processing Systems 15. MIT Press, 2003.
17. P. Dyer and S. R. McReynolds. The Computation and Theory of Optimal Control. Academic Press, New York, NY, 1970.
18. D. H. Jacobson and D. Q. Mayne. Differential Dynamic Programming. Elsevier, New York, NY, 1970.
19. C. G. Atkeson and B. Stephens. Multiple balance strategies from one optimization criterion. In Humanoids, 2007.