Paper by Kevin M.Lynch, Naoji Shiroma, Hirohiko Arai, and Kazuo Tanie

Slides:



Advertisements
Similar presentations
Motion Planning for Point Robots CS 659 Kris Hauser.
Advertisements

Nonholonomic Motion Planning: Steering Using Sinusoids R. M. Murray and S. S. Sastry.
Manipulator Dynamics Amirkabir University of Technology Computer Engineering & Information Technology Department.
Introduction University of Bridgeport 1 Introduction to ROBOTICS.
By Lydia E. Kavraki, Petr Svestka, Jean-Claude Latombe, Mark H. Overmars Emre Dirican
Probabilistic Roadmap
Trajectory Generation
INTRODUCTION TO DYNAMICS ANALYSIS OF ROBOTS (Part 6)
Kinodynamic Path Planning Aisha Walcott, Nathan Ickes, Stanislav Funiak October 31, 2001.
NUS CS5247 Randomized Kinodynamic Motion Planning with Moving Obstacles - D. Hsu, R. Kindel, J.C. Latombe, and S. Rock. Int. J. Robotics Research, 21(3): ,
Randomized Kinodynamics Motion Planning with Moving Obstacles David Hsu, Robert Kindel, Jean-Claude Latombe, Stephen Rock.
CSCE 641: Forward kinematics and inverse kinematics Jinxiang Chai.
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.
Trajectory Week 8. Learning Outcomes By the end of week 8 session, students will trajectory of industrial robots.
CS 326 A: Motion Planning and Under-Actuated Robots.
Planning Paths for Elastic Objects Under Manipulation Constraints Florent Lamiraux Lydia E. Kavraki Rice University Presented by: Michael Adams.
Self-Collision Detection and Prevention for Humonoid Robots Paper by James Kuffner et al. Jinwhan Kim.
CSCE 641: Forward kinematics and inverse kinematics Jinxiang Chai.
CS 326A: Motion Planning Non-Holonomic Motion Planning.
Forward Kinematics.
Presented By: Huy Nguyen Kevin Hufford
Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles By Jerome Barraquand and Jean-Claude Latombe Presenter:
ME Robotics DIFFERENTIAL KINEMATICS Purpose: The purpose of this chapter is to introduce you to robot motion. Differential forms of the homogeneous.
Manipulator Dynamics Amirkabir University of Technology Computer Engineering & Information Technology Department.
CSCE 689: Forward Kinematics and Inverse Kinematics
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
CS 326 A: Motion Planning Coordination of Multiple Robots.
CS 326 A: Motion Planning Kinodynamic Planning.
Inverse Kinematics Jacobian Matrix Trajectory Planning
Definition of an Industrial Robot
IMPLEMENTATION ISSUES REGARDING A 3D ROBOT – BASED LASER SCANNING SYSTEM Theodor Borangiu, Anamaria Dogar, Alexandru Dumitrache University Politehnica.
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.
Constraints-based Motion Planning for an Automatic, Flexible Laser Scanning Robotized Platform Th. Borangiu, A. Dogar, A. Dumitrache University Politehnica.
World space = physical space, contains robots and obstacles Configuration = set of independent parameters that characterizes the position of every point.
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.
Lecture 2: Introduction to Concepts in Robotics
A PPLIED M ECHANICS Lecture 02 Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Robotics Chapter 5 – Path and Trajectory Planning
MAE505: Robotics Final Project – Papers Review. Presented By: Tao Gan Advisor: Dr. Venkat Krovi. Main Topic: Nonholonomic-Wheel Mobile Robot (WMR). Sub-Topics:
The City College of New York 1 Dr. Jizhong Xiao Department of Electrical Engineering City College of New York Inverse Kinematics Jacobian.
CSCE 441: Computer Graphics Forward/Inverse kinematics Jinxiang Chai.
Review: Differential Kinematics
Chapter 7: Trajectory Generation Faculty of Engineering - Mechanical Engineering Department ROBOTICS Outline: 1.
Introduction to Motion Planning
ROBOT VISION LABORATORY 김 형 석 Robot Applications-B
Outline: Introduction Solvability Manipulator subspace when n<6
Non-Holonomic Motion Planning. Probabilistic Roadmaps What if omnidirectional motion in C-space is not permitted?
NUS CS5247 Dynamically-stable Motion Planning for Humanoid Robots Presenter Shen zhong Guan Feng 07/11/2003.
Laboratory of mechatronics and robotics Institute of solid mechanics, mechatronics and biomechanics, BUT & Institute of Thermomechanics, CAS Mechatronics,
Trajectory Generation
City College of New York 1 John (Jizhong) Xiao Department of Electrical Engineering City College of New York Mobile Robot Control G3300:
Randomized Kinodynamics Planning Steven M. LaVelle and James J
CSCE 441: Computer Graphics Forward/Inverse kinematics Jinxiang Chai.
Department of Computer Science Columbia University rax Dynamically-Stable Motion Planning for Humanoid Robots Paper Presentation James J. Kuffner,
Singularity-Robust Task Priority Redundancy Resolution for Real-time Kinematic Control of Robot Manipulators Stefano Chiaverini.
CSCE 441: Computer Graphics Forward/Inverse kinematics
Trajectory Generation
Yueshi Shen Dept. of Information Engineering
Zaid H. Rashid Supervisor Dr. Hassan M. Alwan
Special English for Industrial Robot
Locomotion of Wheeled Robots
Non-Holonomic Motion Planning
CSCE 441: Computer Graphics Forward/Inverse kinematics
Outline: Introduction Solvability Manipulator subspace when n<6
Special English for Industrial Robot
Chapter 4 . Trajectory planning and Inverse kinematics
Chapter 3. Kinematic analysis
Presentation transcript:

