CS545_Lecture_13

CS545_Lecture_13 - CS545-Contents XIII Trajectory Planning...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
CS545—Contents XIII Trajectory Planning Control Policies Desired Trajectories Optimization Methods Dynamical Systems Reading Assignment for Next Class See http://www-clmc.usc.edu/~cs545
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Learning Policies is the Goal of Learning Control Policy: u t ( ) = p x t ( ) , t , α ( )
Background image of page 2
Dynamic Programming & Reinforcement Learning Movement System Nonlinear Controller (Policy) Desired Behavior u x Dynamic Programming requires a model of the movement system Reinforcement Learning can work without models of the movement system Essentials both techniques require to learn a high-dimensional “value function” that assesses the quality of an action u in a state x learning the value function is a complex nonstationary, nonlinear learning process both methods die the curse of dimensionality V = max u r x , u ( ) + τ V x ( ) x f x , u ( ) (HJB-Eqn.)
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Desired Trajectories Essentials prescribe a desired trajectory convert desired trajectory into a (time-dependent) control policy, e.g., by PD- controller Problems Where do desired trajectories come from How to accomplish reactive control How to generalize to new tasks or new situations θ , ( ) desired = f ξ initial , target , t ( ) u = p x , t , α ( ) = k t ( ) desired −θ ( ) + k t ( ) desired ( )
Background image of page 4
Desired Trajectories (cont’d) There is a difference between PATH and TRAJECTORY planning A trajectory involves geometry AND time A path involves only geometry Planning can happen either in joint or operational space There is usually an infinity of possible desired trajectories How is the desired trajectory represented? Every point in time? Only start & final point? Via points? Movement Primitives x d = g t , α ( ) or θ d = f t , ( )
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Joint Space Planning What could one plan? Arbitrary trajectories from start to end
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/06/2010 for the course CS 101 at Cornell.

Page1 / 31

CS545_Lecture_13 - CS545-Contents XIII Trajectory Planning...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online