Generic Smooth Motion For Robotics by Matthew Bott - PowerPoint PPT Presentation

1 / 23
About This Presentation
Title:

Generic Smooth Motion For Robotics by Matthew Bott

Description:

Knowledge of the 'current state' of all variables in the initial and ... This cost is then minimised and the path is improved. Example Splines. Good. Bad. Goal ... – PowerPoint PPT presentation

Number of Views:33
Avg rating:3.0/5.0
Slides: 24
Provided by: matthe200
Category:

less

Transcript and Presenter's Notes

Title: Generic Smooth Motion For Robotics by Matthew Bott


1
Generic Smooth Motion For RoboticsbyMatthew
Bott
2
What does the title actually mean?
3
What Is Meant By Generic?
  • Any Robotic System
  • The System Will Require
  • Initial and goal configurations
  • Knowledge of the current state of all variables
    in the initial and goal configurations
  • Control variables which allow the current
    configuration state to be changed
  • Forward kinematics

4
What Is Meant By Smooth Motion?
  • Smooth changes made to configuration variables at
    all times
  • Smooth undulatory smooth

5
How about an basic example?
6
The Rolling Disc
7
Hasnt this already been done?
8
Advantages Over Rivals
  • Does not require Inverse Kinematics
  • These can be unknown or unreliable
  • Does not use pre-set path segments
  • Increases flexibility
  • Produces a smooth path
  • Generally a good thing
  • Generic
  • Can be used on most robots
  • Handles Drift
  • Dynamic path alterations

9
What makes this difficult?
10
Issues
  • The end conditions do not define the solution
  • Inverse kinematics unknown
  • A planned path is insufficient
  • We deal in control changes as opposed to controls
  • Non-Holonomics
  • Movement is restricted by physical
    characteristics
  • Path planning restricted

11
How do we aim to produce the system?
12
Gradient Descent
  • Smoothness may be used as a cost
  • Any configuration can be assigned a cost value
  • A control can then be changed by a small amount
  • Giving a new configuration
  • Giving a new cost value
  • A cost vs. control gradient can then be
    calculated for that control

13
  • This process may be repeated for each control
  • The controls may then be changed by an amount
    proportional to the gradient
  • This changes the configuration to a more
    desirable one
  • This process is in turn repeated until the goal
    is reached.
  • We Do Not Need To Solve Equations
  • The choice of cost measure is vital to the
    success of any gradient descent based method.

14
Thats a lot to take in.
15
(No Transcript)
16
What will be used as Cost?
17
Strain As A Cost Measure
  • We are using strain as a cost measure
  • Why?
  • Strain is effectively curvature2
  • Gradient descent requires a minimum
  • A path of high curvature will be less smooth than
    one of low curvature
  • Therefore a low strain path is a smooth path.

18
How Does It Work?
  • We can place a spline through the initial,
    current and goal states for each configuration
    variable
  • And then take the sum of the strains of each
    spline
  • This cost is then minimised and the path is
    improved

19
Example Splines
Good
Bad
Goal
Current Attempt
Initial
20
Where is all this going?
21
The Grand Plan
  • Prove theory on Rolling Disc
  • Prove theory on more advanced problem
  • Different Robots
  • Physics such as Momentum
  • Introduce Time Restraints
  • Individual robot characteristics

22
Acknowledgements
  • Code and concept contributions from Dr Jon Lewis
  • Supervised by Dr Mike Weir

23
Any Questions?
Write a Comment
User Comments (0)
About PowerShow.com