Visibility-based pursuit-evasion in a polygonal environment

DOI10.1007/3-540-63307-3_45MaRDI QIDQ5096922zbMATH OpenOpenAlexFDO

Authors Jean-Claude Latombe, Steven M. LaValle, David C. Lin, Leonidas 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

complete algorithminformation spacemobile robotplanar graphsimple polygon

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Capture bounds for visibility-based pursuit evasion
• Capture bounds for visibility-based pursuit evasion
• scientific article; zbMATH DE number 1754612
• scientific article; zbMATH DE number 2080272
• Visibility-based pursuit-evasion with bounded speed

Cites work

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

Cited in

(16)

• A framework for pursuit evasion games in
• Clearing an orthogonal polygon to find the evaders
• Tracking an omnidirectional evader with a differential drive robot at a bounded variable distance
• Cooperative pursuit with Voronoi partitions
• A leapfrog strategy for pursuit-evasion in a polygonal environment
• Visibility-based pursuit-evasion with bounded speed
• Motion strategies for surveillance
• scientific article; zbMATH DE number 1754612 (Why is no real title available?)
• Capture bounds for visibility-based pursuit evasion
• An efficient algorithm for a visibility-based surveillance-evasion game
• Line-of-sight pursuit in monotone and scallop polygons
• Capture bounds for visibility-based pursuit evasion
• A visual feedback-based time-optimal motion policy for capturing an unpredictable evader
• Time-optimal surveillance between two differential drive robots with a limited field of view
• Optimizing visibility-based search in polygonal domains
• A graph search algorithm for indoor pursuit/evasion

This page was built for publication: Visibility-based pursuit-evasion in a polygonal environment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096922)