CS 326 A: Motion Planning Exploring and Inspecting Environments.

Slides:

Advertisements

Similar presentations

J. P. L a u m o n d L A A S – C N R S M a n i p u l a t i o n P l a n n i n g A Geometrical Formulation.

Advertisements

Complete Motion Planning

Motion Planning for Point Robots CS 659 Kris Hauser.

The Voronoi Diagram David Johnson. Voronoi Diagram Creates a roadmap that maximizes clearance –Can be difficult to compute –We saw an approximation in.

Probabilistic Roadmap

Iterative Relaxation of Constraints (IRC) Can’t solve originalCan solve relaxed PRMs sample randomly but… start goal C-obst difficult to sample points.

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:

1 Last lecture  Configuration Space Free-Space and C-Space Obstacles Minkowski Sums.

NUS CS5247 A Visibility-Based Pursuit-Evasion Problem Leonidas J.Guibas, Jean-Claude Latombe, Steven M. LaValle, David Lin, Rajeev Motwani. Computer Science.

Visibility-based Motion Planning Lecture slides for COMP presented by Georgi Tsankov.

Visibility-Based Pursuit-Evasion in a Polygonal Environment L.J. Guibas, J.C. Latombe, S.M. LaValle, D. Lin, and R. Motwani Finding an Unpredictable Target.

Integrating FEM-based deformable obstacles in PRM Comp768 project presentation Mert Sedef.

CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.

Buron Florian CS223b Target finding Visibility-Based Pursuit-Evasion in a Polygonal Environment. L.J. Guibas, J.C. Latombe, S.M. LaValle, D. Lin, and R.

CS 326 A: Motion Planning Coordination of Multiple Robots.

CS 326 A: Motion Planning Criticality-Based Planning.

Motion Planning. Basic Topology Definitions  Open set / closed set  Boundary point / interior point / closure  Continuous function  Parametric curve.

Randomized Planning for Short Inspection Paths Tim Danner and Lydia E. Kavraki 2000 Presented by David Camarillo CS326a: Motion Planning, Spring

1 Single Robot Motion Planning - II Liang-Jun Zhang COMP Sep 24, 2008.

CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Criticality-Based Motion Planning.

CS 326 A: Motion Planning Motion Planning for Deformable Objects.

CS 326 A: Motion Planning Navigation Through Virtual Environments.

CS 326A: Motion Planning Configuration Space. Motion Planning Framework Continuous representation (configuration space and related spaces + constraints)

CS 326 A: Motion Planning Instructor: Jean-Claude Latombe Teaching Assistant: Itay Lotan Computer Science.

CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Probabilistic Roadmaps: Basic Techniques.

CS 326 A: Motion Planning Assembly Planning.

1 Target Finding. 2 Example robot’s visibility region hiding region 1 cleared region robot.

CS 326A: Motion Planning Criticality-Based Motion Planning: Target Finding.

Laboratory for Perceptual Robotics – Department of Computer Science Whole-Body Collision-Free Motion Planning Brendan Burns Laboratory for Perceptual Robotics.

CS 326 A: Motion Planning Probabilistic Roadmaps Sampling and Connection Strategies.

CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Kinodynamic Planning and Navigation with Movable Obstacles.

CS 326 A: Motion Planning Exploring and Inspecting Environments.

Pursuit and Evasion CS326A: Motion Planning Spring 2003 Final Project Eric Ng Huy Nguyen.

CS 326 A: Motion Planning Manipulation Planning.

Randomized Planning for Short Inspection Paths Tim Danner Lydia E. Kavraki Department of Computer Science Rice University.

Sampling Strategies for Probabilistic Roadmaps Random Sampling for capturing the connectivity of the C-space:

RRT-Connect path solving J.J. Kuffner and S.M. LaValle.

CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2004/index.htm Collision Detection and Distance Computation.

NUS CS 5247 David Hsu Minkowski Sum Gokul Varadhan.

CS 326A: Motion Planning Basic Motion Planning for a Point Robot.

Sampling and Connection Strategies for PRM Planners Jean-Claude Latombe Computer Science Department Stanford University Abridged and Modified Version (D.H.)

1 Landmark-Based Robot Navigation A. Lazanas, J.-C. Latombe Presented by Tim Bretl.

