NUS CS 5247 David Hsu1 Last lecture  Multiple-query PRM  Lazy PRM (single-query PRM)

Slides:



Advertisements
Similar presentations
Probabilistic Roadmaps. The complexity of the robot’s free space is overwhelming.
Advertisements

PRM and Multi-Space Planning Problems : How to handle many motion planning queries? Jean-Claude Latombe Computer Science Department Stanford University.
NUS CS5247 Motion Planning for Camera Movements in Virtual Environments By Dennis Nieuwenhuisen and Mark H. Overmars In Proc. IEEE Int. Conf. on Robotics.
Probabilistic Path Planner by Someshwar Marepalli Pratik Desai Ashutosh Sahu Gaurav jain.
By Lydia E. Kavraki, Petr Svestka, Jean-Claude Latombe, Mark H. Overmars Emre Dirican
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.
Presented By: Aninoy Mahapatra
Probabilistic Roadmap
Probabilistic Roadmaps Sujay Bhattacharjee Carnegie Mellon University.
NUS CS5247 Randomized Kinodynamic Motion Planning with Moving Obstacles - D. Hsu, R. Kindel, J.C. Latombe, and S. Rock. Int. J. Robotics Research, 21(3): ,
Randomized Kinodynamics Motion Planning with Moving Obstacles David Hsu, Robert Kindel, Jean-Claude Latombe, Stephen Rock.
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.
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.
Presented by David Stavens. Manipulation Planning Before: Want to move the robot from one configuration to another, around obstacles. Now: Want to robot.
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.
1 Single Robot Motion Planning - II Liang-Jun Zhang COMP Sep 24, 2008.
Rapidly Expanding Random Trees
Planning Paths for Elastic Objects Under Manipulation Constraints Florent Lamiraux Lydia E. Kavraki Rice University Presented by: Michael Adams.
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,
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.
CS 326 A: Motion Planning Probabilistic Roadmaps Sampling and Connection Strategies.
Interactive Navigation in Complex Environments Using Path Planning Salomon et al.(2003) University of North Carolina Presented by Mohammed Irfan Rafiq.
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:
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,
Robot Motion Planning Bug 2 Probabilistic Roadmaps Bug 2 Probabilistic Roadmaps.
Expanders Eliyahu Kiperwasser. What is it? Expanders are graphs with no small cuts. The later gives several unique traits to such graph, such as: – High.
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.
Integrated Grasp and Motion Planning For grasping an object in a cluttered environment several tasks need to take place: 1.Finding a collision free path.
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.
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
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
Last lecture Configuration Space Free-Space and C-Space Obstacles
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:

NUS CS 5247 David Hsu1 Last lecture  Multiple-query PRM  Lazy PRM (single-query PRM)

NUS CS 5247 David Hsu Single-Query PRM

NUS CS 5247 David Hsu3 Randomized expansion  Path Planning in Expansive Configuration Spaces, D. Hsu, J.C. Latombe, & R. Motwani, 1999.

NUS CS 5247 David Hsu4 Overview 1. Grow two trees from Init position and Goal configurations. 2. Randomly sample nodes around existing nodes. 3. Connect a node in the tree rooted at Init to a node in the tree rooted at the Goal. Init Goal Expansion + Connection

NUS CS 5247 David Hsu5 1.Pick a node x with probability 1/w(x). Disk with radius d, w(x)=3 Expansion root 2.Randomly sample k points around x. 3.For each sample y, calculate w(y), which gives probability 1/w(y).

NUS CS 5247 David Hsu6 1.Pick a node x with probability 1/w(x). Expansion root 2.Randomly sample k points around x. 3.For each sample y, calculate w(y), which gives probability 1/w(y) /w(y 1 )=1/5

NUS CS 5247 David Hsu7 1.Pick a node x with probability 1/w(x). Expansion root 2.Randomly sample k points around x. 3.For each sample y, calculate w(y), which gives probability 1/w(y) /w(y 2 )=1/2

NUS CS 5247 David Hsu8 1.Pick a node x with probability 1/w(x). Expansion root 2.Randomly sample k points around x. 3.For each sample y, calculate w(y), which gives probability 1/w(y) /w(y3)=1/3

NUS CS 5247 David Hsu9 1.Pick a node x with probability 1/w(x). Expansion root 2.Randomly sample k points around x. 3.For each sample y, calculate w(y), which gives probability 1/w(y). If y ( a) has higher probability; (b) collision free; (c) can sees x then add y into the tree.

NUS CS 5247 David Hsu10 Sampling distribution  Weight w(x) = no. of neighbors  Roughly Pr(x)  1 / w(x)

NUS CS 5247 David Hsu11 Effect of weighting unweighted samplingweighted sampling

NUS CS 5247 David Hsu12 Connection  If a pair of nodes (i.e., x in Init tree and y in Goal tree) and distance( x, y )< L, check if x can see y Init Goal YES, then connect x and y x y

NUS CS 5247 David Hsu13 Termination condition  The program iterates between Expansion and Connection, until two trees are connected, or max number of expansion & connection steps is reached Init Goal

NUS CS 5247 David Hsu14 Computed example

NUS CS 5247 David Hsu Expansive Spaces Analysis of Probabilistic Roadmaps

NUS CS 5247 David Hsu16 Issues of probabilistic roadmaps  Coverage  Connectivity

NUS CS 5247 David Hsu17 Is the coverage adequate?  It means that milestones are distributed such that almost any point of the configuration space can be connected by a straight line segment to one milestone. BadGood

NUS CS 5247 David Hsu18 Connectivity  There should be a one-to-one correspondence between the connected components of the roadmap and those of F.

NUS CS 5247 David Hsu19 Narrow passages  Connectivity is difficult to capture when there are narrow passages. Characterize coverage & connectivity?  Expansiveness  Narrow passages are difficult to define. easy difficult

NUS CS 5247 David Hsu20 Definition: visibility set  Visibility set of q All configurations in F that can be connected to q by a straight-line path in F All configurations seen by q q

NUS CS 5247 David Hsu21 Definition: Є-good  Every free configuration sees at least є fraction of the free space, є in (0,1]. 0.5-good1-good F is 0.5-good

NUS CS 5247 David Hsu22 Definition: lookout of a subset S  Subset of points in S that can see at least β fraction of F \ S, β is in (0,1]. S F\SF\S 0.4-lookout of S This area is about 40% of F \ S S F\SF\S 0.3-lookout of S

NUS CS 5247 David Hsu23 S F\SF\S F is ε-good  ε=0.5 Definition: (ε,α,β)-expansive  The free space F is ( , ,  )-expansive if Free space F is  -good For each subset S of F, its β-lookout is at least  fraction of S. , ,  are in (0,1] β-lookout  β=0.4 Volume(β-lookout) Volume(S)  =0.2 F is (ε, α, β)-expansive, where ε=0.5, =0.2, β=0.4.

NUS CS 5247 David Hsu24 Why expansiveness?  , , and  measure the expansiveness of a free space.  Bigger ε, α, and β  lower cost of constructing a roadmap with good connectivity and coverage.

NUS CS 5247 David Hsu25 Uniform sampling  All-pairs path planning  Theorem 1 : A roadmap of uniformly-sampled milestones has the correct connectivity with probability at least.

NUS CS 5247 David Hsu26 p3p3 pnpn P n+1 q p2p2 Definition: Linking sequence p p1p1 P n+1 is chosen from the lookout of the subset seen by p, p 1,…,p n Visibility of p Lookout of V(p)

NUS CS 5247 David Hsu27 p3p3 pnpn P n+1 q p2p2 Definition: Linking sequence p p1p1 P n+1 is chosen from the lookout of the subset seen by p, p 1,…,p n Visibility of p Lookout of V(p)

NUS CS 5247 David Hsu28 q p Space occupied by linking sequences

NUS CS 5247 David Hsu29 Size of lookout set A C-space with larger lookout set has higher probability of constructing a linking sequence. small lookoutbig lookout p p1p1

NUS CS 5247 David Hsu30 Lemmas  In an expansive space with large , , and , we can obtain a linking sequence that covers a large fraction of the free space, with high probability.

NUS CS 5247 David Hsu31 Theorem 1  Probability of achieving good connectivity increases exponentially with the number of milestones (in an expansive space).  If (ε, α, β) decreases  then need to increase the number of milestones (to maintain good connectivity)

NUS CS 5247 David Hsu32 Theorem 2  Probability of achieving good coverage, increases exponentially with the number of milestones (in an expansive space).

NUS CS 5247 David Hsu33 Probabilistic completeness In an expansive space, the probability that a PRM planner fails to find a path when one exists goes to 0 exponentially in the number of milestones (~ running time). [Hsu, Latombe, Motwani, 97]

NUS CS 5247 David Hsu34 Summary  Main result If a C-space is expansive, then a roadmap can be constructed efficiently with good connectivity and coverage.  Limitation in practice It does not tell you when to stop growing the roadmap. A planner stops when either a path is found or max steps are reached.

NUS CS 5247 David Hsu35 Extensions  Accelerate the planner by automatically generating intermediate configurations to decompose the free space into expansive components.

NUS CS 5247 David Hsu36 Extensions  Accelerate the planner by automatically generating intermediate configurations to decompose the free space into expansive components.  Use geometric transformations to increase the expansiveness of a free space, e.g., widening narrow passages.

NUS CS 5247 David Hsu37 Extensions  Accelerate the planner by automatically generating intermediate configurations to decompose the free space into expansive components.  Use geometric transformations to increase the expansiveness of a free space, e.g., widening narrow passages.  Integrate the new planner with other planner for multiple-query path planning problems. Questions?

NUS CS 5247 David Hsu38 Two tenets of PRM planning  A relatively small number of milestones and local paths are sufficient to capture the connectivity of the free space.  Exponential convergence in expansive free space (probabilistic completeness)  Checking sampled configurations and connections between samples for collision can be done efficiently.  Hierarchical collision checking