Clearance Based Path Optimization for Motion Planning Roland Geraerts and Mark Overmars ICRA 2004.

Slides:



Advertisements
Similar presentations
NUS CS5247 Motion Planning for Car- like Robots using a Probabilistic Learning Approach --P. Svestka, M.H. Overmars. Int. J. Robotics Research, 16: ,
Advertisements

Artificial Intelligence By Mr. Ejaz CIIT Sahiwal.
Complete Motion Planning
Traveling Salesperson Problem
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2007.
Label Placement and graph drawing Imo Lieberwerth.
Sampling Techniques for Probabilistic Roadmap Planners
NUS CS5247 Motion Planning for Camera Movements in Virtual Environments By Dennis Nieuwenhuisen and Mark H. Overmars In Proc. IEEE Int. Conf. on Robotics.
Branch and Bound Optimization In an exhaustive search, all possible trees in a search space are generated for comparison At each node, if the tree is optimal.
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 From the Medial Axis Presented by Rahul Biswas April 23, 2003 CS326A: Motion Planning.
Sampling Strategies for PRMs modified from slides of T.V.N. Sri Ram.
University of Amsterdam Search, Navigate, and Actuate - Quantitative Navigation Arnoud Visser 1 Search, Navigate, and Actuate Quantative Navigation.
Roland Geraerts and Mark Overmars ICRA 2007 The Corridor Map Method: Real-Time High-Quality Path Planning.
Way to go: A framework for multi-level planning in games Norman Jaklin Wouter van Toll Roland Geraerts Department of Information and Computing Sciences.
Creating High-quality Roadmaps for Motion Planning in Virtual Environments Roland Geraerts and Mark Overmars IROS 2006.
A Comparative Study of Probabilistic Roadmap Planners Roland Geraerts Mark Overmars.
3D Skeletons Using Graphics Hardware Jonathan Bilodeau Chris Niski.
Tackling Post’s Correspondence Problem Ling Zhao Department of Computing Science University of Alberta July 31, 2001.
Image Segmentation and Active Contour
 Point at which all other points on the object rotate around  During motion the CM will move in the same path that a simple particle would move if subjected.
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,
CS 460 Midterm solutions. 1.b 2.PEAS : Performance Measure, Environment, Actuators, Sensors 3.c 4.a. Environment: non-English language Internet sites.
Creating Small Roadmaps for Solving Motion Planning Problems Roland Geraerts and Mark Overmars MMAR 2005.
On Experimental Research in Sampling-based Motion Planning Roland Geraerts Workshop on Benchmarks in Robotics Research IROS 2006.
1 Finding “Narrow Passages” with Probabilistic Roadmaps: The Small-Step Retraction Method Mitul Saha and Jean-Claude Latombe Research supported by NSF,
On Improving the Clearance for Robots in High-Dimensional Configuration Spaces Roland Geraerts and Mark Overmars IROS 2005.
Rule-based Price Discovery Methods in Transportation Procurement Auctions Jiongjiong Song Amelia Regan Institute of Transportation Studies University of.
Conventional AI Machine Learning Techniques Environmental Mapping Case Statements Statistical Analysis Computational Intelligence Pattern Recognition.
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,
SubSea: An Efficient Heuristic Algorithm for Subgraph Isomorphism Vladimir Lipets Ben-Gurion University of the Negev Joint work with Prof. Ehud Gudes.
Gripping Sheet Metal Parts at Vertices K. Gopalakrishnan A Project for CS 287.
Homework Discussion Read pages 372 – 382 Page 394: 1 – 6, 11 – 12,
Navigation Meshes for Realistic Multi-Layered Environments Wouter G. van Toll, Atlas F. Cook IV, Roland Geraerts Utrecht University, The Netherlands.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Chris Allocco.
Kinematics P Casey Dill. Elbow Flexion Minimum Distance: inches.
Computer Animation CS 445/645 Fall Let’s talk about computer animation Must generate 30 frames per second of animation (24 fps for film) Issues.
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig 1 FLUTE: Fast Lookup Table Based RSMT Algorithm.
Multi-Layered Navigation Meshes Wouter G. van Toll, Atlas F. Cook IV, Roland Geraerts ICT.OPEN 2011.
Ioannis Karamouzas, Roland Geraerts, Mark Overmars Indicative Routes for Path Planning and Crowd Simulation.
A Navigation Mesh for Dynamic Environments Wouter G. van Toll, Atlas F. Cook IV, Roland Geraerts CASA 2012.
An efficient distributed protocol for collective decision- making in combinatorial domains CMSS Feb , 2012 Minyi Li Intelligent Agent Technology.
Using the Corridor Map Method for Path Planning for a Large Number of Characters Roland Geraerts, Arno Kamphuis, Ioannis Karamouzas, Mark Overmars MIG’08.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
How Can Forces Affect Objects?. Slow them down Speed them up Stop them Start them Change their direction Change their shape.
10.6 Parametric Equations. Definition of Parametric Equations parametric equation is a method of defining a relation using parameters. A simple kinematic.
Motion Planning in Games Mark Overmars Utrecht University.
Center of Mass, Moment of Inertia, & Rotational Equilibrium Rotation Physics Mr. McCallister.
1 SheetCourse: Engineering Graphics 1504Memorial University of Newfoundland Engi 1504 – Graphics Lecture 5: Sectioning and Dimensioning l Sectioning an.
Wouter G. van Toll Atlas F. Cook IV Roland Geraerts Realistic Crowd Simulation with Density-Based Path Planning ICT.OPEN / ASCI October 22nd, 2012.
Roland Geraerts and Erik Schager CASA 2010 Stealth-Based Path Planning using Corridor Maps.
Lecture 4: Improving the Quality of Motion Paths Software Workshop: High-Quality Motion Paths for Robots (and Other Creatures) TAs: Barak Raveh,
2 By : Rathod Shakti Sinh En.No Raymangiya Mohit D. En.No Sangada Shukram K. En.No Savaliya Bhautik R. En.No
SuperQuest Salem Arms – Best Practices.
Graphing.
CS 326A: Motion Planning Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe,
Indicative Routes for Path Planning and Crowd Simulation
پروتكل آموزش سلامت به مددجو
Artificial Intelligence Lab
Roland Geraerts and Mark Overmars CASA’08
Rotational Inertia 8.2.
Links in Technical Objects
Introducing Underestimates
Chapter 7 : The technological world
Area Coverage Problem Optimization by (local) Search
Maximum Flow Problems in 2005.
Classic Motion Planning Methods
FLUTE: Fast Lookup Table Based RSMT Algorithm for VLSI Design
Presentation transcript:

Clearance Based Path Optimization for Motion Planning Roland Geraerts and Mark Overmars ICRA 2004

Problem setting Low quality paths Often long detours Discontinuity Unnecessary motions Quality criteria Length Clearance Combination

Path Quality – Length Post processing Path pruning Shortcut Partial shortcut

Path Quality – Length Path pruning Fast and simple heuristic Translational dist. improves considerably Rotation is more difficult to remove

Path Quality – Length Shortcut More general than path pruning Simple technique Fast convergence

Path Quality – Length Weakness of the shortcut heuristic Path can still contain many redundant (rotational) motions Creating shortcuts on large portions will fail Partial shortcut Query pathShortcutPartial shortcut

Path Quality – Clearance Method Remove redundant nodes Retract path to medial axis Remove branches Can help improving path length Query pathRetracted pathNo branches

Path Quality – Clearance Retract path to medial axis Retract sample to medial axis d 2 x d 4 x d

Path Quality – Clearance Retract path to medial axis Maximum stepsize s between samples

Path Quality – Clearance Retract path to medial axis Redundant branches redundant branch

Path Quality – Clearance Remove redundant branches Maximum step size

Path Quality – Combination Technique Retract path to medial axis Increase size of robots Create partial shortcuts Result Reasonable short path Path has a particular minimum amount of clearance where it is possible

Experimental Setup – Path Length Environment SAMPLE 3 test scenes/paths Focus Free flying objects Post processing

Experiments – Simple Corridor Simple scene, cylinder Many motions are redundant Redundant motions are easy to remove

Experiments – Simple Corridor Simple scene, cylinder Many motions are redundant Redundant motions are easy to remove 400% 27% 16%14% 1%2%0%

Experiments – Corridor Elbow shaped object is forced to rotate Little clearance to corridors

Experiments – Corridor Elbow shaped object is forced to rotate Little clearance to corridors 256% 65% 24% 11% 5%0%

Experiments – Hole Object must rotate to get through the hole Clearance is small inside the hole

Experiments – Hole Object must rotate to get through the hole Clearance is small inside the hole 41% 14% 0% 184% 112% 36% 23%

Future Work Extension to other robot types Preprocessing techniques

Questions Home page: Mail: