Humanoid Motion Planning

Slides:



Advertisements
Similar presentations
Solving problems by searching
Advertisements

Rapidly Exploring Random Trees Data structure/algorithm to facilitate path planning Developed by Steven M. La Valle (1998) Originally designed to handle.
Kinematic Synthesis of Robotic Manipulators from Task Descriptions June 2003 By: Tarek Sobh, Daniel Toundykov.
Motion Planning for Point Robots CS 659 Kris Hauser.
Introduction University of Bridgeport 1 Introduction to ROBOTICS.
Forward and Inverse Kinematics CSE 3541 Matt Boggus.
4/15/2017 Using Gaussian Process Regression for Efficient Motion Planning in Environments with Deformable Objects Barbara Frank, Cyrill Stachniss, Nichola.
Iterative Relaxation of Constraints (IRC) Can’t solve originalCan solve relaxed PRMs sample randomly but… start goal C-obst difficult to sample points.
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,
CSCE 641: Forward kinematics and inverse kinematics Jinxiang Chai.
1Notes  Handing assignment 0 back (at the front of the room)  Read the newsgroup!  Planning to put 16mm films on the web soon (possibly tomorrow)
Motion Planning of Multi-Limbed Robots Subject to Equilibrium Constraints. Timothy Bretl Presented by Patrick Mihelich and Salik Syed.
CSCE 641: Forward kinematics and inverse kinematics Jinxiang Chai.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Dongkyu, Choi.
Kinodynamic Planning Using Probabalistic Road Maps Steven M. LaValle James J. Kuffner, Jr. Presented by Petter Frykman.
Advanced Computer Graphics (Fall 2010) CS 283, Lecture 20: Inverse Kinematics Ravi Ramamoorthi Most slides courtesy.
Planning for Humanoid Robots Presented by Irena Pashchenko CS326a, Winter 2004.
Presented By: Huy Nguyen Kevin Hufford
RRT-Connect path solving J.J. Kuffner and S.M. LaValle.
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,
CSCE 689: Forward Kinematics and Inverse Kinematics
Robot Motion Planning Bug 2 Probabilistic Roadmaps Bug 2 Probabilistic Roadmaps.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
Integrated Grasp and Motion Planning For grasping an object in a cluttered environment several tasks need to take place: 1.Finding a collision free path.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Chris Allocco.
Advanced Graphics (and Animation) Spring 2002
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Kinematic Linkages.
Constraints-based Motion Planning for an Automatic, Flexible Laser Scanning Robotized Platform Th. Borangiu, A. Dogar, A. Dumitrache University Politehnica.
Inverse Kinematics.
Inverse Kinematics.
Simulation and Animation
Robotics Chapter 5 – Path and Trajectory Planning
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
CSCE 441: Computer Graphics Forward/Inverse kinematics Jinxiang Chai.
Inverting the Jacobian and Manipulability
Robot Kinematics: Position Analysis 2.1 INTRODUCTION  Forward Kinematics: to determine where the robot ’ s hand is? (If all joint variables are known)
Introduction to Motion Planning
Kinematic Redundancy A manipulator may have more DOFs than are necessary to control a desired variable What do you do w/ the extra DOFs? However, even.
1cs426-winter-2008 Notes  Will add references to splines on web page.
ROBOT VISION LABORATORY 김 형 석 Robot Applications-B
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,
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Rapidly-exploring.
Randomized Kinodynamics Planning Steven M. LaVelle and James J
Autonomous Robots Robot Path Planning (3) © Manfred Huber 2008.
Rick Parent - CIS681 Reaching and Grasping Reaching control synthetic human arm to reach for object or position in space while possibly avoiding obstacles.
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,
Casne.ncl.ac.uk Taking care of the CrumbleBot Please do NOT stress the robot's motors 1.Do NOT push the robot 2.Do NOT hold the.
Randomized KinoDynamic Planning Steven LaValle James Kuffner.
Numerical Methods for Inverse Kinematics Kris Hauser ECE 383 / ME 442.
Toward humanoid manipulation in human-centered environments T. Asfour, P. Azad, N. Vahrenkamp, K. Regenstein, A. Bierbaum, K. Welke, J. Schroder, R. Dillmann.
Fundamentals of Computer Animation
9/30/20161 Path Planning Cognitive Robotics David S. Touretzky & Ethan Tira-Thompson Carnegie Mellon Spring 2012.
CSCE 441: Computer Graphics Forward/Inverse kinematics
Instructor Prof. Shih-Chung Kang 2008 Spring
Character Animation Forward and Inverse Kinematics
INVERSE MANIPULATOR KINEMATICS
CS 326A: Motion Planning Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe,
On Multi-Arm Manipulation Planning
EE631 Cooperating Autonomous Mobile Robots Lecture: Collision Avoidance in Dynamic Environments Prof. Yi Guo ECE Dept.
Robust Belief-based Execution of Manipulation Programs
Bowei Tang, Tianyu Chen, and Christopher Atkeson
CSCE 441: Computer Graphics Forward/Inverse kinematics
Path Planning using Ant Colony Optimisation
Dimitris Valeris Thijs Ratsma
Humanoid Motion Planning for Dual-Arm Manipulation and Re-Grasping Tasks Nikolaus Vahrenkamp, Dmitry Berenson, Tamim Asfour, James Kuffner, Rudiger Dillmann.
Chapter 4 . Trajectory planning and Inverse kinematics
Stefan Oßwald, Philipp Karkowski, Maren Bennewitz
Robotics meet Computer Science
Presentation transcript:

