Multi-Agent explore and retrieve Chris Enedah Andreas Edlund.

Slides:



Advertisements
Similar presentations
Lecture 15. Graph Algorithms
Advertisements

1 Motion and Manipulation Configuration Space. Outline Motion Planning Configuration Space and Free Space Free Space Structure and Complexity.
Fall Path Planning from text. Fall Outline Point Robot Translational Robot Rotational Robot.
Approximations of points and polygonal chains
Motion Planning for Point Robots CS 659 Kris Hauser.
NUS CS5247 The Gaussian Sampling Strategy for Probalistic Roadmap Planners Valdrie Boor, Mark H. Overmars, A. Frank van der Stappen, 1999 Wai.
S. J. Shyu Chap. 1 Introduction 1 The Design and Analysis of Algorithms Chapter 1 Introduction S. J. Shyu.
1st Meeting Industrial Geometry Computational Geometry ---- Some Basic Structures 1st IG-Meeting.
DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.
Snakes - Active Contour Lecturer: Hagit Hel-Or
Visibility Computations: Finding the Shortest Route for Motion Planning COMP Presentation Eric D. Baker Tuesday 1 December 1998.
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.
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.
Creating Small Roadmaps for Solving Motion Planning Problems Roland Geraerts and Mark Overmars MMAR 2005.
Randomized Planning for Short Inspection Paths Tim Danner and Lydia E. Kavraki 2000 Presented by David Camarillo CS326a: Motion Planning, Spring
Motion Planning with Visibility Constraints Jean-Claude Latombe Computer Science Department Stanford University.
1 -1 Chapter 1 Introduction Why Do We Need to Study Algorithms? To learn strategies to design efficient algorithms. To understand the difficulty.
Interactive Navigation in Complex Environments Using Path Planning Salomon et al.(2003) University of North Carolina Prepared By Xiaoshan Pan.
Planning Paths for Elastic Objects Under Manipulation Constraints Florent Lamiraux Lydia E. Kavraki Rice University Presented by: Michael Adams.
Nature’s Algorithms David C. Uhrig Tiffany Sharrard CS 477R – Fall 2007 Dr. George Bebis.
CS 326A: Motion Planning Criticality-Based Motion Planning: Target Finding.
Randomized Planning for Short Inspection Paths Tim Danner Lydia E. Kavraki Department of Computer Science Rice University.
RRT-Connect path solving J.J. Kuffner and S.M. LaValle.
Roadmap Methods How do I get there? Visibility Graph Voronoid Diagram.
UNC Chapel Hill M. C. Lin Overview of Last Lecture About Final Course Project –presentation, demo, write-up More geometric data structures –Binary Space.
NUS CS 5247 David Hsu Minkowski Sum Gokul Varadhan.
CS 326A: Motion Planning Basic Motion Planning for a Point Robot.
New Algorithm DOM for Graph Coloring by Domination Covering
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.
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.
Roadmap Methods How do I get there? Visibility Graph Voronoid Diagram.
1 Single Robot Motion Planning Liang-Jun Zhang COMP Sep 22, 2008.
The Art Gallery Problem
The Art Gallery Problem
CSE53111 Computational Geometry TOPICS q Preliminaries q Point in a Polygon q Polygon Construction q Convex Hulls Further Reading.
Robot Motion Planning Computational Geometry Lecture by Stephen A. Ehmann.
Visibility Graphs and Cell Decomposition By David Johnson.
Minimal Spanning Trees What is a minimal spanning tree (MST) and how to find one.
Lab 3 How’d it go?.
Chapter 9 – Graphs A graph G=(V,E) – vertices and edges
ADA: 14. Intro to CG1 Objective o give a non-technical overview of Computational geometry, concentrating on its main application areas Algorithm.
May Motion Planning Shmuel Wimer Bar Ilan Univ., Eng. Faculty Technion, EE Faculty.
Computational Geometry The systematic study of algorithms and data structures for geometric objects, with a focus on exact algorithms that are asymptotically.
Convex Hull. What is the Convex Hull? Imagine a set of points on a board with a nail hammered into each point. Now stretch a rubber band over all the.
Ch. 6 - Approximation via Reweighting Presentation by Eran Kravitz.
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.
October 9, 2003Lecture 11: Motion Planning Motion Planning Piotr Indyk.
1 Triangulation Supplemental From O’Rourke (Chs. 1&2) Fall 2005.
Polyhedron Platonic Solids Cross Section
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
Computational Geometry The systematic study of algorithms and data structures for geometric objects, with a focus on exact algorithms that are asymptotically.
12.1 Exploring Solids.
Homework - hints Problem 1. Node weights  Edge weights
© The McGraw-Hill Companies, Inc., Chapter 1 Introduction.
Autonomous Robots Robot Path Planning (2) © Manfred Huber 2008.
Multiples and Lowest Common Multiple
Example robot cleared region robot’s visibility region hiding region 2
Do Now 1. Pick up one of each slip of paper 2
The Art Gallery Problem
C-obstacle Query Computation for Motion Planning
The Art Gallery Problem
Computational Geometry
CSE 373: Data Structures and Algorithms
(1) Breadth-First Search  S Queue S
Homework #6: Local Access Design
CSE 417: Algorithms and Computational Complexity
Minimax strategies, alpha beta pruning
Presentation transcript:

