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

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: ,
Reactive and Potential Field Planners
Probabilistic Roadmaps. The complexity of the robot’s free space is overwhelming.
Sensor Based Planners Bug algorithms.
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
Visibility Graphs May Shmuel Wimer Bar-Ilan Univ., Eng. Faculty Technion, EE Faculty.
University of Amsterdam Search, Navigate, and Actuate - Quantitative Navigation Arnoud Visser 1 Search, Navigate, and Actuate Quantative Navigation.
Probabilistic Roadmap
A Comparative Study of Probabilistic Roadmap Planners Roland Geraerts Mark Overmars.
Probabilistic Roadmaps Sujay Bhattacharjee Carnegie Mellon University.
SA-1 Probabilistic Robotics Probabilistic Sensor Models Beam-based Scan-based Landmarks.
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.
CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.
Motion Planning & Robot Planning
1 Probabilistic Roadmaps CS 326A: Motion Planning.
1 Single Robot Motion Planning - II Liang-Jun Zhang COMP Sep 24, 2008.
MAE 552 – Heuristic Optimization Lecture 27 April 3, 2002
1 Motion Planning Algorithms : BUG-family. 2 To plan a path  find a continuous trajectory leading from initial position of the automaton (a mobile robot)
1 On the Probabilistic Foundations of Probabilistic Roadmaps D. Hsu, J.C. Latombe, H. Kurniawati. On the Probabilistic Foundations of Probabilistic Roadmap.
Sampling Strategies for Narrow Passages Presented by Irena Pashchenko CS326A, Winter 2004.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Probabilistic Roadmaps: Basic Techniques.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Kavraki, Svestka, Latombe, Overmars 1996 Presented by Dongkyu, Choi.
Interactive Navigation in Complex Environments Using Path Planning Salomon et al.(2003) University of North Carolina Presented by Mohammed Irfan Rafiq.
Randomized Planning for Short Inspection Paths Tim Danner Lydia E. Kavraki Department of Computer Science Rice University.
1 Path Planning in Expansive C-Spaces D. HsuJ. –C. LatombeR. Motwani Prepared for CS326A, Spring 2003 By Xiaoshan (Shan) Pan.
RRT-Connect path solving J.J. Kuffner and S.M. LaValle.
NUS CS 5247 David Hsu1 Last lecture  Multiple-query PRM  Lazy PRM (single-query PRM)
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 326A: Motion Planning Basic Motion Planning for a Point Robot.
Workspace-based Connectivity Oracle An Adaptive Sampling Strategy for PRM Planning Hanna Kurniawati and David Hsu Presented by Nicolas Lee and Stephen.
Steiner trees Algorithms and Networks. Steiner Trees2 Today Steiner trees: what and why? NP-completeness Approximation algorithms Preprocessing.
CS 326 A: Motion Planning Probabilistic Roadmaps Basic Techniques.
Backtracking.
Roadmap Methods How do I get there? Visibility Graph Voronoid Diagram.
Introduction to Robot Motion Planning. Example A robot arm is to build an assembly from a set of parts. Tasks for the robot: Grasping: position gripper.
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 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.
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.
On Delaying Collision Checking in PRM Planning – Application to Multi-Robot Coordination By: Gildardo Sanchez and Jean-Claude Latombe Presented by: Michael.
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
Laboratory of mechatronics and robotics Institute of solid mechanics, mechatronics and biomechanics, BUT & Institute of Thermomechanics, CAS Mechatronics,
Robotics Chapter 5 – Path and Trajectory Planning
Randomized Kinodynamics Planning Steven M. LaVelle and James J
Autonomous Robots Robot Path Planning (3) © Manfred Huber 2008.
Motion Planning Howie CHoset. Assign HW Algorithms –Start-Goal Methods –Map-Based Approaches –Cellular Decompositions.
Planning and Navigation. 6 Competencies for Navigation Navigation is composed of localization, mapping and motion planning – Different forms of motion.
Randomized KinoDynamic Planning Steven LaValle James Kuffner.
How do I get there? Roadmap Methods Visibility Graph Voronoid Diagram.
Solving problems by searching
CS 326A: Motion Planning Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe,
Motion Planning for a Point Robot (2/2)
Last lecture Configuration Space Free-Space and C-Space Obstacles
Probabilistic Roadmap Motion Planners
Boustrophedon Cell Decomposition
Presented By: Aninoy Mahapatra
Path Planning using Ant Colony Optimisation
Configuration Space of an Articulated Robot
Motion Planning for a Point Robot (1/2)
Presentation transcript:

Robot Motion Planning Bug 2 Probabilistic Roadmaps Bug 2 Probabilistic Roadmaps

Bugs 2 q init q target M-line LjLj HjHj New leave point condition: d<d(H j,Target)

Bug 2 Algorithm 1.From point L j-1 move along M-line until: a. Target is reached. Stop b.An obstacle is hit at H j. Goto 2 2.Turn left and follow the boundary until: a.Target is reached. Stop b.M-line met at distance d from target such that: d < dist(H j,q target ) Define L j, set j=j+1, and goto 1. c.If we return to H j without meeting the M-line, stop. The target is trapped.

A Hard Example for Bug 2

Some results N i B i with M-lineN i = number of intersections of B i with M-line Lemma:Lemma: in Bug2, any segment of the boundary is passed at most N i times TheoremTheorem: the length of the path verifies

Bug + Noncontact Sensors Suppose the robot is provided with info within a disk of radius r E.g.: vision, infra-red, ultrasonic The robot reconstructs at each point, the path that would generate with no info Result: smooth version of previous paths

Bug + Non Contact Sensor

Probabilistic Roadmaps Path planning algorithm are expensive If #DOFs’ is large, deterministic algorithms are not effective Solution: use a probabilistic roadmap planner (PRM). PRM are complete in a probabilistic sense An heuristic planner: potential fields. Disadvantage: local minima. Solution: randomize to escape local minima

PRM: Description Roadmap = undirect graph R = (N, E ) N : (nodes) set of selected configurations in C free E : (edges) collection of simple paths. The Local Paths Local paths are computed by the fast but not powerful local planner Idea: connect q init and q goal with q init ’ and q goal ’ in N Search R for a path

Preprocessing Phase Three stages 1.Roadmap construction. Objectives: a)Obtain reasonable connected graph b)Be sure “difficult regions contain a few nodes 2.Roadmap expansion. Objectives: Improve graph connectivity by selecting nodes of R which lie in (heuristic) difficult regions and adding nodes there 3.Roadmap Component reduction. Optional. Attempts to simplify the graph

Roadmap Construction Initially R is empty Repeatedly, generate & add a free configuration to R For every new q, select some nodes in R and try to connect them to q using local planner On success, add the edge (q, q’ ) to E  : C free × C free  {0,1} is a local function returned by local planner D: pseudo metric in C free

Create random configurations

Update Neighboring Nodes’ Edges

Connected nodes End of Construction Step

Expansion Step

End of Expansion Step

Select start and goal StartGoal

Connect Start and Goal to Roadmap StartGoal

Find the Path from Start to Goal Start Goal

Roadmap construction algorithm 1. 1.N  ø – E  ø 2. 2.Loop 3. 3.q  randomly selected free configuration 4. 4.N q a set of candidate neighbors of q from N 5. 5.N = N  {q}  q’  N q in order of increasing D(q,q’ ), do 7. 7.If q, q’ are not in the same connected comp. and  (q,q ’ ) =1, then E  E  {(q, q’ )} 8. 8.Update R’s connected components How? Algorithm? Meaning? Select

Creation of Random Configurations Nodes of R = uniform random sampling of C free Obtain q by drqwing each of its coords. From allowed interval for the corresponding DOF Check q for collisions If q is collision-free, add it to N. Otherwise discard

The Local Planner Deterministic vs. Non-deterministic planner Powerful planer = slower planner Empirical results: use deterministic and simple but very fast planner Example: connect two configurations by a straight line in configuration space Check for collisions by bisection

Node Neighbors Choice of N q is important. Local planner is used for all q’s in N q N q ={q’  N / MaxDist  D(q,q’)} Skip nodes in the same connected component Heuristics: bound the size of N q by some K. This gives independence on the size of R

Distance Function DD is used for constructing & sorting N q Hopefully, D reflect the chance that the local planner will fail Simple selection that works in practice: D(q,q’)=max x  Robot ||x(q)-x(q’)||

Roadmap Expansion N should be a fair enough covering of C free R often consists of a few large components and several small ones Expansion = add nodes to form a large component with as many nodes as possible Try to cover the “difficult” parts of C free Define weight w(q). Large w  q is in a difficult region Add M nodes to the collection