“Visibility-based Probabilistic Roadmaps for Motion Planning” Siméon, Laumond, Nissoux Presentation by: Mathieu Bredif CS326A: Paper Review Winter 2004.

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

NUS CS5247 Motion Planning for Car- like Robots using a Probabilistic Learning Approach --P. Svestka, M.H. Overmars. Int. J. Robotics Research, 16: ,
Probabilistic Roadmaps. The complexity of the robot’s free space is overwhelming.
Motion Planning for Point Robots CS 659 Kris Hauser.
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
Manipulation Planning. In 1995 Alami, Laumond and T. Simeon proposed to solve the problem by building and searching a ‘manipulation graph’.
By Lydia E. Kavraki, Petr Svestka, Jean-Claude Latombe, Mark H. Overmars Emre Dirican
Sampling Strategies By David Johnson. Probabilistic Roadmaps (PRM) [Kavraki, Svetska, Latombe, Overmars, 1996] start configuration goal configuration.
Presented By: Aninoy Mahapatra
Probabilistic Roadmap
A Comparative Study of Probabilistic Roadmap Planners Roland Geraerts Mark Overmars.
Probabilistic Roadmaps Sujay Bhattacharjee Carnegie Mellon University.
Sampling and Connection Strategies for PRM Planners Jean-Claude Latombe Computer Science Department Stanford University.
David Hsu, Robert Kindel, Jean- Claude Latombe, Stephen Rock Presented by: Haomiao Huang Vijay Pradeep Randomized Kinodynamic Motion Planning with Moving.
Nearest Neighborhood Search in Motion Planning Lakshmi Reddy B Advisor: Nancy M. Amato Parasol lab Department of Computer Science Texas A&M University.
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,
Creating Small Roadmaps for Solving Motion Planning Problems Roland Geraerts and Mark Overmars MMAR 2005.
1 Probabilistic Roadmaps CS 326A: Motion Planning.
1 Single Robot Motion Planning - II Liang-Jun Zhang COMP Sep 24, 2008.
On Experimental Research in Sampling-based Motion Planning Roland Geraerts Workshop on Benchmarks in Robotics Research IROS 2006.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Probabilistic Roadmaps: Sampling Strategies.
1 On the Probabilistic Foundations of Probabilistic Roadmaps D. Hsu, J.C. Latombe, H. Kurniawati. On the Probabilistic Foundations of Probabilistic Roadmap.
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.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Dongkyu, Choi.
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.
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:
RRT-Connect path solving J.J. Kuffner and S.M. LaValle.
NUS CS 5247 David Hsu1 Last lecture  Multiple-query PRM  Lazy PRM (single-query PRM)
Robot Motion Planning Bug 2 Probabilistic Roadmaps Bug 2 Probabilistic Roadmaps.
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.
RNA Folding Kinetics Bonnie Kirkpatrick Dr. Nancy Amato, Faculty Advisor Guang Song, Graduate Student Advisor.
Randomized Planning for Short Inspection Paths Tim Danner and Lydia E. Kavraki 2000 Presented by Dongkyu, Choi On the day of 28 th May 2003 CS326a: Motion.
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.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Lydia E. Kavraki Petr Švetka Jean-Claude Latombe Mark H. Overmars Presented.
Presentation for the course : Advanced Robotics Behdad Soleimani 9 March 2009.
Deterministic Sampling Methods for Spheres and SO(3) Anna Yershova Steven M. LaValle Dept. of Computer Science University of Illinois Urbana, IL, USA.
The Stochastic Motion Roadmap: A Sampling Framework for Planning with Markov Motion Uncertainty Changsi An You-Wei Cheah.
Energy and Coverage Aware Routing Algorithm in Self Organized Sensor Networks Jakob Salzmann INSS 2007, , Braunschweig Institute of Applied Microelectronics.
Path Planning for a Point Robot
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
On Delaying Collision Checking in PRM Planning – Application to Multi-Robot Coordination By: Gildardo Sanchez and Jean-Claude Latombe Presented by: Michael.
Richard Kelley Motion Planning on a GPU. Last Time Nvidia’s white paper Productive discussion.
Deterministic Sampling Methods for Spheres and SO(3) Anna Yershova Steven M. LaValle Dept. of Computer Science University of Illinois Urbana, IL, USA.
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 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.
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,
Motion Planning for a Point Robot (2/2)
Artificial Intelligence Lab
C-obstacle Query Computation for Motion Planning
Probabilistic Roadmap Motion Planners
Presented By: Aninoy Mahapatra
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:

“Visibility-based Probabilistic Roadmaps for Motion Planning” Siméon, Laumond, Nissoux Presentation by: Mathieu Bredif CS326A: Paper Review Winter 2004

Motivation Save computation time without sacrificing coverage and connectivity. Visibility PRM is an optimized variation of basic PRM

Ensuring Coverage Visibility Domain of configuration q: q Visibility = Local planer = Dynamic Collision Checking on: -Straight lines -Manhattan paths -Non-holonomic …

Ensuring Coverage Free Space Coverage with Guard nodes Shared Visibility Guard

Ensuring Coverage Free Space Coverage with Guard nodes Shared Visibility Guard

Creating Connections Completing roadmap with Connection nodes Connection Shared Visibility Guard

Implementation Strategy

Termination criterion Meanwhile: 1/ntry = estimation of the volume of the subset of the free space not yet covered by visibility domains. M is max number of failures before the insertion of a new guard node. (1-1/M) = estimation of the coverage.

Pathological Case Probability of connection between guard nodes depend on where they are (randomly) placed.

Possible Improvements It might be nice to have movable guards to prevent pathological case. Use sampling techniques to find narrow passages (First Paper).

Visibility PRM – Basic PRM comparison Heavier Node “filtering” process BUT reduction in calls to the local method, from O(n 2 ) to O(n). Remaining problems of randomly chosen configuration points (inherent to PRM).

Conclusions Roadmap size is reduced. –Faster Queries –Few potential routes to choose from (good or bad?) Control of the coverage by (1-1/M) Computation Costs seem to be lower than with Basic-PRM.