Searching for a Mobile Intruder in a Polygonal Region
From MaRDI portal
Publication:4015972
DOI10.1137/0221051zbMath0757.68098OpenAlexW2033649214MaRDI QIDQ4015972
Ichiro Suzuki, Masafumi Yamashita
Publication date: 6 December 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0221051
Related Items
Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers ⋮ An alternative proof for the equivalence of searcher and 2-searcher ⋮ NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY ⋮ Searching a polygonal region by a group of stationary \(k\)-searchers ⋮ Infrastructure security games ⋮ Sweeping simple polygons with the minimum number of chain guards ⋮ The lion and man game on polyhedral surfaces with obstacles ⋮ AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT ⋮ SEARCHING A ROOM BY TWO GUARDS ⋮ Optimal on-line algorithms for walking with minimum number of turns in unknown streets ⋮ Studying the stochastic capturing of moving intruders by mobile sensors ⋮ Total curvature and simple pursuit on domains of curvature bounded above ⋮ Visibility-based pursuit-evasion in a polygonal environment ⋮ A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable ⋮ Meeting in a polygon by anonymous oblivious robots ⋮ Searching for mobile intruders in circular corridors by two 1-searchers ⋮ The theory of guaranteed search on graphs ⋮ Clearing an orthogonal polygon to find the evaders ⋮ Unnamed Item ⋮ Optimum sweeps of simple polygons with two guards ⋮ Minimization of the maximum distance between the two guards patrolling a polygonal region ⋮ Characterizing and recognizing LR-visibility polygons ⋮ Mobile sensor intrusion detection under any shape of curve ⋮ Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem ⋮ An annotated bibliography on guaranteed graph searching ⋮ Capture bounds for visibility-based pursuit evasion ⋮ FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE ⋮ Visibility-Based Pursuit-Evasion with Bounded Speed ⋮ Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles ⋮ Escaping offline searchers and isoperimetric theorems ⋮ A unified and efficient solution to the room search problem ⋮ SEARCHING A POLYGONAL REGION FROM THE BOUNDARY ⋮ SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER ⋮ Tracking an omnidirectional evader with a differential drive robot at a bounded variable distance ⋮ Pursuit evasion on polyhedral surfaces ⋮ An efficient algorithm for the three-guard problem ⋮ A property of random walks on a cycle graph ⋮ CLEARING A POLYGON WITH TWO 1-SEARCHERS ⋮ On the domination search number ⋮ Simple algorithms for searching a polygon with flashlights ⋮ Bushiness and a tight worst-case upper bound on the search number of a simple polygon. ⋮ The searchlight problem for road networks
