Finding Critical Changes in Dynamic Configuration Spaces Yanyan Lu and Jyh-Ming Lien George Mason University.

Slides:



Advertisements
Similar presentations
Complete Motion Planning
Advertisements

Motion Planning for Point Robots CS 659 Kris Hauser.
Presented By: Aninoy Mahapatra
Probabilistic Roadmap Methods (PRMs)
Kinodynamic Path Planning Aisha Walcott, Nathan Ickes, Stanislav Funiak October 31, 2001.
DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.
Iterative Relaxation of Constraints (IRC) Can’t solve originalCan solve relaxed PRMs sample randomly but… start goal C-obst difficult to sample points.
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.
Multi-Robot Motion Planning Jur van den Berg. Outline Recap: Configuration Space for Single Robot Multiple Robots: Problem Definition Multiple Robots:
Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles (1991) Jerome Barraquand Jean-Claude Latombe.
Integrating FEM-based deformable obstacles in PRM Comp768 project presentation Mert Sedef.
David Hsu, Robert Kindel, Jean- Claude Latombe, Stephen Rock Presented by: Haomiao Huang Vijay Pradeep Randomized Kinodynamic Motion Planning with Moving.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Fast C-obstacle Query Computation for Motion Planning Liang-Jun Zhang 12/13/2005 Liang-Jun Zhang 1 Young.
CS 326 A: Motion Planning Coordination of Multiple Robots.
Motion Planning. Basic Topology Definitions  Open set / closed set  Boundary point / interior point / closure  Continuous function  Parametric curve.
1 Single Robot Motion Planning - II Liang-Jun Zhang COMP Sep 24, 2008.
Rapidly Expanding Random Trees
Multi-Robot Motion Planning #2 Jur van den Berg. Outline Recap: Composite Configuration Space Prioritized Planning Planning in Dynamic Environments Application:
Robotics R&N: ch 25 based on material from Jean- Claude Latombe, Daphne Koller, Stuart Russell.
1 Finding “Narrow Passages” with Probabilistic Roadmaps: The Small-Step Retraction Method Mitul Saha and Jean-Claude Latombe Research supported by NSF,
Providing Haptic ‘Hints’ to Automatic Motion Planners Providing Haptic ‘Hints’ to Automatic Motion Planners Burchan Bayazit Joint Work With Nancy Amato.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Dongkyu, Choi.
CS 326A: Motion Planning Non-Holonomic Motion Planning.
Sampling Strategies for Probabilistic Roadmaps Random Sampling for capturing the connectivity of the C-space:
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2004/index.htm Collision Detection and Distance Computation.
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,
A General Framework for Sampling on the Medial Axis of the Free Space Jyh-Ming Lien, Shawna Thomas, Nancy Amato {neilien,
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Configuration Space – Basic Path-Planning Methods.
Motion Planning in Dynamic Environments Jur van den Berg.
CS 326A: Motion Planning Basic Motion Planning for a Point Robot.
The University of North Carolina at CHAPEL HILL A Simple Path Non-Existence Algorithm using C-obstacle Query Liang-Jun Zhang.
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 326 A: Motion Planning Coordination of Multiple Robots.
CS 326A: Motion Planning Probabilistic Roadmaps: Sampling and Connection Strategies.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Collision Detection and Distance Computation.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Chris Allocco.
Providing Haptic ‘Hints’ to Automatic Motion Planners Providing Haptic ‘Hints’ to Automatic Motion Planners Burchan Bayazit Joint Work With Nancy Amato.
Providing Haptic ‘Hints’ to Automatic Motion Planners Providing Haptic ‘Hints’ to Automatic Motion Planners by Burchan Bayazit Department of Computer Science.
Anna Yershova Dept. of Computer Science University of Illinois
Constraints-based Motion Planning for an Automatic, Flexible Laser Scanning Robotized Platform Th. Borangiu, A. Dogar, A. Dumitrache University Politehnica.
World space = physical space, contains robots and obstacles Configuration = set of independent parameters that characterizes the position of every point.
The Stochastic Motion Roadmap: A Sampling Framework for Planning with Markov Motion Uncertainty Changsi An You-Wei Cheah.
Robotics Chapter 5 – Path and Trajectory Planning
Real Time Motion Planning. Introduction  What is Real time Motion Planning?  What is the need for real time motion Planning?  Example scenarios in.
Dynamic-Domain RRTs Anna Yershova, Steven M. LaValle 03/08/2006.
Path Planning for a Point Robot
Modeling & Planning Deniz Güven Needle Insertion.
Motion Planning for Deformable Robots Serhat Tekin 11/7/2006.
Introduction to Motion Planning
NUS CS5247 Dynamically-stable Motion Planning for Humanoid Robots Presenter Shen zhong Guan Feng 07/11/2003.
Tree-Growing Sample-Based Motion Planning
Robotics Chapter 5 – Path and Trajectory Planning
Randomized Kinodynamics Planning Steven M. LaVelle and James J
Motion Planning Howie CHoset. Assign HW Algorithms –Start-Goal Methods –Map-Based Approaches –Cellular Decompositions.
Planning Tracking Motions for an Intelligent Virtual Camera Tsai-Yen Li & Tzong-Hann Yu Presented by Chris Varma May 22, 2002.
Interactive Continuous Collision Detection for Polygon Soups Xin Huang 11/20/2007.
Interactive Reach Planning for Animated Characters Using Hardware Acceleration Ying Liu Center for Human Modeling and Simulation Department of Computer.
Autonomous Robots Robot Path Planning (2) © Manfred Huber 2008.
Optimal Acceleration and Braking Sequences for Vehicles in the Presence of Moving Obstacles Jeff Johnson, Kris Hauser School of Informatics and Computing.
Robot Lab: Robot Path Planning
C-obstacle Query Computation for Motion Planning
Boustrophedon Cell Decomposition
Presented By: Aninoy Mahapatra
Faster Sample-based Motion Planning using Instance-based Learning
Real-Time Motion Planning
Planning.
Classic Motion Planning Methods
Presentation transcript:

Finding Critical Changes in Dynamic Configuration Spaces Yanyan Lu and Jyh-Ming Lien George Mason University

Problem Statement Plan motion in dynamic workspace Dynamic obstacle –moves along some known trajectory –with bounded velocities Image from “Constraint-Based Motion Planning using Voronoi Diagrams” Garber and Lin, WAFR02

Existing Problems No reusability in –Traditional methods using Configuration-Time space decomposition –Direct application of Probabilistic Roadmap Methods (PRM) or Rapidly-Exploring Random Tree (RRT)

Existing Problems More recent methods only repair the invalid portion but at fixed time interval –Fine time resolution results in low efficiency –Low time resolution results in low completeness Image from “An incremental learning approach to motion planning with roadmap management”, T-Y Li and Y-C Shie, ICRA ‘02

Our Work : Detect Topological Changes of Free C-Space time of contact time of separation time of contact

Our Work : Approximate Topological Changes time of contact time of separation time of contact

Main Results 1.Detect topology changes of free space using – time of contact: based on conservative advancement for objects with non-linear motions – time of separation: based on penetration depth 2.Maintain high reusability between critical changes As a result, A more complete representation of free CT-space than approaches with fixed time resolution Significant improvements on efficiency (at least one order of magnitude faster) observed in our experiments