Interactive Navigation in Complex Environments Using Path Planning Salomon et al.(2003) University of North Carolina Prepared By Xiaoshan Pan.

Slides:

Advertisements

Similar presentations

Solving problems by searching

Advertisements

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

Motion Planning for Point Robots CS 659 Kris Hauser.

NUS CS5247 Motion Planning for Camera Movements in Virtual Environments By Dennis Nieuwenhuisen and Mark H. Overmars In Proc. IEEE Int. Conf. on Robotics.

Probabilistic Path Planner by Someshwar Marepalli Pratik Desai Ashutosh Sahu Gaurav jain.

By Lydia E. Kavraki, Petr Svestka, Jean-Claude Latombe, Mark H. Overmars Emre Dirican

Motion Planning CS 6160, Spring 2010 By Gene Peterson 5/4/2010.

Visibility Graph and Voronoi Diagram CS Tutorial.

Motion Planning for Tower Crane Operation. Motivation  Tower crane impacts the schedule greatly  Safety of tower crane operation is critical.

Kinodynamic Path Planning Aisha Walcott, Nathan Ickes, Stanislav Funiak October 31, 2001.

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.

2 4 Theorem:Proof: What shall we do for an undirected graph?

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,

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

1 Perfect Simulation and Stationarity of a Class of Mobility Models Jean-Yves Le Boudec (EPFL) Milan Vojnovic (Microsoft Research Cambridge)

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 Probabilistic Roadmaps Basic Techniques.

Precomputed Search Trees: Planning for Interactive Goal-Driven Animation Manfred Lau and James Kuffner Carnegie Mellon University.

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.

Motion Planning for Camera Movements in Virtual Environments Authors: D. Nieuwenhuisen, M. Overmars Presenter: David Camarillo.

CS326 1 An Intelligent User Interface with Motion Planning for 3D Navigation Tsai-Yen Li and Hung-Kai Ting Computer Science Department, National Chengchi.

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.

Multi-Agent explore and retrieve Chris Enedah Andreas Edlund.

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

Interactive Navigation in Complex Environments Using Path Planning Salomon et al.(2003) University of North Carolina Presented by Mohammed Irfan Rafiq.

Motion Planning for Tower Crane Operation CS236A Prof. Latombe Shan Pan | Jessy Kang.

Planning for Humanoid Robots Presented by Irena Pashchenko CS326a, Winter 2004.

1 Path Planning in Expansive C-Spaces D. HsuJ. –C. LatombeR. Motwani Prepared for CS326A, Spring 2003 By Xiaoshan (Shan) Pan.

Presented By: Huy Nguyen Kevin Hufford

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,

Roadmap Methods How do I get there? Visibility Graph Voronoid Diagram.

CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Configuration Space – Basic Path-Planning Methods.

Robot Motion Planning Bug 2 Probabilistic Roadmaps Bug 2 Probabilistic Roadmaps.

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.

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.

Solving problems by searching

CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.

Roadmap Methods How do I get there? Visibility Graph Voronoid Diagram.

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.

Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Lydia E. Kavraki Petr Švetka Jean-Claude Latombe Mark H. Overmars Presented.

A Randomized Approach to Robot Path Planning Based on Lazy Evaluation Robert Bohlin, Lydia E. Kavraki (2001) Presented by: Robbie Paolini.

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.

Visibility Graphs and Cell Decomposition By David Johnson.

© Manfred Huber Autonomous Robots Robot Path Planning.

Path Planning for a Point Robot

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.

Motion Planning in Games Mark Overmars Utrecht University.

Wandering Standpoint Algorithm. Wandering Standpoint Algorithm for local path planning Description: –Local path planning algorithm. Required: –Local distance.

UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.

Administration Feedback on assignment Late Policy

A Grasp-Based Motion Planning Algorithm for Character Animation M. Kalisiak, M. van de Panne Eurographics Workshop on Computer Animation & Simulation 2000.

Randomized Kinodynamics Planning Steven M. LaVelle and James J

3-D Information cs5764: Information Visualization Chris North.

Project by: Qi-Xing & Samir Menon. Motion Planning for the Human Hand Generate Hand Skeleton Define Configuration Space Sample Configuration Space for.

Department of Computer Science Columbia University rax Dynamically-Stable Motion Planning for Humanoid Robots Paper Presentation James J. Kuffner,

Autonomous Robots Robot Path Planning (2) © Manfred Huber 2008.

How do I get there? Roadmap Methods Visibility Graph Voronoid Diagram.

Solving problems by searching

Instructor Prof. Shih-Chung Kang 2008 Spring

CS 326A: Motion Planning Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe,

Path Planning using Ant Colony Optimisation

Presentation transcript:

Interactive Navigation in Complex Environments Using Path Planning Salomon et al.(2003) University of North Carolina Prepared By Xiaoshan Pan

Content n 1 st section (3/4) – Pre-compute a global roadmap – Graph search (ini  goal) in real-time – Display motion n 2 nd section (1/4) – User-steered exploration

Basic Idea Preprocessing phase Runtime algorithm

Precomputation: Sampling Gravity Shooting rays Random Rays

Precomputation: Sampling Gravity Shooting rays өө Walkable surface Construct roadmap -Max # of samples -Min dist between samples

Connectors - Rc > Rg Rc Guards & Connectors (C-space) Reachability (vs. visibility) RgRg Guards - guards can’t see each other

- yes  reject c, goto while c - no! c becomes a Guard, connect to connectors (if any), goto while Algorithm (build_roadmap) While (map_coverage < P_cover), do// map_coverage = guards_reachable/entire_space Return roadmap Connector Guard Connector Guard Connector Guard 2. Can c be a Connector? See any Guards in Rc? - Yes  then connect, goto while (else goto 3) 1. Pick a random config. c c 3. Can c be a Guard? See any Guards in Rg? c Be a ConnectorBe a GuardBe rejected

Search for a path: init  goal n Initial position (Rc radius) ini goal n Goal position n Graph search…

Display Motion: Smooth Path n Walk along the path ini goal n Smoothing path (cutting redundant corners while walking)

User-steered exploration (local walk) n User has control – A directional vector n Robot always stays on a walkable surface – In free space – Surface within a tolerance angle – Steps ok, cliffs NO!! n Robot do not penetrate objects

Local Walk Algorithm n Follow the directional vector, if - Goal is reached, stop - Collision, project along obstacle edge - New surface, step up/down (not a cliff!) - Edge, step up/down or project along the edge

Discussion n Can deal with complex environment – Because it pre-computes a global roadmap. n Still… – Pre-computation could be time consuming. – Walking along line segments does not look natural. n Overall assessment: Pretty good