Visibility-based pursuit-evasion in a polygonal environment

DOI10.1007/3-540-63307-3_45zbMath1497.68472MaRDI QIDQ5096922

Jean-Claude Latombe, David C. Lin, S. M. LaValle, Leonidas J. Guibas, Rajeev Motwani

Publication date: 19 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63307-3_45

zbMATH Keywords

mobile robot; planar graph; simple polygon; complete algorithm; information space

Mathematics Subject Classification ID

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68T40: Artificial intelligence for robotics

Related Items

Cooperative pursuit with Voronoi partitions, A graph search algorithm for indoor pursuit/evasion, A framework for pursuit evasion games in, Tracking an omnidirectional evader with a differential drive robot at a bounded variable distance, Visibility-Based Pursuit-Evasion with Bounded Speed

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomization for robot tasks: using dynamic programming in the space of knowledge states
• Optimum watchman routes
• Min Cut is NP-complete for edge weighted trees
• Dynamic noncooperative game theory
• Pursuit games. An introduction to the theory and applications of differential games of pursuit and evasion
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• The complexity of searching a graph
• A Separator Theorem for Planar Graphs
• Monotonicity in graph searching
• Searching for a Mobile Intruder in a Polygonal Region
• SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
• Recontamination does not help to search a graph