Motion Planning for Robotic Manipulation of Deformable Linear Objects (DLOs) Mitul Saha and Pekka Isto Research supported by NSF Artificial Intelligence.

Slides:



Advertisements
Similar presentations
J. P. L a u m o n d L A A S – C N R S M a n i p u l a t i o n P l a n n i n g A Geometrical Formulation.
Advertisements

Complete Motion Planning
Motion Planning for Point Robots CS 659 Kris Hauser.
Department of Computer Science, Iowa State University Robot Grasping of Deformable Objects Yan-Bin Jia (joint work with Ph.D. students Feng Guo and Huan.
4/15/2017 Using Gaussian Process Regression for Efficient Motion Planning in Environments with Deformable Objects Barbara Frank, Cyrill Stachniss, Nichola.
Interactive Inverse 3D Modeling James Andrews Hailin Jin Carlo Séquin.
DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.
Randomized Kinodynamics Motion Planning with Moving Obstacles David Hsu, Robert Kindel, Jean-Claude Latombe, Stephen Rock.
Jur van den Berg, Stephen J. Guy, Ming Lin, Dinesh Manocha University of North Carolina at Chapel Hill Optimal Reciprocal Collision Avoidance (ORCA)
EE631 Cooperating Autonomous Mobile Robots Lecture 5: Collision Avoidance in Dynamic Environments Prof. Yi Guo ECE Dept.
Presented by David Stavens. Manipulation Planning Before: Want to move the robot from one configuration to another, around obstacles. Now: Want to robot.
Challenges Bayesian Estimation for Autonomous Object Manipulation Based on Tactile Perception Anna Petrovskaya, Oussama Khatib, Sebastian Thrun, Andrew.
Multi-Arm Manipulation Planning (1994) Yoshihito Koga Jean-Claude Latombe.
Motion Planning: A Journey of Robots, Digital Actors, Molecules and Other Artifacts Jean-Claude Latombe Computer Science Department Stanford University.
1 Single Robot Motion Planning - II Liang-Jun Zhang COMP Sep 24, 2008.
Planning Motions with Intentions By Chris Montgomery A presentation on the paper Planning Motions with Intentions written by Yoshihito Koga, Koichi Kondo,
Planning Paths for Elastic Objects Under Manipulation Constraints Florent Lamiraux Lydia E. Kavraki Rice University Presented by: Michael Adams.
CS 326A: Motion Planning Jean-Claude Latombe CA: Aditya Mandayam.
1 Finding “Narrow Passages” with Probabilistic Roadmaps: The Small-Step Retraction Method Mitul Saha and Jean-Claude Latombe Research supported by NSF,
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Jean-Claude Latombe Computer Science Department Stanford University.
CS 326 A: Motion Planning Instructor: Jean-Claude Latombe Teaching Assistant: Itay Lotan Computer Science.
Knot Tying with Single Piece Fixtures Matthew Bell & Devin Balkcom Dartmouth College.
Exact Collision Checking of Robot Paths Fabian Schwarzer Mitul Saha Jean-Claude Latombe Computer Science Department Stanford University.
CS 326 A: Motion Planning Manipulation Planning.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2004/index.htm Collision Detection and Distance Computation.
7. Experiments 6. Theoretical Guarantees Let the local policy improvement algorithm be policy gradient. Notes: These assumptions are insufficient to give.
BINARY MORPHOLOGY and APPLICATIONS IN ROBOTICS. Applications of Minkowski Sum 1.Minkowski addition plays a central role in mathematical morphology 2.It.
CS 326A: Motion Planning Kynodynamic Planning + Dealing with Moving Obstacles + Dealing with Uncertainty + Dealing with Real-Time Issues.
CS 326A: Motion Planning robotics.stanford.edu/~latombe/cs326/2004/index.htm Jean-Claude Latombe Computer Science Department Stanford University.
Mobile Robotics: 10. Kinematics 1
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Constraint-Based Motion Planning using Voronoi Diagrams Maxim Garber and Ming C. Lin Department of Computer.
Motion Planning for Robotic Manipulation of Deformable Linear Objects (DLOs) Mitul Saha, Pekka Isto, and Jean-Claude Latombe Research supported by NSF,
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Lydia E. Kavraki Petr Švetka Jean-Claude Latombe Mark H. Overmars Presented.
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Definition of an Industrial Robot
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.
Advanced Programming for 3D Applications CE Bob Hobbs Staffordshire university Human Motion Lecture 3.
© Manfred Huber Autonomous Robots Robot Path Planning.
Richard Patrick Samples Ph.D. Student, ECE Department 1.
CSCE 5013 Computer Vision Fall 2011 Prof. John Gauch
Robotics Chapter 5 – Path and Trajectory Planning
Combined Task and Motion Planning for Mobile Manipulation Jason Wolfe, etc. University of California, Berkeley Mozi Song INFOTECH 1.
ROBOTICS BY: HUSSAIN MURAD. WHAT IS THE FIRST THING YOU THINK OF WHEN YOU THINK OF A ROBOT? When I think of robots, the first thing that pops into mind.
Boundary Assertion in Behavior-Based Robotics Stephen Cohorn - Dept. of Math, Physics & Engineering, Tarleton State University Mentor: Dr. Mircea Agapie.
Richard Kelley Motion Planning on a GPU. Last Time Nvidia’s white paper Productive discussion.
Bringing Clothing into Desired Configurations with Limited Perception Joseph Xu.
University of Windsor School of Computer Science Topics in Artificial Intelligence Fall 2008 Sept 11, 2008.
Autonomous Soil Investigator. What Is the ASI? Designed to complete the 2013 IEEE student robotics challenge Collects "soil" samples from a simulated.
Learning to Navigate Through Crowded Environments Peter Henry 1, Christian Vollmer 2, Brian Ferris 1, Dieter Fox 1 Tuesday, May 4, University of.
Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
Real-time motion planning for Manipulator based on Configuration Space Chen Keming Cis Peking University.
DOE Network PI Meeting 2005 Runtime Data Management for Data-Intensive Scientific Applications Xiaosong Ma NC State University Joint Faculty: Oak Ridge.
Interactive Continuous Collision Detection for Polygon Soups Xin Huang 11/20/2007.
Robot Intelligence Technology Lab. 10. Complex Hardware Morphologies: Walking Machines Presented by In-Won Park
Robot Vision SS 2009 Matthias Rüther ROBOT VISION 2VO 1KU Matthias Rüther.
Shape2Pose: Human Centric Shape Analysis CMPT888 Vladimir G. Kim Siddhartha Chaudhuri Leonidas Guibas Thomas Funkhouser Stanford University Princeton University.
Basic Autonomous Capabilities O. Khatib et al. Presented by Andrew Lewis.
Optimal Acceleration and Braking Sequences for Vehicles in the Presence of Moving Obstacles Jeff Johnson, Kris Hauser School of Informatics and Computing.
You can check broken videos in this slide here :
EE631 Cooperating Autonomous Mobile Robots Lecture: Collision Avoidance in Dynamic Environments Prof. Yi Guo ECE Dept.
Artificial Intelligence Lab
Robust Belief-based Execution of Manipulation Programs
Sampling and Connection Strategies for Probabilistic Roadmaps
Bringing Clothing into Desired Configurations with Limited Perception
Chapter 4 . Trajectory planning and Inverse kinematics
Knot Tying Matthew Bell & Devin Balkcom Dartmouth College.
Presentation transcript:

Motion Planning for Robotic Manipulation of Deformable Linear Objects (DLOs) Mitul Saha and Pekka Isto Research supported by NSF Artificial Intelligence Lab Stanford University Research Institute for Technology University of Vaasa, Finland

The ability to autonomously manipulate objects is one of most desirable features in a robot. Hence manipulation planning has been an active area of research for the last many decades –it is difficult to model and predict the deforming nature of deformable objects –struggle in basic motion planning There has not been much development in manipulation planning for deformable objects because Manipulation Planning Research so far… So far, manipulation planning research has mainly focused on manipulating rigid objects We have been interested in manipulation planning for deformable objects, because a large number of objects that we handle in our daily lives are deformable to some extent

The ability to autonomously manipulate objects is one of most desirable features in a robot. Hence manipulation planning has been an active area of research for the last many decades –it is difficult to model and predict the deforming nature of deformable objects –struggle in basic motion planning There has not been much development in manipulation planning for deformable objects because Manipulation Planning Research so far… So far, manipulation planning research has mainly focused on manipulating rigid objects We have been interested in manipulation planning for deformable objects, because a large number of objects that we handle in our daily lives are deformable to some extent

The ability to autonomously manipulate objects is one of most desirable features in a robot. Hence manipulation planning has been an active area of research for the last many decades –it is difficult to model and predict the deforming nature of deformable objects –struggle in basic motion planning There has not been much development in manipulation planning for deformable objects because Manipulation Planning Research so far… So far, manipulation planning research has mainly focused on manipulating rigid objects We have been interested in manipulation planning for deformable objects, because a large number of objects that we handle in our daily lives are deformable to some extent

The ability to autonomously manipulate objects is one of most desirable features in a robot. Hence manipulation planning has been an active area of research for the last many decades –it is difficult to model and predict the deforming nature of deformable objects –struggle in basic motion planning There has not been much development in manipulation planning for deformable objects because Manipulation Planning Research so far… So far, manipulation planning research has mainly focused on manipulating rigid objects We have been interested in manipulation planning for deformable objects, because a large number of objects that we handle in our daily lives are deformable to some extent

Manipulation Planning for Deformable Linear Objects (DLOs) GOAL: to develop a motion planner that would enable robots to autonomously manipulate Deformable Linear Objects (ropes, cables, sutures) in various settings. bowline knot figure-8 knot sailing knot autonomous robotic DLO manipulation knot tying in daily/recreational life laying/loading cables in industrial settings suturing in medical surgery robot dress

Manipulation Planning for Deformable Linear Objects (DLOs) The DLO manipulation problem is extremely challenging for robotics because obeing highly deformable, they can exhibit a much greater diversity of behaviors, which are hard to model and predict oidentifying topological states of DLOs is coupled with some unsolved problems in knot-theory/ mathematics Interesting Challenging The DLO manipulation problem has a nice structure. It brings together robotics, knot theory, and computational mechanics.

Previous Related Work “Planning of One-Handed Knotting/Raveling Manipulation of Linear Objects”, IEEE ICRA 2004, Wakamatsu, et. al. - knot simplified using Reidemeister moves (RM) from knot theory -one robot used to execute the RMs -assumes DLO resting on a plane

Previous Related Work “Planning of One-Handed Knotting/Raveling Manipulation of Linear Objects”, IEEE ICRA 2004, Wakamatsu, et. al. Our contribution: -DLO need not be in a plane -We use more than one robot in coordination -We consider collision constraints (robot-DLO, robot-obstacle) -We consider the physical behavior of the DLO while planning -We consider interaction of the DLO with other objects - knot simplified using Reidemeister moves (RM) from knot theory -one robot used to execute the RMs -assumes DLO resting on a plane

The Manipulation Problem How do we define goal configurations? available robot arms

Goal configurations are defined in terms of topology instead of exact geometry Geometrically different but topologically same: Bowline knot Defining Goal Configurations while winding, number of wounds more important

In knot theory, crossing configuration of a curve is used to characterize its topology Defining Goal Configurations planar projection of the DLO central axis

In knot theory, crossing configuration of a curve is used to characterize its topology Crossing Configuration: (C 1, C 2, C 3, C 4 ): ((1,-6) -, (-2,5) -, (3,-8) -, (-4,7) - ) crossing: local self-intersections Defining Goal Configurations C 1 : (1,-6) - C 2 : (-2,5) - C 3 : (3,-8) - C 4 : (-4,7) - sign of a crossing planar projection of the DLO central axis how to account for interactions with other objects? make them part the DLO semi-deformable linear object (sDLO)

We take as input the physical model of the DLO in the form of a state transition function f: Physical modeling of the DLO Suture model: [Brown, et al., 04] Elastic thread model: [Wang, et al., 05]Nylon thread model: [Dhanik, 05] Recent successes in computational mechanics:

Manipulation using 2 cooperating robot arms Manipulation Tools

Manipulation using 2 cooperating robot arms Use of static sliding supports (“tri-needles”) to provide structural support Manipulation Tools

Defining “Forming Sequence” Forming Sequence: C 2, C 1, C 4, C 3 Basis of our Planning Approach walk along the DLO; crossing “formed” when encountered the second time

Defining “Forming Sequence” Forming Sequence: C 2, C 1, C 4, C 3 Basis of our Planning Approach walk along the DLO; crossing “formed” when encountered the second time C2C2 C1C1 C4C4 C3C3 A DLO topology or knot can be tied, crossing-by-crossing, in the order defined by its “forming sequence”

Defining “Forming Sequence” Forming Sequence: C 2, C 1, C 4, C 3 Basis of our Planning Approach Defining “loop hierarchy” used to determine the placementof static sliding supports (“tri-needles”) walk along the DLO; crossing “formed” when encountered the second time C2C2 C1C1 C4C4 C3C3 A DLO topology or knot can be tied, crossing-by-crossing, in the order defined by its “forming sequence”

Our Manipulation Planning Algorithm -search the configuration-space using a sampling-based tree -use forming sequence to bias search -use physical model to sample new DLO shapes -use the loop hierarchy to place static sliding supports (tri-needles) search tree forbidden region

Our Manipulation Planning Algorithm -search the configuration-space using a sampling-based tree -use forming sequence to bias search -use physical model to sample new DLO shapes -use the loop hierarchy to place static sliding supports (tri-needles) search tree forbidden region grasping robot fails Robot A DLO Robot A Robot B

Our Manipulation Planning Algorithm -search the configuration-space using a sampling-based tree -use forming sequence to bias search -use physical model to sample new DLO shapes -use the loop hierarchy to place static sliding supports (tri-needles) search tree forbidden region

Our Manipulation Planning Algorithm -search the configuration-space using a sampling-based tree -use forming sequence to bias search -use physical model to sample new DLO shapes -use the loop hierarchy to place static sliding supports (tri-needles) search tree forbidden region tri-needles loop hierarchy

Results bowline knot sailing knot bow neck-tie -Planner implemented in C++ -Took minutes on a 1GB, 1GHz processor to generate manipulation plans for tying popular knots: bowline, neck-tie, bow (shoe-lace), and stunsail -Videos:

Results

neck-tie

In the real-life, we have tested the ability of the planner to generate robust plans by tying the popular Bowline knot with various household ropes on a hardware platform with two PUMA robots, using the manipulation plan generated by the planner. Results bowline knot robustness dues to tri-needles

Conclusion We have developed a motion planner for manipulating deformable linear objects (such as ropes, cables, sutures) in 3D using cooperating robots. - it can tie self-knots and knots around rigid objects - unlike in traditional motion planning, goals are topological and not geometric - we account for the physical behavior of the DLO - it is robust to imperfections in the physical model of the DLO - it is first of its kind (we not aware of any other planner for computing collision- free robot motions to manipulate a DLO in environments with obstacles) - the implemented planner has been tested both in graphic simulation and in real-life on a dual-PUMA-560 hardware platform suturing in medical surgery collaboration with General Motors Future Plans

Motion Planning for Robotic Manipulation of Deformable Linear Objects (DLOs) Acknowledgement: Advisory: Jean-Claude Latombe PUMA experiments: Oussama Khatib, Irena, Jaehueng Park, Jin Sung Physical models of ropes: Etienne Burdet, Wang Fei (EPFL) Useful comments: anonymous reviewers

- Tight knots-Semi-tight knots We focus on two types of common knots: Crossing Configuration: ((1,-6) -, (-2,5) -, (3,-8) -, (-4,7) - ) over under over

Needle Placement