Sampling Strategies for Probabilistic Roadmaps - PowerPoint PPT Presentation

1 / 19
About This Presentation
Title:

Sampling Strategies for Probabilistic Roadmaps

Description:

Minimize roadmap size. Answer queries correctly. Types of Strategies. Single- vs. Multi-queries ... Sample several configurations in the same region of ... – PowerPoint PPT presentation

Number of Views:54
Avg rating:3.0/5.0
Slides: 20
Provided by: aiSta
Category:

less

Transcript and Presenter's Notes

Title: Sampling Strategies for Probabilistic Roadmaps


1
  • Sampling Strategies forProbabilistic Roadmaps

Issue Where to sample new roadmap
nodes? Goals Minimize roadmap size Answer
queries correctly
2
Types of Strategies
  • Single- vs. Multi-queries
  • Workspace-based
  • Filtering
  • Adaptive
  • Deformation

3
Workspace-Guided Strategies
  • Main idea
  • Most narrow passages in configuration space
    derive from narrow passages in the workspace
  • Methods
  • Detect narrow passages in the workspace
  • Sample more densely configurations that place
    selected robot points in workspaces narrow
    passages

Workspace-guided sampling Kurniawati and Hsu,
2004
Uniform sampling
4
Filtering Strategies
  • Basic Idea
  • Sample several configurations in the same region
    of configuration space
  • If a pattern is detected, then retain one of
    the configurations as a roadmap node
  • More sampling work, but better distribution of
    nodes
  • Less time wasted connecting un-interesting
    nodes
  • Gaussian sampling
  • Bridge Test
  • Hybrid

5
Gaussian Sampling
  • Sample a configuration q uniformly at random from
    configuration space
  • Sample a real number x at random with Gaussian
    distribution N0,s(x)
  • Sample a configuration q in the ball B(q,x)
    uniformly at random
  • If only one of q and q is in free space, retain
    the one in free space as a node else retain none

6
Gaussian Distribution
7
Gaussian Sampling
  • Sample a configuration q uniformly at random from
    configuration space
  • Sample a real number x at random with Gaussian
    distribution N0,s(x)
  • Sample a configuration q in the ball B(q,x)
    uniformly at random
  • If only one of q and q is in free space, retain
    the one in free space as a node else retain none

What is the effect? What is the intuition?
8
Example of Node Distribution
9
Bridge Test
  • Sample two conformations q and q using Gaussian
    sampling technique
  • If none is in free space, then
  • if qm (qq)/2 is in free space, then retain
    qm as a node
  • Else retain none

What is the effect? What is the intuition?
10
Bridge Test
11
Distribution
8-joint robot with mobile base
12
Distribution
7-joint robot with fixed base
13
Hybrid
  • Sample two configurations q and q using Gaussian
    sampling technique
  • If both are in free space, then retain one (any
    of the two) as a node with low probability (e.g.,
    0.1)
  • Else if only one is in free space, then retain it
    as a node with intermediate probability (e.g.,
    0.5)
  • Else if qm (qq)/2 is in free space, then
    retain it as a node with probability 1

14
(No Transcript)
15
Adaptive Strategies
  • Principle Use intermediate sampling results to
    identify regions of the free space whose
    connectivity is more difficult to capture
  • Example Two-stage sampling strategy
  • Construct initial PRM with uniform sampling
  • Identify milestones that have few connections
    to their close neighbors
  • Sample more configurations around them
  • ? Greater density of milestones in difficult
    regions of the feasible space

16
Adaptive Strategies
  • Principle Use intermediate sampling results to
    identify regions of the free space whose
    connectivity is more difficult to capture
  • Example Two-stage sampling strategy
  • Construct initial PRM with uniform sampling
  • Identify milestones that have few connections
    to their close neighbors
  • Sample more configurations around them
  • ? Greater density of milestones in difficult
    regions of the feasible space

17
Deformation Strategies
18
Free Space Dilatation
  • Pre-computationSlim the robot
  • Planning
  • Compute a path for slimmed robot
  • Deform this path for original robot

dilated free space
19
Role of Randomness
  • Adversary argument
  • Implementation convenience
  • Efficiency? Not really
Write a Comment
User Comments (0)
About PowerShow.com