A graph search algorithm for indoor pursuit/evasion

DOI10.1016/j.mcm.2009.06.011zbMath1185.91048MaRDI QIDQ970034

Athanasios Kehagias, Geoffrey Hollinger, Sanjiv Singh

Publication date: 8 May 2010

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2009.06.011

zbMATH Keywords

robotics; graph search; pursuit evasion

Mathematics Subject Classification ID

91A43: Games involving graphs

05C85: Graph algorithms (graph-theoretic aspects)

91A24: Positional games (pursuit and evasion, etc.)

Related Items

Connected searching of weighted trees, Continuous graph partitioning for camera network surveillance, On the Capture Time of Cops and Robbers Game on a Planar Graph

Uses Software

• Triangle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An annotated bibliography on guaranteed graph searching
• Delaunay refinement algorithms for triangular mesh generation
• Searching and pebbling
• Vertex-to-vertex pursuit in a graph
• Robot motion planning: A game-theoretic foundation
• A note on \(k\)-cop, \(l\)-robber games on graphs
• The complexity of searching a graph
• Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
• Visibility-based pursuit-evasion in a polygonal environment
• Recontamination does not help to search a graph
• Graph-Theoretic Concepts in Computer Science