Providing Haptic ‘Hints’ to Automatic Motion Planners Providing Haptic ‘Hints’ to Automatic Motion Planners Burchan Bayazit Joint Work With Nancy Amato.

Slides:



Advertisements
Similar presentations
1 Motion and Manipulation Configuration Space. Outline Motion Planning Configuration Space and Free Space Free Space Structure and Complexity.
Advertisements

Complete Motion Planning
Motion Planning for Point Robots CS 659 Kris Hauser.
NUS CS5247 Motion Planning for Camera Movements in Virtual Environments By Dennis Nieuwenhuisen and Mark H. Overmars In Proc. IEEE Int. Conf. on Robotics.
By Lydia E. Kavraki, Petr Svestka, Jean-Claude Latombe, Mark H. Overmars Emre Dirican
Sampling Strategies for PRMs modified from slides of T.V.N. Sri Ram.
Better Group Behaviors in Complex Environments using Global Roadmaps O. Burchan Bayazit, Jyh-Ming Lien and Nancy M. Amato Presented by Mohammad Irfan Rafiq.
Probabilistic Roadmap Methods (PRMs)
DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.
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,
Sampling and Connection Strategies for PRM Planners Jean-Claude Latombe Computer Science Department Stanford University.
1 Last lecture  Configuration Space Free-Space and C-Space Obstacles Minkowski Sums.
Nearest Neighborhood Search in Motion Planning Lakshmi Reddy B Advisor: Nancy M. Amato Parasol lab Department of Computer Science Texas A&M University.
Presented by David Stavens. Manipulation Planning Before: Want to move the robot from one configuration to another, around obstacles. Now: Want to robot.
Motion Planning. Basic Topology Definitions  Open set / closed set  Boundary point / interior point / closure  Continuous function  Parametric curve.
1 Single Robot Motion Planning - II Liang-Jun Zhang COMP Sep 24, 2008.
Interactive Navigation in Complex Environments Using Path Planning Salomon et al.(2003) University of North Carolina Prepared By Xiaoshan Pan.
Tracking a moving object with real-time obstacle avoidance Chung-Hao Chen, Chang Cheng, David Page, Andreas Koschan and Mongi Abidi Imaging, Robotics and.
Planning Paths for Elastic Objects Under Manipulation Constraints Florent Lamiraux Lydia E. Kavraki Rice University Presented by: Michael Adams.
Using Motion Planning to Study Ligand Binding and Protein Folding Nancy Amato,Guang Song and Burchan Bayazit Department of Computer Science Texas A&M University.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Dongkyu, Choi.
Interactive Mesh Sculpting Using a Haptic Device.
Interactive Navigation in Complex Environments Using Path Planning Salomon et al.(2003) University of North Carolina Presented by Mohammed Irfan Rafiq.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2004/index.htm Collision Detection and Distance Computation.
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,
A General Framework for Sampling on the Medial Axis of the Free Space Jyh-Ming Lien, Shawna Thomas, Nancy Amato {neilien,
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Configuration Space – Basic Path-Planning Methods.
CS 326A: Motion Planning Basic Motion Planning for a Point Robot.
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.
RNA Folding Kinetics Bonnie Kirkpatrick Dr. Nancy Amato, Faculty Advisor Guang Song, Graduate Student Advisor.
The University of North Carolina at CHAPEL HILL A Simple Path Non-Existence Algorithm using C-obstacle Query Liang-Jun Zhang.
CS 326 A: Motion Planning Collision Detection and Distance Computation.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Chris Allocco.
1 Single Robot Motion Planning Liang-Jun Zhang COMP Sep 22, 2008.
Providing Haptic ‘Hints’ to Automatic Motion Planners Providing Haptic ‘Hints’ to Automatic Motion Planners Burchan Bayazit Joint Work With Nancy Amato.
Providing Haptic ‘Hints’ to Automatic Motion Planners Providing Haptic ‘Hints’ to Automatic Motion Planners by Burchan Bayazit Department of Computer Science.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Lydia E. Kavraki Petr Švetka Jean-Claude Latombe Mark H. Overmars Presented.
A Randomized Approach to Robot Path Planning Based on Lazy Evaluation Robert Bohlin, Lydia E. Kavraki (2001) Presented by: Robbie Paolini.
Introduction Tracking the corners Camera model and collision detection Keyframes Path Correction Controlling the entire path of a virtual camera In computer.
Parallelism and Robotics: The Perfect Marriage By R.Theron,F.J.Blanco,B.Curto,V.Moreno and F.J.Garcia University of Salamanca,Spain Rejitha Anand CMPS.
© Manfred Huber Autonomous Robots Robot Path Planning.
Robotics Chapter 5 – Path and Trajectory Planning
Path Planning for a Point Robot
Introduction to Robot Motion Planning Robotics meet Computer Science.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
October 9, 2003Lecture 11: Motion Planning Motion Planning Piotr Indyk.
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
Aimée Vargas, Jyh-Ming Lien, Marco Morales and Nancy M. Amato Algorithms & Applications Group Parasol Lab, Dept. of Computer Science, Texas A&M University.
Introduction to Motion Planning
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
Configuration Spaces for Translating Robots Minkowsi Sum/Difference David Johnson.
Robotics Chapter 5 – Path and Trajectory Planning
Optimal Path Planning Using the Minimum-Time Criterion by James Bobrow Guha Jayachandran April 29, 2002.
Randomized Kinodynamics Planning Steven M. LaVelle and James J
Planning Tracking Motions for an Intelligent Virtual Camera Tsai-Yen Li & Tzong-Hann Yu Presented by Chris Varma May 22, 2002.
Department of Computer Science Columbia University rax Dynamically-Stable Motion Planning for Humanoid Robots Paper Presentation James J. Kuffner,
Autonomous Robots Robot Path Planning (2) © Manfred Huber 2008.
Beth Tsai Jennifer E. Walter Nancy M. Amato Department of Computer Science Texas A&M University, College Station Distributed Reconfiguration of Metamorphic.
Real-Time Configuration Space Transforms for Obstacle Avoidance Wyatt S. Newman and Michael S. Branicky.
Finding Critical Changes in Dynamic Configuration Spaces Yanyan Lu and Jyh-Ming Lien George Mason University.
9/30/20161 Path Planning Cognitive Robotics David S. Touretzky & Ethan Tira-Thompson Carnegie Mellon Spring 2012.
Optimization Of Robot Motion Planning Using Genetic Algorithm
CS 326A: Motion Planning Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe,
Mathematics & Path Planning for Autonomous Mobile Robots
Sampling and Connection Strategies for Probabilistic Roadmaps
Chapter 4 . Trajectory planning and Inverse kinematics
Robotics meet Computer Science
Classic Motion Planning Methods
Presentation transcript:

Providing Haptic ‘Hints’ to Automatic Motion Planners Providing Haptic ‘Hints’ to Automatic Motion Planners Burchan Bayazit Joint Work With Nancy Amato and Guang Song Burchan Bayazit Joint Work With Nancy Amato and Guang Song Department of Computer Science Texas A&M University

Motion Planning GIVEN: an environment and start and goal positions FIND: a path from start to goal which avoids collision with obstacles GIVEN: an environment and start and goal positions FIND: a path from start to goal which avoids collision with obstacles fit elbow through holefind part removal pathAlpha Puzzle - separate tubesDrug Design (docking) Automatic planners are good, but sometimes can’t find critical configurations obvious to the user

Planner creates initial roadmap User collects critical configurations/paths ( may have collisions to make task easier,i.e., approximate path ) –a haptic device is ideal for this Planner improves roadmap with user’s collection –i.e, planner fixes approximate path Hybrid Human/Planner System (Enhancing PRMs with Haptic Hints)

Outline Roadmap Visualization Haptic Interaction: Collecting Paths Processing User-Generated Paths Results Conclusion Roadmap Visualization Haptic Interaction: Collecting Paths Processing User-Generated Paths Results Conclusion

Roadmap Visualization and Sensing Problem: need to show the planner’s progress (in C-space) to the user (in workspace) Displaying paths/roadmaps Feeling paths/roadmaps (future work) Problem: need to show the planner’s progress (in C-space) to the user (in workspace) Displaying paths/roadmaps Feeling paths/roadmaps (future work)

Roadmap Visualization Roadmap nodes are represented as translations in workspace (reference point can be center of mass, end effector position etc.) Roadmap edges are the lines connecting the workspace representations Different components have different colors Small robots helps to visualize current configuration at each point

Displaying Roadmap Edges and Configurations Each connected component is shown in a different color

PHANToM User attaches haptic device to robot, and moves it around user feels when robot touches obstacles and adjusts trajectory collision detection too slow (~10 Hz), so distribute process and use extrapolation techniques (almost all) Robot configurations passed to planner automatically sampled at regular intervals Haptic Interaction: Collecting Paths

Proposed System

Applying Force

Ideal Algorithm for Force Feedback Robot Position Haptic Loop Calculate Force return Force Based on penetration distance no force some force more force

PROBLEM: Penetration not available for complex environments SOLUTION: If robot in collision, push outside with constant force –user can select full, half, or zero (collision off) force PROBLEM: Penetration not available for complex environments SOLUTION: If robot in collision, push outside with constant force –user can select full, half, or zero (collision off) force Calculating Reactive Force no forcesame force

Collision Detection PROBLEM: –too slow and highly variable (~ 10 Hz SGI O2) SOLUTION: –distributed system (computations on another computer) –use heuristic to determine when collision occurs PROBLEM: –too slow and highly variable (~ 10 Hz SGI O2) SOLUTION: –distributed system (computations on another computer) –use heuristic to determine when collision occurs

Calculate Collision Computation Loop Heuristically decide collision Heuristically decide collision Robot Position Get result Haptic Loop Yes No Previous result ready? Collision ? Yes No Return No ForceReturn Constant Force Request new calculation Request new calculation

P P LF last free cfg (computed) minimum distance (md) P P LF md current distance (cd) if projection of cd > md then collision else free When last computed configuration was free

P P LF LC last colliding cfg (computed) P P P LF LC P collision distance (xd) current distance (cd) if projection of cd > xd then collision else free When last computed configuration was colliding current cfg last free cfg (computed)

Processing User-Generated Paths User generates approximate path P –it may contain collisions Planner “pushes” colliding portions of P to C-free –techniques inspired by OBPRM ideal for this C-obstacle pushed path generated by planner approximate path generated by user

Push Towards Line Segment C-obstacle

Push Toward the Closest Surface cfg C-obstacle

Push in Workspace (using vertices) Workspace Obstacle Robot d4 d1d3 d2 Pair each vertex of robot with workspace obstacle Move in the closest direction Pair each vertex of robot with workspace obstacle Move in the closest direction

Iterative Pushing Original Problem Simplify Initial Solution Haptic/OBPRM Initial Solution Haptic/OBPRM Push Increase Accuracy Return Path Solved Original Problem? Solved Original Problem? No Yes Approximate Path Original Problem Simplify Initial Solution Haptic/OBPRM Initial Solution Haptic/OBPRM Increase Accuracy` Solved Original Problem? Solved Original Problem? No Push Increase Accuracy Push Yes Solved Original Problem? Solved Original Problem? Return Path

Original C-SpaceC-Space after dilation Difficulty: Topology can change Dilated C-Space Previous researchers have recognized potential of working in dilated space (Hsu, et.al., WAFR’98) Advantage of our method: For some problems, user insight narrows search to promising directions.

Dilation Methods Change Penetration Depth Change Scale of the Robot

Haptic Hints: Flange Example Step 1: User collected pathStep 2: Pushed configs (planner) Final path (planner)

Haptic Hints: Results Flange Problem

Conclusion Heuristic collision detection provides support for approximate path collection –ok since we’re collecting approximate paths Automatic planners can effectively transform approximate paths to free paths –faster than fully automatic –iterative transformation works well (in some cases) Roadmap visualization is useful Heuristic collision detection provides support for approximate path collection –ok since we’re collecting approximate paths Automatic planners can effectively transform approximate paths to free paths –faster than fully automatic –iterative transformation works well (in some cases) Roadmap visualization is useful