Finding Narrow Passages with Probabilistic Roadmaps: The Small-Step Retraction Method Presented by: Deborah Meduna and Michael Vitus by: Saha, Latombe,

Slides:



Advertisements
Similar presentations
Rapidly Exploring Random Trees Data structure/algorithm to facilitate path planning Developed by Steven M. La Valle (1998) Originally designed to handle.
Advertisements

Complete Motion Planning
Probabilistic Roadmaps. The complexity of the robot’s free space is overwhelming.
PRM and Multi-Space Planning Problems : How to handle many motion planning queries? Jean-Claude Latombe Computer Science Department Stanford University.
Sampling Techniques for Probabilistic Roadmap Planners
By Lydia E. Kavraki, Petr Svestka, Jean-Claude Latombe, Mark H. Overmars Emre Dirican
Visibility Graphs May Shmuel Wimer Bar-Ilan Univ., Eng. Faculty Technion, EE Faculty.
Sampling Strategies for PRMs modified from slides of T.V.N. Sri Ram.
Sampling Strategies By David Johnson. Probabilistic Roadmaps (PRM) [Kavraki, Svetska, Latombe, Overmars, 1996] start configuration goal configuration.
Probabilistic Roadmap
A Comparative Study of Probabilistic Roadmap Planners Roland Geraerts Mark Overmars.
Kinodynamic Path Planning Aisha Walcott, Nathan Ickes, Stanislav Funiak October 31, 2001.
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 Kinodynamics Motion Planning with Moving Obstacles David Hsu, Robert Kindel, Jean-Claude Latombe, Stephen Rock.
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.
David Hsu, Robert Kindel, Jean- Claude Latombe, Stephen Rock Presented by: Haomiao Huang Vijay Pradeep Randomized Kinodynamic Motion Planning with Moving.
“Visibility-based Probabilistic Roadmaps for Motion Planning” Siméon, Laumond, Nissoux Presentation by: Mathieu Bredif CS326A: Paper Review Winter 2004.
Sampling Strategies for Narrow Passages Presented by Rahul Biswas April 21, 2003 CS326A: Motion Planning.
CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.
“Visibility-based Probabilistic Roadmaps for Motion Planning” Siméon, Laumond, Nissoux Presentation by: Eric Ng CS326A: Paper Review Spring 2003.
1 Probabilistic Roadmaps CS 326A: Motion Planning.
CS 326 A: Motion Planning Probabilistic Roadmaps Sampling and Connection Strategies (2/2)
1 Single Robot Motion Planning - II Liang-Jun Zhang COMP Sep 24, 2008.
Adaptive Dynamic Collision Checking for Many Moving Bodies Mitul Saha Department of Computer Science, Stanford University. NSF-ITR Workshop Collaborators:
On Delaying Collision Checking in PRM Planning G. Sánchez and J. Latombe presented by Niloy J. Mitra.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Probabilistic Roadmaps: Sampling Strategies.
On Delaying Collision Checking in PRM Planning--Application to Multi-Robot Coordination Gildardo Sanchez & Jean-Claude Latombe Presented by Chris Varma.
1 On the Probabilistic Foundations of Probabilistic Roadmaps D. Hsu, J.C. Latombe, H. Kurniawati. On the Probabilistic Foundations of Probabilistic Roadmap.
1 Finding “Narrow Passages” with Probabilistic Roadmaps: The Small-Step Retraction Method Mitul Saha and Jean-Claude Latombe Research supported by NSF,
On Improving the Clearance for Robots in High-Dimensional Configuration Spaces Roland Geraerts and Mark Overmars IROS 2005.
Sampling Strategies for Narrow Passages Presented by Irena Pashchenko CS326A, Winter 2004.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Probabilistic Roadmaps: Basic Techniques.
Exact Collision Checking of Robot Paths Fabian Schwarzer Mitul Saha Jean-Claude Latombe Computer Science Department Stanford University.
CS 326 A: Motion Planning Probabilistic Roadmaps Sampling and Connection Strategies.
Planning Among Movable Obstacles with Artificial Constraints Presented by: Deborah Meduna and Michael Vitus by: Mike Stilman and James Kuffner.
On Delaying Collision Checking in PRM Planning Gilardo Sánchez and Jean-Claude Latombe January 2002 Presented by Randall Schuh 2003 April 23.
1 Path Planning in Expansive C-Spaces D. HsuJ. –C. LatombeR. Motwani Prepared for CS326A, Spring 2003 By Xiaoshan (Shan) Pan.
Sampling Strategies for Probabilistic Roadmaps Random Sampling for capturing the connectivity of the C-space:
NUS CS 5247 David Hsu1 Last lecture  Multiple-query PRM  Lazy PRM (single-query PRM)
A General Framework for Sampling on the Medial Axis of the Free Space Jyh-Ming Lien, Shawna Thomas, Nancy Amato {neilien,
Path Planning in Expansive C-Spaces D. HsuJ.-C. LatombeR. Motwani CS Dept., Stanford University, 1997.
Sampling and Connection Strategies for PRM Planners Jean-Claude Latombe Computer Science Department Stanford University Abridged and Modified Version (D.H.)
Workspace-based Connectivity Oracle An Adaptive Sampling Strategy for PRM Planning Hanna Kurniawati and David Hsu Presented by Nicolas Lee and Stephen.
CS 326A: Motion Planning Probabilistic Roadmaps: Sampling and Connection Strategies.
CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Chris Allocco.
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.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
Narrow Passage Problem in PRM Amirhossein Habibian Robotic Lab, University of Tehran Advanced Robotic Presentation.
On Delaying Collision Checking in PRM Planning – Application to Multi-Robot Coordination By: Gildardo Sanchez and Jean-Claude Latombe Presented by: Michael.
Sampling-Based Planners. The complexity of the robot’s free space is overwhelming.
Tree-Growing Sample-Based Motion Planning
Randomized Kinodynamics Planning Steven M. LaVelle and James J
NUS CS5247 Using a PRM Planner to Compare Centralized and Decoupled Planning for Multi-Robot Systems By Gildardo Sánchez and Jean-Claude Latombe In Proc.
NUS CS 5247 David Hsu Sampling Narrow Passages. NUS CS 5247 David Hsu2 Narrow passages.
Filtering Sampling Strategies: Gaussian Sampling and Bridge Test Valerie Boor, Mark H. Overmars and A. Frank van der Stappen Presented by Qi-xing Huang.
Autonomous Robots Robot Path Planning (2) © Manfred Huber 2008.
Motion Planning CS121 – Winter Basic Problem Are two given points connected by a path?
Instructor Prof. Shih-Chung Kang 2008 Spring
CS 326A: Motion Planning Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe,
Artificial Intelligence Lab
Probabilistic Roadmap Motion Planners
Sampling and Connection Strategies for Probabilistic Roadmaps
Path Planning using Ant Colony Optimisation
Motion Planning CS121 – Winter 2003 Motion Planning.
Configuration Space of an Articulated Robot
Presentation transcript:

Finding Narrow Passages with Probabilistic Roadmaps: The Small-Step Retraction Method Presented by: Deborah Meduna and Michael Vitus by: Saha, Latombe, Chang, and Prinz

Outline Motivations Small-Step Retraction Planner –Object Thinning –Optimist Strategy –Pessimist Strategy Experimental Results Conclusions

Overview PRM efficiency decreases dramatically with narrow passages Developed an efficient planner for configuration spaces with narrow passages –Built off an existing planner, SBL –Also efficient for configuration spaces without narrow passages

SBL - review Single-query Bi-directional Lazy-collision- checking –“Single-query”: PRM is built for specific start and goal configurations –Connect sample trees originating from start and goal configurations

Motivations (1) Increasing free-space slightly greatly increases the effectiveness of a PRM planner

Motivations (2) SBL prefers wider paths False passages created by object thinning are usually narrower than true passages

False Passages Thinning may generate a path through a passage that is not feasible for the robot in F. X s X g R w1w1 w2w2

Small-Step Retraction Planner (SSRP) Retract only colliding configurations which are likely to be near free-space and/or near useful passages Generate PRM in “fattened free space” F*. –Use “thinned” obstacles and/or robot. –Narrow passages become wider (i.e. easier) Retract points in F* to points in true free space F –

Object Thinning Space occupied by original robot, R(c), is related to space occupied by thinned robot, R*(c), by: Thinning should maintain kinematic constraints Incorrect ThinningCorrect Thinning

Object Thinning Medial Axis Balls Objects are thinned using the Medial Axis (MA) technique Objects are thinned by uniformly reducing the size of MA balls Thinning adds to pre-computation costs Sample Thinned Component

Optimist Algorithm Repairs conflicts at the end of the path planning Fast Might not be able to resolve conflicts at the end. (“false” passages) K = 100

Pessimist Algorithm Immediately repairs conflicts before path generation Slow Doesn’t get trapped in “false” passages Does not repair edge collisions Modifies SBL sampling in the configuration space

SSRP - Overall Planner Pessimist is slower than optimist but faster than SBL N is small (i.e. N = 5)

Experimental Results(1)

Experimental Results(2)

Conclusions Fast planner which handles configuration spaces with/without narrow passages SSRP is more reliable and faster than SBL SSRP may still fail when passages are very narrow and curved –Small percentage of real problems