The searchlight problem for road networks
The problem of searching for an intruder hiding in a road network is introduced. Upper and lower bounds on the worst-case number of searchlights are presented. The proofs of the upper bounds induce algorithms for generating a search schedule.
the searchlight problem graph searching lines line segments grids