Randomly sampling actions in dynamic programming

Proceedings of the 2007 IEEE Symposium on Approximate Dynamic Programming and Reinforcement Learning, ADPRL 2007

Volumn , Issue , 2007, Pages 185-192

  Atkeson, Christopher G ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE TIME CONTROL SYSTEMS; OPTIMIZATION; RANDOM PROCESSES; SAMPLING;

CONTINUOUS ACTIONS; DISCRETIZED STATES; INVARIANT CONTROL;

DYNAMIC PROGRAMMING;

EID: 34548784023     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ADPRL.2007.368187     Document Type: Conference Paper

References (22)

1. R. Bellman, Dynamic Programming. Dover, 2003.
2. D. P. Bertsekas, Dynamic Programming and Optimal Control. Athena Scientific, 1995.
3. J. Si, A. Barto, W. B. Powell, and D. W. II, Handbook of Learning and Approximate Dynamic Programming. IEEE, 2004.
4. S. Davies, "Multidimensional triangulation and interpolation for reinforcement learning," 1996. [Online]. Available: citeseer.comp.nus.edu. sg/56687.html
5. C. G. Atkeson, A. W. Moore, and S. Schaal, "Locally weighted learning," Artificial Intelligence Review, vol. 11, pp. 11-73, 1997.
6. F. L. Lewis and V. L. Syrmos, Optimal Control, 2nd Edition (Hardcover). Wiley-Interscience, 1995.
7. D. H. Jacobson and D. Q. Mayne, Differential Dynamic Programming. Elsevier, 1970.
8. P. Dyer and S. McReynolds, The Computational Theory of Optimal Control. Academic, NY, 1970.
9. H. S. Chang, H. G. Lee, M. C. Fu, and S. I. Marcus, "Evolutionary policy iteration for solving Markov decision processes," IEEE Transactions on Automatic Control, vol. 50, pp. 1804-1808, 2005.
10. J. Hu, M. C. Fu, V. R. Ramezani, and S. I. Marcus, "An evolutionary random policy search algorithm for solving Markov decision processes," INFORMS Journal on Computing, vol. to appear, 2007.
11. H. S. Chang, M. C. Fu, J. Hu, and S. I. Marcus, "An adaptive sampling algorithm for solving Markov decision processes," Operations Research, vol. 53, pp. 126-139, 2005.
12. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation - Numerical Methods. Prentice Hall, 1989.
13. _, Neuro-Dynamic Programming. Athena Scientific, Belmont, MA, 1996.
14. R. S. Sutton and A. G. Barto, Reinforcement Learning: An Introduction. MIT Press, Cambridge, MA, 1998.
15. J. Rust, "Using randomization to break the curse of dimensionality," Econometrica, vol. 65, no. 3, pp. 487-516, 1997. [Online]. Available: citeseer.ist.psu.edu/rust96using.html
16. A. S. Nemirovsky and D. Yudin, Problem Complexity and Method Efficiency in Optimization. Wiley, New York, 1983.
17. J. Rust, "Dynamic programming," in New Palgrave Dictionary of Economics, 2006.
18. G. Gordon, "Approximate solutions to Markov decision processes," Ph.D. dissertation, Carnegie Mellon University, 1999. [Online]. Available: citeseer.ist.psu.edu/gordon99approximate.html
19. R. J. Williams and L. C. Baird, III, "Analysis of some incremental variants of policy iteration: First steps toward understanding actor-critic learning systems," Northeastern University, Tech. Rep. NU-CCS-93-11, 1993. [Online]. Available: citeseer.ist.psu.edu/williams93analysis.html
20. C. Watkins and P. Dayan, "Q-learning," Machine Learning, vol. 8, no. 3, pp. 279-292, 1992.
21. S. M. LaValle, "From dynamic programming to RRTs: Algorithmic design of feasible trajectories," in Control Problems in Robotics. Springer-Verlag, 2002, pp. 19-37.
22. D. Burfoot, J. Pineau, and D. Dudek, "RRT-Plan: a randomized algorithm for STRIPS planning," in International Conference on Automated Planning and Scheduling (ICAPS), 2006.