Sign up & Download
Sign in

Random Sampling of States in Dynamic Programming

by C G Atkeson, B J Stephens
IEEE Transactions on Systems Man and Cybernetics Part B Cybernetics (2008)

Abstract

We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using local trajectory optimizers to globally optimize a policy and associated value function. Our focus is on finding steady-state policies for deterministic time-invariant discrete time control problems with continuous states and actions often found in robotics. In this paper, we describe our approach and provide initial results on several simulated robotics problems.

Cite this document (BETA)

Available from www.ncbi.nlm.nih.gov
Page 1
hidden

Random Sampling of States in Dynamic Programming

Plain text is unavailable for this page.

Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Already have an account? Sign in

Readership Statistics

31 Readers on Mendeley
by Discipline
 
 
 
by Academic Status
 
48% Ph.D. Student
 
10% Student (Master)
 
10% Post Doc
by Country
 
42% United States
 
10% Germany
 
6% China