Humanoid Motion Planning Dual-Arm Manipulation and Re-Grasping Tasks Nikolaus Vahrenkamp Dmitry Berenson Tamim Asfour James Kuffner Rudiger Dillmann Vivian Shen COMS 6731

Motion Planning: Dual-Arm Outline Single Arm IK Solver Dual-Arm IK Solver Motion Planning: Single Arm Reaching Motion Planning: Dual-Arm re-grasping Reachability with two arms makes everyday tasks (loading dishwasher) much easier.

Predefined Grasping Positions Presets Need collision-free trajectory with reaching/re-grasping motion. Requires feasible grasping pose wrt object - objects can have predefined possible grasping poses. In this case, object = wok Predefined Grasping Positions

The Robot ARMAR III 7 DoF arms, 3 DoF hip

Reach and Grasp Fixed Object with One Hand Single Arm IK Solver Reach and Grasp Fixed Object with One Hand Reach and grasp fixed obj with one hand, solve IK problem Operational space for ARMAR-III = 3 hip joints + 7 DoF of arm

Randomized IK Solver All possible elbow positions pre-computed, best one chosen (if multiple best ones, one with the least joint movement or a random solution chosen). 3-DoF Hip randomly sampled until IK succesfully answered. If time goes to infinity, solution = prob of 1 if it exists. Avoid endless runtime by stopped after specific # of tries and assumes to valid result

Reachability Space & Gradient Descent Left arm (7 DoF) 2D representation Gradient Descent Optimization Hip-yaw joint (1 DoF) Figures out what is reachable in 6D pose space w/ 5D grid of voxels. Quickly decide if target pose too far from reachable configs (IK solver unlikely to return solution). Two ways generating: Solve large # IK reqs, count # successful queries for each voxel Random sample joint vals, use fwd kinematix to find pose of EE and therefore 6D voxel Target pose transformed to shoulder coordinate sys & corresponding voxel returned. IK solver called if voxel > 0 Left pic: 2D rep of reachability of left end vector considering 8 DoF-kinematic chain covering hip-yaw joint & left arm. Furthur speedup: Gradient descent If bject pose where corres. reachability space entry lies above threshole, look for local maximum (check neighbor voxles). If voxel w/ higher reach. Space, move toward voxel w/ corresp. dimension of voxel. Repeated until @ local max (no more higher entries) These extensions only applied w/ some probability, so won’t affect probabilistically complete original algo.

10 DoF IK Solver for Armar-III Wok set to random pose in front of robot. IK solvers w/ and w/o reachability space called to find valid config for bring EE to one of the 15 pre-computed grasping poses. Example result in partly blocked scheme. 3 hip + 7 arm joint

10 DoF IK Solver for Armar-III Without Obstacle With Obstacle Avg Runtime # IK Calls Without Reach. Space 1,404 ms 101.92 2,880 ms 217.3 With Reach. Space 60 ms 6.1 144 ms 13.6 Wok set to random pose in front of robot. IK solvers w/ and w/o reachability space called to find valid config for bring EE to one of the 15 pre-computed grasping poses. Example result in partly blocked scheme.

Position of Both Arms Without Collision Dual-Arm IK Solver Position of Both Arms Without Collision Re-grasp config = collision free object pose + valid/collision free IK-solution for both arms. IK problem combining 6D obj pose, 3 hip joints, 7 DoF for each arm ---> 23 dim solution vector.

Random Sampling Can sample 6D pose of robot or 3 hip joints randomly until IK solver successful for one of them. Cartesian position limited to reachable space and rotation component has no restrictions

