NUS CS 5247 David Hsu Sampling Narrow Passages. NUS CS 5247 David Hsu2 Narrow passages.

Slides:



Advertisements
Similar presentations
NUS CS5247 Motion Planning for Car- like Robots using a Probabilistic Learning Approach --P. Svestka, M.H. Overmars. Int. J. Robotics Research, 16: ,
Advertisements

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
NUS CS5247 Planning Motions with Intention Presented by: Yan Ke.
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.
NUS CS5247 The Gaussian Sampling Strategy for Probalistic Roadmap Planners Valdrie Boor, Mark H. Overmars, A. Frank van der Stappen, 1999 Wai.
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
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.
1 On the Probabilistic Foundations of Probabilistic Roadmaps Jean-Claude Latombe Stanford University joint work with David Hsu and Hanna Kurniawati National.
“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.
Finding Narrow Passages with Probabilistic Roadmaps: The Small-Step Retraction Method Presented by: Deborah Meduna and Michael Vitus by: Saha, Latombe,
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.
1 Last lecture  Path planning for a moving Visibility graph Cell decomposition Potential field  Geometric preliminaries Implementing geometric primitives.
Motion Planning for Camera Movements in Virtual Environments Authors: D. Nieuwenhuisen, M. Overmars Presenter: David Camarillo.
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,
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.
Navigation Jeremy Wyatt School of Computer Science University of Birmingham.
Laboratory for Perceptual Robotics – Department of Computer Science Whole-Body Collision-Free Motion Planning Brendan Burns Laboratory for Perceptual Robotics.
CS 326 A: Motion Planning Probabilistic Roadmaps Sampling and Connection Strategies.
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,
Robot Motion Planning Bug 2 Probabilistic Roadmaps Bug 2 Probabilistic Roadmaps.
NUS CS 5247 David Hsu Minkowski Sum Gokul Varadhan.
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.
Stochastic Roadmap Simulation: An Efficient Representation and Algorithm for Analyzing Molecular Motion Mehmet Serkan Apaydin, Douglas L. Brutlag, Carlos.
CS 326A: Motion Planning Probabilistic Roadmaps: Sampling and Connection Strategies.
CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.
Presentation for the course : Advanced Robotics Behdad Soleimani 9 March 2009.
A Randomized Approach to Robot Path Planning Based on Lazy Evaluation Robert Bohlin, Lydia E. Kavraki (2001) Presented by: Robbie Paolini.
Particle Filters for Shape Correspondence Presenter: Jingting Zeng.
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.
Deterministic Sampling Methods for Spheres and SO(3) Anna Yershova Steven M. LaValle Dept. of Computer Science University of Illinois Urbana, IL, USA.
NUS CS5247 Dynamically-stable Motion Planning for Humanoid Robots Presenter Shen zhong Guan Feng 07/11/2003.
Sampling-Based Planners. The complexity of the robot’s free space is overwhelming.
Project by: Qi-Xing & Samir Menon. Motion Planning for the Human Hand Generate Hand Skeleton Define Configuration Space Sample Configuration Space for.
Filtering Sampling Strategies: Gaussian Sampling and Bridge Test Valerie Boor, Mark H. Overmars and A. Frank van der Stappen Presented by Qi-xing Huang.
NUS CS 5247 David Hsu Configuration Space. 2 What is a path?
Motion Planning CS121 – Winter Basic Problem Are two given points connected by a path?
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
Last lecture Configuration Space Free-Space and C-Space Obstacles
UOBPRM: A Uniformly Distributed Obstacle-Based PRM
Probabilistic Roadmap Motion Planners
Boustrophedon Cell Decomposition
Sampling and Connection Strategies for Probabilistic Roadmaps
Motion Planning CS121 – Winter 2003 Motion Planning.
Configuration Space of an Articulated Robot
CS 416 Artificial Intelligence
Presentation transcript:

NUS CS 5247 David Hsu Sampling Narrow Passages

NUS CS 5247 David Hsu2 Narrow passages

NUS CS 5247 David Hsu3 Narrowness connected by a tube: (n-1)-dim narrow connected by a tube: 1-dim narrow n-dim hypercube

NUS CS 5247 David Hsu4 PRM skeleton repeat Sample a configuration q with a suitable sampling strategy. if q is collision-free then Add q to the roadmap R. Connect q to existing milestones. Search R for a path. return the path if one is found

NUS CS 5247 David Hsu5 Key elements of PRM  Sampling strategy Distribution e.g., uniform, Gaussian Source e.g., pseudo-random, quasi-random, lattice distribution source  Connection strategy

NUS CS 5247 David Hsu6 Difficulty PSAPCE-hard random sampling narrow passages

NUS CS 5247 David Hsu7 Dilating free space original free space dilated free space

NUS CS 5247 David Hsu8 Sampling near obstacle boundaries OBPRMGaussian Sampler

NUS CS 5247 David Hsu9 What is the problem here?

NUS CS 5247 David Hsu10 Adaptive sampling 1: Initialize the sampling distribution . 2: repeat 3: Sample new milestones according to . 4: Extract partial knowledge of the configuration space. Evaluate the current roadmap. 5: Update 