Searching for mobile intruders in a polygonal region by a group of mobile searchers

DOI10.1007/s00453-001-0045-3zbMath0980.68033OpenAlexW1982770663MaRDI QIDQ5946405

No author found.

Publication date: 4 March 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0045-3

zbMATH Keywords

searchingart gallery problemgraph search problempolygon search number

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (10)

Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers ⋮ Searching a polygonal region by a group of stationary \(k\)-searchers ⋮ Studying the stochastic capturing of moving intruders by mobile sensors ⋮ Meeting in a polygon by anonymous oblivious robots ⋮ Mobile sensor intrusion detection under any shape of curve ⋮ An annotated bibliography on guaranteed graph searching ⋮ A COMPLETE ALGORITHM FOR SEARCHLIGHT SCHEDULING ⋮ A unified and efficient solution to the room search problem ⋮ CLEARING A POLYGON WITH TWO 1-SEARCHERS ⋮ Bushiness and a tight worst-case upper bound on the search number of a simple polygon.

This page was built for publication: Searching for mobile intruders in a polygonal region by a group of mobile searchers