Reachability Space & Results Without Obstacle With Obstacle Avg Runtime # IK Calls Flexible grasp selection 1,404 ms 101.92 2,880 ms 217.3 Obj grasped in left hand 60 ms 6.1 144 ms 13.6 Analytical 7-DoF IK solvers only called if IK-prob of >=1 left and >=1 right grasping pose in reachability space is above threshold. If IK-prob set high enough, costly IK solver will succeed, has valid pose. Flex grasp = 23 dims, grasped in 1 hand = 17 dims.

Motion Planning for Single Arm Reaching Motions Collision Free Motion with One Planning Scheme Proposed planning algos combine search for collision free motion w/ search for soln’s of IK problem in one planning scheme.

Planning Scheme for Single Arm Motions Pgrasp: feasible grasping pose Pgrasp = Tk(Obj_pose) Grasping pose defined wrt pose of target obj, derived by applying transformation Tk on object pose. Set of feasible grasps for each object, with info abt transformations b/w EE and final grasp pos, type of grasp, pre-pos of end-effector, & other grasp quality descriptions. U can pre-calculate IK solutions for each pose of each grasp in database, use as targets for palnning process. Leads to planning scheme w/ limited search, planner could fail. Also time-consuming to pre-calculate. Following is two algorithms that determine IK solution while planning. Input = grasp set, output = joint-space trajectory to reach object.

Jacobian Pseudoinverse-Based RRT (J+ RRT) Avoid explicit search for IK by directing RRT towards goal pose -> transposed jacobian used to generate C-space steps out of task space goal direction (no bi-RRT cuz no explicit c-space target configuration) Useful when no IK solver or only grasping pose. Multiple task space goals = feasible grasps Qstart = start config, pobj = pose of object, gc = set of feasible grasps RRT builds tree of reachable + collision-free configs. New config added to tree w/ corres. Pose of hand ExtendToGoal called w/ some probability. Biases extension to random grasp

J+ RRT Red = generated with ExtendToGoal Blue = solution Green = optimized solution Found by standard path pruning Search focused on grasping objects Joint limits or collisions b/w hand and object also prevent generation of valid soluiton

IK-RRT IK solver used to generate goal pos during planning. Input = set of feasible grasps + pose of objects = set of target poses. bi-RRT w/ forward initialized as start config, backward nothing until soln found Planning loop grows 2 trees (bi-RRT), tries to connect them w/ some prob, random grasp chosen add po

IK RRT Red = generated with ExtendToGoal Blue = solution Green = optimized solution Found by standard path pruning Search tree much smaller because of bi-directional approach of the RTT

Motion Planning for Dual-Arm Re-Grasping Collision Free Handing Off Object and Second Hand Grasping Configuration Two problems: Config for handing off object from one hand to other – bring object to pos for other hand to grasp, and choosing grasp of 2nd hand Collision-free trajectory to move both arms

Dual-Arm J+ RRT Target implicitly defined by set of grasps (instead of fixed obj pose & set of grasps) Need transformation b/w two hands Instead of moving 1 arm to fixed goal, move both towards each other New extendtogoal: selects random grasp & config w/ smallest dist b/w two end-effector poses, tries to move both arms towards a re-grasping pose. Alternately move arms toward corresp. goal poses in task space. Jacobian pseudoinverse calc-ed for every step -> sample configs generated Sample ^ tested for collision/violations of joint limits, added to RRt. if re-grasping pose reached, soln found, otherwise chosen RRT nodes excluded from further steps.

Dual-Arm J+ RRT Target implicitly defined by set of grasps (instead of fixed obj pose & set of grasps) Need transformation b/w two hands Instead of moving 1 arm to fixed goal, move both towards each other New extendtogoal: selects random grasp & config w/ smallest dist b/w two end-effector poses, tries to move both arms towards a re-grasping pose. Alternately move arms toward corresp. goal poses in task space. Jacobian pseudoinverse calc-ed for every step -> sample configs generated Sample ^ tested for collision/violations of joint limits, added to RRt. if re-grasping pose reached, soln found, otherwise chosen RRT nodes excluded from further steps.

Dual-Arm J+ RRT

Dual-Arm IK RRT IK solver methods for 1 arm can be used to generate dual arm poses. Solution = valid pose of obj + corresp joint config of hip and both arms for grasping with both hands. Instead of predefined obj pose, obj attached to kinematic struct of 1 arm, IK solver operates on set of feasible grasp.

Results and Conclusions

COMS 6731 Nikolaus Vahrenkamp Dmitry Berenson Tamim Asfour Humanoid Motion Planning for Dual-Arm Manipulation and Re-Grasping Tasks Nikolaus Vahrenkamp Dmitry Berenson Tamim Asfour James Kuffner Rudiger Dillmann Vivian Shen

Thank You!