Download presentation

Presentation is loading. Please wait.

Published byJade Terry Modified over 2 years ago

1
NUS CS5247 The Gaussian Sampling Strategy for Probalistic Roadmap Planners - 1999 - Valdrie Boor, Mark H. Overmars, A. Frank van der Stappen, 1999 Wai Kok Hoong

2
NUS CS52472 Sampling a Point Uniformly at Random – A Recap 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 return R

3
NUS CS52473 Sampling a Point Uniformly at Random – A Recap 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 return R

4
NUS CS52474 The Gaussian Sampling Strategy for PRMs Obstacle-sensitive strategy Idea: Sample near the boundaries of the C- space obstacles with higher probability. Rationale: The connectivity of free space is more difficult to capture near narrow passages than in wide-open area

5
NUS CS52475 The Gaussian Sampling Strategy for PRMs Random Sampler (about 13000 samples) Gaussian Sampler (about 150 samples)

6
NUS CS52476 The Gaussian Sampling Strategy for PRMs Adopts the idea of Gaussian Blurring in image processing.

7
NUS CS52477 The Gaussian Sampling Strategy for PRMs Algorithm

8
NUS CS52478 The Gaussian Sampling Strategy for PRMs Algorithm

9
NUS CS52479 The Gaussian Sampling Strategy for PRMs Algorithm

10
NUS CS524710 The Gaussian Sampling Strategy for PRMs Algorithm

11
NUS CS524711 The Gaussian Sampling Strategy for PRMs Algorithm

12
NUS CS524712 The Gaussian Sampling Strategy for PRMs Algorithm

13
NUS CS524713 The Gaussian Sampling Strategy for PRMs Algorithm

14
NUS CS524714 The Gaussian Sampling Strategy for PRMs Algorithm

15
NUS CS524715 The Gaussian Sampling Strategy for PRMs Algorithm

16
NUS CS524716 The Gaussian Sampling Strategy for PRMs Algorithm

17
NUS CS524717 The Gaussian Sampling Strategy for PRMs Algorithm

18
NUS CS524718 The Gaussian Sampling Strategy for PRMs

19
NUS CS524719 The Gaussian Sampling Strategy for PRMs Pros May lead to discovery of narrow passages or openings to narrow passages. Cons The algorithm dose not distinguish between open space boundaries and narrow passage boundaries.

20
NUS CS524720 The Gaussian Sampling Strategy for PRMs Extension Use 3 samples instead of 2 Gaussian Sampler (using pairs) Gaussian Sampler (using triples)

21
NUS CS524721 The Gaussian Sampling Strategy for PRMs – Experimental Results Random sampler required about 13000 nodes. Gaussian sampler required 150 nodes. Random sampler took about 60 times longer than the Gaussian sampler.

22
NUS CS524722 The Gaussian Sampling Strategy for PRMs – Experimental Results A scene requiring a difficult twist of the robot. Random sampler required about 10000 nodes. Gaussian sampler required 750 nodes. Random sampler took about 13 times longer than the Gaussian sampler.

23
NUS CS524723 The Gaussian Sampling Strategy for PRMs – Experimental Results A scene with 5000 obstacles. Random sampler required over 450 nodes. Gaussian sampler required about 85 nodes. Random sampler took about 4 times longer than the Gaussian sampler.

24
NUS CS524724 The Gaussian Sampling Strategy for PRMs – Experimental Results Running time of algorithm increases when sigma is chosen to be very small because hard to find a pair of nodes that generates a successful sample, thus performance deterioration. When sigma is chosen to be very large, output of sampler started to approximate random sampling, thus performance also deteriorated. Choose sigma such that most configurations lie at a distance of at most the length of the robot from the obstacles.

25
NUS CS524725 The Bridge Test for Sampling Narrow Passages with PRMs Narrow-passage strategy Rationale: Finding the connectivity of the free space through narrow passage is the only hard problem.

26
NUS CS524726 The Bridge Test for Sampling Narrow Passages with PRMs The bridge test most likely yields a high rejection rate of configurations It generally results in a smaller number of milestones, hence fewer connections to be tested Since testing connections is costly, there can be significant computational gain

27
NUS CS524727 Comparison between Gaussian Sampling and Bridge Test Gaussian SamplingBridge Test

28
NUS CS524728 Summary Sample near the boundaries of the C-space obstacles The connectivity of free space is more difficult to capture near its narrow passages than in wide-open area Random Sampler is faster in scenes where the obstacles are reasonably distributed with wide corridors. Gaussian Sampler is faster in scenes where there is varying obstacle density, resulting in large open areas and small passages. ~ The End ~

Similar presentations

OK

1 Motion Planning for Multiple Robots B. Aronov, M. de Berg, A. Frank van der Stappen, P. Svestka, J. Vleugels Presented by Tim Bretl.

1 Motion Planning for Multiple Robots B. Aronov, M. de Berg, A. Frank van der Stappen, P. Svestka, J. Vleugels Presented by Tim Bretl.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on plant cell and animal cell Ppt on states of matter grade 5 Ppt on external gear pump Ppt on chapter 12 electricity generation Ppt on high sea sales meaning Ppt on eye oswego Ppt on tata trucks Ppt on water scarcity in uganda Ppt on energy giving food pictures Ppt on boilers operations