1 / 19

“Visibility-based Probabilistic Roadmaps for Motion Planning” Siméon, Laumond, Nissoux

“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.

yasuo
Download Presentation

“Visibility-based Probabilistic Roadmaps for Motion Planning” Siméon, Laumond, Nissoux

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

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

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

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

  4. Ensuring Coverage • Free Space Coverage with Guard nodes Shared Visibility Guard

  5. Ensuring Coverage • Free Space Coverage with Guard nodes Shared Visibility Guard

  6. Creating Connections • Completing roadmap with Connection nodes Shared Visibility Guard Connection

  7. Implementation Strategy

  8. Implementation Strategy

  9. Implementation Strategy

  10. Implementation Strategy

  11. Implementation Strategy

  12. Implementation Strategy

  13. Implementation Strategy

  14. Implementation Strategy

  15. 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.

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

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

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

  19. 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.

More Related