CS 326 A: Motion Planning Target Tracking and Virtual Cameras.

Spring 2007 Motion Planning in Virtual Environments Dan Halperin Yesha Sivan TA: Alon Shalita Basics of Motion Planning (D.H.)

Finding an Unpredictable Target in a Workspace with Obstacles LaValle, Lin, Guibas, Latombe, and Motwani, 1997 CS326 Presentation by David Black-Schaffer.

CS 326 A: Motion Planning Collision Detection and Distance Computation.

Randomized Planning for Short Inspection Paths Tim Danner and Lydia E. Kavraki 2000 Presented by Dongkyu, Choi On the day of 28 th May 2003 CS326a: Motion.

CS 326A: Motion Planning Probabilistic Roadmaps: Sampling and Connection Strategies.

CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.

1 Single Robot Motion Planning Liang-Jun Zhang COMP Sep 22, 2008.

Providing Haptic ‘Hints’ to Automatic Motion Planners Providing Haptic ‘Hints’ to Automatic Motion Planners by Burchan Bayazit Department of Computer Science.

CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Collision Detection and Distance Computation.

NUS CS5247 Motion Planning for Humanoid Robots Presented by: Li Yunzhen.

Deterministic Sampling Methods for Spheres and SO(3) Anna Yershova Steven M. LaValle Dept. of Computer Science University of Illinois Urbana, IL, USA.

Pursuit / Evasion in Polygonal and General Regions The Work: by LaValle et al. The Presentation: by Geoff Hollinger and Thanasis Ke(c)hagias.

Behrouz Haji Soleimani Dr. Moradi. Outline What is uncertainty? Some examples Solutions to uncertainty Ignoring uncertainty Markov Decision Process (MDP)

Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.

CS B659: Principles of Intelligent Robot Motion Configuration Space.

Modeling & Planning Deniz Güven Needle Insertion.

Deterministic Sampling Methods for Spheres and SO(3) Anna Yershova Steven M. LaValle Dept. of Computer Science University of Illinois Urbana, IL, USA.

Configuration Spaces for Translating Robots Minkowsi Sum/Difference David Johnson.

NUS CS5247 Dynamically-stable Motion Planning for Humanoid Robots Presenter Shen zhong Guan Feng 07/11/2003.

Tree-Growing Sample-Based Motion Planning

Lecture 4: Improving the Quality of Motion Paths Software Workshop: High-Quality Motion Paths for Robots (and Other Creatures) TAs: Barak Raveh,

Instructor Prof. Shih-Chung Kang 2008 Spring

Example robot cleared region robot’s visibility region hiding region 2

Motion Planning for a Point Robot (2/2)

Last lecture Configuration Space Free-Space and C-Space Obstacles

Sampling and Connection Strategies for Probabilistic Roadmaps

Presentation transcript:

CS 326 A: Motion Planning Exploring and Inspecting Environments

Criticality-Based Motion Planning C-space, Motion space, … Define property P Find where P changes  geometric arrangement: - critical curves/surfaces, - regular regions (cells)

Criticality-Based Motion Planning Property P: Is closest to a single point in the obstacle boundary

Criticality-Based Motion Planning Property P: Blocking relation among parts

Goal d 1 (L-Left Touch) d 2 (L-Right Exit) Criticality-Based Motion Planning

Start Goal

Criticality-Based Motion Planning

(Part orientation – Goldberg)

Criticality-Based Motion Planning (target finding)

Approach is practical only in low- dimensional spaces: - Combinatorial complexity of geometric arrangement - Sensitivity to floating-point computation errors (see European CGAL project) Criticality-Based Motion Planning

Today’s Papers  Planning of inspection paths: T. Danner and L.E. Kavraki. Randomized Planning for Short Inspection Paths. IEEE Int. Conf. on Robotics & Autom., San Francisco, April  Art gallery + PRM + TSP  Target finding: - S. LaValle et al.. Visibility-Based Pursuit-Evasion in a Polygonal Environment. 5th Workshop on Algorihtms and Data Structures, S.M. LaValle et al.. Finding an Unpredictable Target in a Workspace with Obstacles. IEEE Int. Conf. on Robotics & Autom.,  Criticality-based planning + information state space