Collision-Free Trajectory Planning for a 3-DOF Robot with a Passive Joint Paper by Kevin M.Lynch, Naoji Shiroma, Hirohiko Arai, and Kazuo Tanie Jinwhan Kim Gregory Kron

Introduction A lot of research so far has focused on the design and control of underactuated manipulators in free space This research focuses on Fast collision-free trajectory planning among obstacles for a planar 3-DOF underactuated manipulator

Overview : Nonholonomic system Nonholonomic systems typically arise in the following classes of systems 1. No-slip constraint : mobile robots, any systems with pure rolling condition Conservation of angular momentum : free floating multibody systems Underactuated mechanical systems : most types of vehicles, actuators with passive joints  Second-order nonholonomic constraints

Manipulator Dynamic Equations The third joint is a passive joint.

Manipulator Dynamic Equations (cont.) Equations of motion for the third link in Cartesian coordinates Second-order nonholonomic constraint

Nonholonomic Constraints Constraint equations in “Configuration Space(Rn)” The constraints above are said to be second-order nonholonomic if the constraints are not integrable. Representation in “State Space(R2n)” This looks pretty familiar!

State-space representation N second-order differential equations 2N first-order differential equations

Controllability of the Robot Proposition 1 “If there exists a free trajectory from (Θ0T,0T)T to (Θ1T,0T)T and for the fully actuated robot, then there exists a free trajectory from (Θ0T,0T)T to (Θ1T,0T)T for the robot with a passive third joint.” This follows directly from small-time local controllability. (Small-time) local controllability For any state (ΘT,0T)T and any neighborhood W of (ΘT,0T)T, (ΘT,0T)T is interior to the set of states reachable by trajectories remaining in W.

Controllability Rank Condition Lie bracket Two vector fields and four Lie bracket terms span the six-dimensional state-space.

(Small-time) Local Controllability The third link of the robot is small-time locally controllable at all robot configurations Θ ∈Cfree. Small-time local controllability of the third link directly implies small-time local controllability of the robot at all zero velocity state. Any path in Cfree can be followed arbitrary closely, but arbitrary paths may make extensive use of Lie bracket motions, resulting in slow execution times.

Where we are... Small-time local controllable robot We want a collision-free trajectory planner Computationally efficient and quick trajectories use of Lie brackets -> going back to zero velocity

Example

Algorithm initialize T, OPEN with link start configuration xinit while OPEN not empty x <- first in OPEN, remove from OPEN if x is in the goal region report success if x is not near a previously occupied configuration mark x occupied for each of +v1, -v1, +v2, -v2 integrate forward a time dt to xnew calculate by inverse kinematics if path to is collision-free make xnew a successor to x in T compute cost of path to new config xnew place xnew in OPEN, sorted by cost report failure

Ideas of the trajectory planner Trajectory planning in the six-dimensional state space can be decoupled into path planning in the three-dimensional configuration space followed by time-optimal time scaling of the path If the path planner is complete, then a trajectory will be found for any two configurations in the same connected component of Cfree The paths found by the kinematic motion planner can be executed at high speeds

Decoupling Motions Time scaling on a trajectory q(s(t)) Equilibrium controllability Second-order nonholonomic constraints Time scaling on a trajectory q(s(t)) v(q) velocity vector

Analysis Collision detection Parameters Complexity: O(mnc3) at each new configuration Parameters integration step dt grid resolution (c discretizations) Complexity: O(mnc3) Approximate solution (1/c3)

Time scaling Compute the acceleration that yields minimal-time execution deciding when to start decelerating...

Result

Thanks Microsoft for multi-format support Result (video) Thanks Microsoft for multi-format support

Conclusion Existence of a free trajectory between two zero velo- city states in the same connected component of Cfree Motion planning can be decoupled into path planning and time scaling Path planner complete for dt sufficiently small Minimizes the number of zero-speed times Actually works!