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

Slides:



Advertisements
Similar presentations
Great Theoretical Ideas in Computer Science for Some.
Advertisements

Spatial Embedding of Pseudo-Triangulations Peter Braß Institut für Informatik Freie Universität Berlin Berlin, Germany Franz Aurenhammer Hannes Krasser.
UNC Chapel Hill Lin/Foskey/Manocha Steps in DP: Step 1 Think what decision is the “last piece in the puzzle” –Where to place the outermost parentheses.
Partial Order Reduction: Main Idea
Approximations of points and polygonal chains
Lecture 24 Coping with NPC and Unsolvable problems. When a problem is unsolvable, that's generally very bad news: it means there is no general algorithm.
Label Placement and graph drawing Imo Lieberwerth.
03/12/02 (c) 2002 University of Wisconsin, CS559 Last Time Some Visibility (Hidden Surface Removal) algorithms –Painter’s Draw in some order Things drawn.
UNC Chapel Hill M. C. Lin Polygon Triangulation Chapter 3 of the Textbook Driving Applications –Guarding an Art Gallery –3D Morphing.
Feb Polygon Triangulation Shmuel Wimer Bar Ilan Univ., School of Engineering.
Steps in DP: Step 1 Think what decision is the “last piece in the puzzle” –Where to place the outermost parentheses in a matrix chain multiplication (A.
1 Last lecture  Configuration Space Free-Space and C-Space Obstacles Minkowski Sums.
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.
Geometric reasoning about mechanical assembly By Randall H. Wilson and Jean-Claude Latombe Henrik Tidefelt.
Geometric Reasoning About Mechanical Assembly By Randall H. Wilson and Jean-Claude Latombe Presented by Salik Syed and Denise Jones.
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.
Randomized Planning for Short Inspection Paths Tim Danner and Lydia E. Kavraki 2000 Presented by David Camarillo CS326a: Motion Planning, Spring
Multi-Arm Manipulation Planning (1994) Yoshihito Koga Jean-Claude Latombe.
Motion Planning with Visibility Constraints Jean-Claude Latombe Computer Science Department Stanford University.
- 1 - Intentional Mobility in Wireless Sensor Networks Deployment, Dispatch, and Applications Dr. You-Chiun Wang ( 王友群 ) Department of Computer Science,
1 Geometry A line in 3D space is represented by  S is a point on the line, and V is the direction along which the line runs  Any point P on the line.
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.
Pursuit and Evasion CS326A: Motion Planning Spring 2003 Final Project Eric Ng Huy Nguyen.
Randomized Planning for Short Inspection Paths Tim Danner Lydia E. Kavraki Department of Computer Science Rice University.
Navigation and Motion Planning for Robots Speaker: Praveen Guddeti CSE 976, April 24, 2002.
25/06/2015Marius Mikucionis, AAU SSE1/22 Principles and Methods of Testing Finite State Machines – A Survey David Lee, Senior Member, IEEE and Mihalis.
1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.
Finding an Unpredictable Target in a Workspace with Obstacles LaValle, Lin, Guibas, Latombe, and Motwani, 1997 CS326 Presentation by David Black-Schaffer.
NP-complete and NP-hard problems. Decision problems vs. optimization problems The problems we are trying to solve are basically of two kinds. In decision.
The Art Gallery Problem
The Art Gallery Problem
1 DARPA TMR Program Collaborative Mobile Robots for High-Risk Urban Missions Second Quarterly IPR Meeting January 13, 1999 P. I.s: Leonidas J. Guibas and.
Visibility Graphs and Cell Decomposition By David Johnson.
Comment reconstruire le graphe de visibilité d’un polygone? (Reconstructing visibility graphs of polygons) Jérémie Chalopin, Shantanu Das LIF, Aix-Marseille.
9/7/06CS 6463: AT Computational Geometry1 CS 6463: AT Computational Geometry Fall 2006 Triangulations and Guarding Art Galleries Carola Wenk.
Pursuit / Evasion in Polygonal and General Regions The Work: by LaValle et al. The Presentation: by Geoff Hollinger and Thanasis Ke(c)hagias.
Physical Mapping of DNA Shanna Terry March 2, 2004.
UNC Chapel Hill M. C. Lin Point Location Reading: Chapter 6 of the Textbook Driving Applications –Knowing Where You Are in GIS Related Applications –Triangulation.
CAFE router: A Fast Connectivity Aware Multiple Nets Routing Algorithm for Routing Grid with Obstacles Y. Kohira and A. Takahashi School of Computer Science.
Artificial Intelligence Lecture 9. Outline Search in State Space State Space Graphs Decision Trees Backtracking in Decision Trees.
May 1, 2002Applied Discrete Mathematics Week 13: Graphs and Trees 1News CSEMS Scholarships for CS and Math students (US citizens only) $3,125 per year.
Multiway Trees. Trees with possibly more than two branches at each node are know as Multiway trees. 1. Orchards, Trees, and Binary Trees 2. Lexicographic.
DARPA TMR Program Collaborative Mobile Robots for High-Risk Urban Missions Third Quarterly IPR Meeting May 11, 1999 P. I.s: Leonidas J. Guibas and Jean-Claude.
Ch. 6 - Approximation via Reweighting Presentation by Eran Kravitz.
Introduction to Algorithms Jiafen Liu Sept
Coordinated exploration of labyrinthine environments with application to the “pursuit- evasion” problem Leibniz Laboratory Magma team Damien Pellier –
Discrete Structures Lecture 12: Trees Ji Yanyan United International College Thanks to Professor Michael Hvidsten.
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
Navigation & Motion Planning Cell Decomposition Skeletonization Bounded Error Planning (Fine-motion Planning) Landmark-based Planning Online Algorithms.
© The McGraw-Hill Companies, Inc., Chapter 12 On-Line Algorithms.
Two Finger Caging of Concave Polygon Peam Pipattanasomporn Advisor: Attawith Sudsang.
Search in State Spaces Problem solving as search Search consists of –state space –operators –start state –goal states A Search Tree is an efficient way.
11 -1 Chapter 12 On-Line Algorithms On-Line Algorithms On-line algorithms are used to solve on-line problems. The disk scheduling problem The requests.
9/8/10CS 6463: AT Computational Geometry1 CS 6463: AT Computational Geometry Fall 2010 Triangulations and Guarding Art Galleries Carola Wenk.
Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network You-Chiun Wang, Chun-Chi Hu, and Yu-Chee Tseng IEEE Transactions on Mobile Computing.
The NP class. NP-completeness Lecture2. The NP-class The NP class is a class that contains all the problems that can be decided by a Non-Deterministic.
Grade 11 AP Mathematics Graph Theory Definition: A graph, G, is a set of vertices v(G) = {v 1, v 2, v 3, …, v n } and edges e(G) = {v i v j where 1 ≤ i,
Autonomous Robots Robot Path Planning (2) © Manfred Huber 2008.
Prof. Yu-Chee Tseng Department of Computer Science
CMPS 3130/6130 Computational Geometry Spring 2017
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
Example robot cleared region robot’s visibility region hiding region 2
Software Engineering (CSI 321)
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
The Art Gallery Problem
The Art Gallery Problem
Graphs Chapter 13.
Haskell Tips You can turn any function that takes two inputs into an infix operator: mod 7 3 is the same as 7 `mod` 3 takeWhile returns all initial.
Presentation transcript:

NUS CS5247 A Visibility-Based Pursuit-Evasion Problem Leonidas J.Guibas, Jean-Claude Latombe, Steven M. LaValle, David Lin, Rajeev Motwani. Computer Science Department Stanford University Stanford, CA presented by: Michał Marzec

NUS CS52472 Motivation  Applications: robotics applications: surveillance, air traffic control, military strategy, security systems. Two decision makers have totally opposing interests.  But applications are not only limited to adversarial targets… strategies to automatically locate another robot, items in a factory or people in a search/rescue effort.  We want such strategies to be carried out without human intervention. Automation of tasks.

NUS CS52473 Problem Formulation  The free space contains two types of moving actors: one or more pursuers and one evader.  We assume that any of pursuers know the initial position of the evader. We don’t know how it moves nor how fast it moves. We cannot do any prediction with respect to the moves of the evader.  How to we approach this problem? We associate a visibility region with each of the pursuers. Those may partially overlap. Each pursuer can actually see a portion of the free space.  What do we want to do? The purpose it to catch the evader, but… What do we mean by “capture”? The evader must lie in visibility region of at least one of pursuers.  The pursuers need to make sure that the space that has already been explored remains clear. They have to prevent the evader from intruding to the portion of the space that has already been searched.  It’s interesting to perform this task with minimum number of pursuers. How to determine the minimum number of pursuers that guarantees that the solution will be found?

NUS CS52474 Simple examples

NUS CS52475 Mathematical definition of the problem.  The pursuers and the evader are represented as moving points.  The initial position of the evader is unknown (e(0) = ? ) and e(t) denotes the position of the evader at any time t > 0.  We need to distinguish different zones in the free space: contaminated – might contain the evader. cleared – no evader lying in this region. recontaminated – region that has changed it’s statuses from contaminated to cleared and to contaminated again. Position of the i-th pursuer at t >= 0 Continuous path of the i-th pursuer. Motion strategy. Visibility region of any q lying in F. Is a solution strategy H(F) represents the minimum number of pursuers.

NUS CS52476 More complex cases. How about this geometry of the space? Is one pursuer still sufficient to search the space? Response: No Reason: because of holes.

NUS CS52477 Proposed solutions.  To have as many static guards as we need to completely cover the space and guarantee that any evader is immediately visible.  To have fewer pursuers but capable to move and search for an evader.  The presence of holes involves worsening of visibility. The pursuers have to penetrate farther into the corridors to check whether an evader does not hide there.

NUS CS52478 Theoretical results.  Complexity depends on topological and geometric complexity of F. For a space with h holes and n edges: For a simply connected free-space F at worst:

NUS CS52479 Proof of H(F) = 0(lg n). E 0,0E 1,0 E 1,1 E 2,0 E 2,1 E 2,3 E 2,2 E 0,0 E 1,0 E 1,1 E 2,1E 2,0 E 2,2E 2,3 Pursuers are placed on partition edges and we specify the motion strategy for N pursuers. This strategy guarantees that the evader will be seen. Partitioning is applied till the free space is triangulated.

NUS CS Proof of H(F) = 0(lg n). E 0,0E 1,0 E 1,1 E 2,0 E 2,1 E 2,3 E 2,2 E 0,0 E 1,0 E 1,1 E 2,1E 2,0 E 2,2E 2,3 Pursuers are placed on partition edges and we specify the motion strategy for N pursuers. This strategy guarantees that the evader will be seen. Partitioning is applied till the free space is triangulated.

NUS CS Proof of H(F) = 0(lg n). E 0,0E 1,0 E 1,1 E 2,0 E 2,1 E 2,3 E 2,2 E 0,0 E 1,0E 1,1 E 2,1E 2,0 E 2,2E 2,3 Pursuers are placed on partition edges and we specify the motion strategy for N pursuers. This strategy guarantees that the evader will be seen. Partitioning is applied till the free space is triangulated.

NUS CS Proof of H(F) = 0(lg n). E 0,0E 1,0 E 1,1 E 2,0 E 2,1 E 2,3 E 2,2 E 0,0 E 1,0E 1,1 E 2,1E 2,0E 2,2 E 2,3 Pursuers are placed on partition edges and we specify the motion strategy for N pursuers. This strategy guarantees that the evader will be seen. Partitioning is applied till the free space is triangulated.

NUS CS What does it show?  N = (lg n) corresponds to the height of the balanced binary tree.  Each pursuer takes cares about one level of the binary tree to search for an evader. ..so the height of the tree determines the sufficient number of pursuers, but not the minimal one.

NUS CS Usefulness of information states  What is an information state? It is an information provided by a moving visibility polygon of pursuer and which identifies all unique situations that can occur during the execution of a motion strategy. It tells us where the contaminated regions are and takes into account the positions of the pursuers.  An information space is a set of all possible information states.  We define a function that produces the information state when a specified strategy is applied between instants t0 and t1. We pass from one information state to another one after having executed a little portion of this strategy.

NUS CS Concept of conservative cells.  We search a finite cell complex that is constructed on the basis of critical information change.  A conservative cell preserves the information invariance property. In other terms when a pursuer moves along closed paths in a cell the information state is not altered. It remains stable independently of the chosen path (path invariance).  We construct a graph whose vertices correspond to the equivalence classes of the space. (conservative cells) This graph can be subsequently searched to find a solution strategy, without regard to the particular choice of path within each conservative cell.

NUS CS An algorithm for a single pursuer.  Partitioning of the space into conservative cells.  Why? We can partition the free space into convex cells by identify critical places at which edge visibility changes. GAP EDGE We associate binary labels to each gap edge: “1” – the portion of the space bordered by the gap is contaminated. “0” – otherwise (region is clear).

NUS CS An algorithm for a single pursuer.  B(q) is binary sequence of labels assigned to gaps at different instants.  q and B(q) represent the information state.  The pursuer moves so that the information state remains stable. The gap edges don’t disappear and appear and so on… The gaps continuously change during the pursuer motion but the corresponding gap edge label will not change. He moves in his cell without crossing the critical boundary.

NUS CS Ray shooting. Extension of obstacles edges to form edge-visibility cells.

NUS CS Searching the information space.  The cells and their adjacency relationships define the cell graph that must be searched. => find any sequence of cells in the graph that leave the pursuer at some position at which all gap labels are “0”. First we need to determine the correspondences between gap edges and search the graph using Dijkstra algorithm.

NUS CS Summary  The visibility-based problem is NP-hard. In the worst cases the number of information states is exponential. We also cannot clearly say whether all information states necessarily have to be represented and searched to determine a solution.  This is a visibility-based problem, so we require the pursuers to see and not to touch the evader.  The scenarios of this type have arisen in multiple applications such as robotics or surveillance with mobile robots or even search-rescue operations.  The complexity increases with number of edges.

NUS CS Extensions  Region of capture.  Include bounded velocity for the evader.  Consider a limited viewing angle ( more realistic)  Try to find the evader in minimum time ( improve the cost ).

NUS CS THE END