Multi-Agent explore and retrieve Chris Enedah Andreas Edlund

The problem ● Given: – A polygonal world in two dimensions. – Multiple disc robots. – Unknown number of artifacts at unknown positions. – A dropoff location. ● The problem: – Find and retrieve all artifacts and drop them off near the droppoff location. ● Applications: – Crashed airplane

Problem parts ● Roadmap placement ● Object retrieval

Roadmap placement ● Find the lowest number of guards in space that together can see every portion of space. ● Compute collision-free paths between these guards.

Sample space ● Uses rejection sampling.

Compute visible space ● For each node, compute the visible portions of all edges in the scene.

Compute visible space ● For each tripple (guard, cover edge, target edge). – First set the whole target edge to be one visible edge sgement. Guard Target edge Cover edge

Compute visible space ● Cast a “shadow” from the cover edge. Visible edge segments

Compute visible space ● Cut the visible edge segment using the shadow.

Result of the visibility computation ● Every node now has a set of visible edge segments. ● Each edge segment refers only to one guard. Edge Guard 1 Guard 2 Guard 3

Decomposition of the visible edge segments ● The edge is decomposed into smaller edge segments. Edge Guard 1 Guard 2 Guard Guard1 = {1,4,5,9} Guard2={1,2,8,9} Guard3={5,6}

Set cover ● The whole Art-gallery problem is reduced to a set cover problem. ● The set cover problem: – Find the smallest number of sets in R such that all elements in X is accounted for. R={{1, 4, 6, 7, 9}, {3, 5, 6}, {2, 5, 6, 8, 9}, {1, 3, 6, 10} X={1, 2, 3, 4, 5, 6, 7, 8, 9, 10}

Set cover ● The set cover problem is NP-hard so coming up with a perfect solution is infeasible. ● Use a greedy algorithm instead. R={{1, 4, 6, 7, 9}, {3, 5, 6}, {2, 5, 6, 8, 9}, {1, 3, 6, 10} X={1, 2, 3, 4, 5, 6, 7, 8, 9, 10}

Set cover ● Select the largest set in R and remove it. ● Remove all elements in this set from X. ● Remove all elements in this set from all other sets in R. R={{3, 5}, {2, 5, 8,}, {3, 10} X={2, 3, 5, 8, 10} Selected: {1, 4, 6, 7, 9}

Set cover ● Same thing again. R={{3}, {3, 10} X={3, 10} Selected: {1, 4, 6, 7, 9} {2, 5, 8}

Set cover ● And again... R={} X={} Selected: {1, 4, 6, 7, 9} {2, 5, 8} {3, 10}

Placing the roadmap ● We want every pair of guards to connect to each other. – Place additional nodes at all the convex vertices of the scene. – Do A*-searches between every pair of guards.

Placing the roadmap

Problems ● The visibility computation is slow – O(mn 2 ) – m – number of samples – n – number of edges ● The rest “should” have the same time complexity as in the paper.