Car-Like Robot: How to Park a Car? (Nonholonomic Planning)

Slides:



Advertisements
Similar presentations
NUS CS5247 Motion Planning for Car- like Robots using a Probabilistic Learning Approach --P. Svestka, M.H. Overmars. Int. J. Robotics Research, 16: ,
Advertisements

Rolling, Torque, and Angular Momentum
Motion Planning for Point Robots CS 659 Kris Hauser.
Non-holonomic Constraints and Lie brackets. Definition: A non-holonomic constraint is a limitation on the allowable velocities of an object So what does.
Feasible trajectories for mobile robots with kinematic and environment constraints Paper by Jean-Paul Laumond I am Henrik Tidefelt.
University of Amsterdam Search, Navigate, and Actuate - Quantitative Navigation Arnoud Visser 1 Search, Navigate, and Actuate Quantative Navigation.
Kinematics & Grasping Need to know: Representing mechanism geometry Standard configurations Degrees of freedom Grippers and graspability conditions Goal.
Kinodynamic Path Planning Aisha Walcott, Nathan Ickes, Stanislav Funiak October 31, 2001.
Randomized Motion Planning for Car-like Robots with C-PRM Guang Song and Nancy M. Amato Department of Computer Science Texas A&M University College Station,
Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles (1991) Jerome Barraquand Jean-Claude Latombe.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Non-Holonomic Motion Planning.
Paper by Kevin M.Lynch, Naoji Shiroma, Hirohiko Arai, and Kazuo Tanie
Probabilistic Robotics
CS 326 A: Motion Planning and Under-Actuated Robots.
Robotics R&N: ch 25 based on material from Jean- Claude Latombe, Daphne Koller, Stuart Russell.
CS 326A: Motion Planning Non-Holonomic Motion Planning.
CS 326 A: Motion Planning 2 Dynamic Constraints and Optimal Planning.
Introduction to ROBOTICS
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Kinodynamic Planning and Navigation with Movable Obstacles.
Randomized Motion Planning for Car-like Robots with C-PRM Guang Song, Nancy M. Amato Department of Computer Science Texas A&M University College Station,
Feasible Trajectories for Mobile Robots with Kinematic and Environment Constraints Jean-Paul Laumond.
Single Point of Contact Manipulation of Unknown Objects Stuart Anderson Advisor: Reid Simmons School of Computer Science Carnegie Mellon University.
CS 326A: Motion Planning Basic Motion Planning for a Point Robot.
CS 326 A: Motion Planning Kinodynamic Planning.
Mechatronics 1 Week 11. Learning Outcomes By the end of week 11 session, students will understand some sorts of mobile robot and locomotion of wheeled.
Motion Control (wheeled robots)
1 CMPUT 412 Motion Control – Wheeled robots Csaba Szepesvári University of Alberta TexPoint fonts used in EMF. Read the TexPoint manual before you delete.
Class material vs. Lab material – Lab 2, 3 vs. 4,5, 6 BeagleBoard / TI / Digilent GoPro.
9/14/2015CS225B Kurt Konolige Locomotion of Wheeled Robots 3 wheels are sufficient and guarantee stability Differential drive (TurtleBot) Car drive (Ackerman.
© Manfred Huber Autonomous Robots Robot Path Planning.
Wheeled Robots ~ 1.5 cm to a side temperature sensor & two motors travels 1 inch in 3 seconds untethered !!
Introduction to ROBOTICS
Beyond trial and error…. Establish mathematically how robot should move Kinematics: how robot will move given motor inputs Inverse-kinematics: how to.
The problem of the shortest path The classic Dijkstra algorithm solution to this problem The adaptation of this solution to the problem of robot motion.
1 C03 – Advanced Robotics for Autonomous Manipulation Department of Mechanical EngineeringME 696 – Advanced Topics in Mechanical Engineering.
Path Planning for a Point Robot
Sect. 1.3: Constraints Discussion up to now  All mechanics is reduced to solving a set of simultaneous, coupled, 2 nd order differential eqtns which.
Non-Holonomic Motion Planning. Probabilistic Roadmaps What if omnidirectional motion in C-space is not permitted?
Tree-Growing Sample-Based Motion Planning
Randomized Kinodynamics Planning Steven M. LaVelle and James J
Autonomous Robots Robot Path Planning (3) © Manfred Huber 2008.
Optimal Path Planning on Matrix Lie Groups Mechanical Engineering and Applied Mechanics Sung K. Koh U n i v e r s i t y o f P e n n s y l v a n i a.
Basilio Bona DAUIN – Politecnico di Torino
James Irwin Amirkhosro Vosughi Mon 1-5pm
Randomized KinoDynamic Planning Steven LaValle James Kuffner.
Gaits Cost of Transportation Wheeled Mobile Robots Most popular locomotion mechanism Highly efficient Simple mechanical implementation Balancing is.
EQUATIONS OF MOTION: NORMAL AND TANGENTIAL COORDINATES (Section 13.5)
Lecture 19 Goals: Chapter 14
Control Design and Analysis of Chained Systems
Chapter 8 FRICTION W A horizontal force P applied to a block will not at first cause it to move. This is because the friction force F balances P. P F.
Path Curvature Sensing Methods for a Car-like Robot
Chapter 10: Rotational Motional About a Fixed Axis
Locomotion of Wheeled Robots
Kinematics of Wheeled Robots
Kinematics of Wheeled Robots
Dynamic Planning / Optimal Control
KINETIC ENERGY, WORK, PRINCIPLE OF WORK AND ENERGY
Non-Holonomic Motion Planning
Final Review Hannah Lyness.
Kinematics The branch of mechanics that studies the motion of a body without caring about what caused the motion.
Day 29 Bug Algorithms 12/7/2018.
Day 29 Bug Algorithms 12/8/2018.
Vertical Circular Motion
Planning and Navigation
Kinematics of Wheeled Robots
Bölüm 8 Sürtünme W A horizontal force P applied to a block will not at first cause it to move. This is because the friction force F balances P. P F As.
Motion Planning for a Point Robot (1/2)
Planning.
EQUATIONS OF MOTION: NORMAL AND TANGENTIAL COORDINATES
xf = xi + vt Displacement is change in position Dx = xf - xi
Presentation transcript:

Car-Like Robot: How to Park a Car? (Nonholonomic Planning)

Types of Path Constraints Local constraints: e.g., lie in free space Differential constraints: e.g., have bounded curvature Global constraints: e.g., have minimal length

Types of Path Constraints Local constraints: e.g., lie in free space Differential constraints: e.g., have bounded curvature Global constraints: e.g., have minimal length

Car-Like Robot y x Configuration space is 3-dimensional: q = (x, y, q)

Example: Car-Like Robot q f dx/dt = v cosq dy/dt = v sinq dq/dt = (v/L) tan f |f| < F dx sinq – dy cosq = 0 L q y x Configuration space is 3-dimensional: q = (x, y, q) But control space is 2-dimensional: (v, f) with |v| = sqrt[(dx/dt)2+(dy/dt)2]

Example: Car-Like Robot q f dx/dt = v cosq dy/dt = v sinq dq/dt = (v/L) tan f |f| < F dx sinq – dy cosq = 0 L q y x Lower-bounded turning radius

How Can This Work? Tangent Space/Velocity Space x L q f x y q (x,y,q) (dx,dy,dq) (dx,dy) dx/dt = v cosq dy/dt = v sinq dq/dt = (v/L) tan f |f| < F dx sinq – dy cosq = 0 q

How Can This Work? Tangent Space/Velocity Space x L q f x y q (x,y,q) (dx,dy,dq) (dx,dy) dx/dt = v cosq dy/dt = v sinq dq/dt = (v/L) tan f |f| < F q

Type 1 Maneuver  Allows sidewise motion CYL(x,y,dq,h) h = 2r tandq d = 2r(1/cosdq - 1) > 0 (x,y,q0) dq h h (x,y) q r dq dq r When dq  0, so does d and the cylinder becomes arbitrarily small  Allows sidewise motion

Type 2 Maneuver  Allows pure rotation

Combination

Combination

Coverage of a Path by Cylinders q + q q’ y x Path created ignoring the car constraints

Path Examples

Drawbacks Final path can be far from optimal Not applicable to car that can only move forward (e.g., think of an airplane)

Reeds and Shepp Paths

Reeds and Shepp Paths CC|C0 CC|C C|CS0C|C Given any two configurations, the shortest RS paths between them is also the shortest path

Example of Generated Path Holonomic Nonholonomic

Other Technique: Control-Based Sampling dx/dt = v cos q dy/dt = v sin q dq/dt = (v/L) tan f |f| < F dx sinq – dy cosq = 0 1. Select a node m 2. Pick v, f, and dt 3. Integrate motion from m new configuration

Other Technique: Control-Based Sampling Indexing array: A 3-D grid is placed over the configuration space. Each milestone falls into one cell of the grid. A maximum number of milestones is allowed in each cell (e.g., 2 or 3). Asymptotic completeness: If a path exists, the planner is guaranteed to find one if the resolution of the grid is fine enough.

Computed Paths Tractor-trailer Car That Can Only Turn Left jmax=45o, jmin=22.5o jmax=45o

Application

Architectural Design: Verification of Building Code C. Han

Other “Similar” Robots/Moving Objects (Nonholonomic) Rolling-with-no-sliding contact (friction), e.g.: car, bicycle, roller skate Submarine, airplane Conservation of angular momentum: satellite robot, under-actuated robot, cat Why is it useful? - Fewer actuators: design simplicity, less weight - Convenience (think about driving a car with 3 controls!)