Searching for a Mobile Intruder in a Polygonal Region
From MaRDI portal
Publication:4015972
DOI10.1137/0221051zbMATH Open0757.68098OpenAlexW2033649214MaRDI QIDQ4015972FDOQ4015972
Authors: 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
Recommendations
- scientific article; zbMATH DE number 2080272
- SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
- Simple algorithms for searching a polygon with flashlights
- Searching for mobile intruders in a polygonal region by a group of mobile searchers
- SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
Cited In (49)
- Clearing an orthogonal polygon to find the evaders
- 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
- Searching a Circular Corridor with Two Flashlights
- AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
- Optimum sweeps of simple polygons with two guards
- Minimization of the maximum distance between the two guards patrolling a polygonal region
- A unified and efficient solution to the room search problem
- Title not available (Why is that?)
- Mobile sensor intrusion detection under any shape of curve
- An alternative proof for the equivalence of searcher and 2-searcher
- Title not available (Why is that?)
- An annotated bibliography on guaranteed graph searching
- Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
- The searchlight problem for road networks
- Finding all door locations that make a room searchable
- Infrastructure security games
- CLEARING A POLYGON WITH TWO 1-SEARCHERS
- The lion and man game on polyhedral surfaces with obstacles
- An efficient algorithm for the three-guard problem
- On the domination search number
- Visibility-based pursuit-evasion in a polygonal environment
- A property of random walks on a cycle graph
- Characterizing and recognizing LR-visibility polygons
- Finding the minimum-distance schedule for a boundary searcher with a flashlight
- Simple algorithms for searching a polygon with flashlights
- SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
- SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
- SEARCHING A ROOM BY TWO GUARDS
- A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
- Title not available (Why is that?)
- The theory of guaranteed search on graphs
- Total curvature and simple pursuit on domains of curvature bounded above
- SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
- Capture bounds for visibility-based pursuit evasion
- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem
- Tracking an omnidirectional evader with a differential drive robot at a bounded variable distance
- The Searchlight Scheduling Problem
- Searching for mobile intruders in circular corridors by two 1-searchers
- Optimal on-line algorithms for walking with minimum number of turns in unknown streets
- Escaping offline searchers and isoperimetric theorems
- Studying the stochastic capturing of moving intruders by mobile sensors
- Sweeping simple polygons with the minimum number of chain guards
- Pursuit evasion on polyhedral surfaces
- Searching for mobile intruders in a polygonal region by a group of mobile searchers
- Visibility-based pursuit-evasion with bounded speed
- Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles
- Meeting in a polygon by anonymous oblivious robots
- NETWORK DECONTAMINATION IN PRESENCE OF LOCAL IMMUNITY
This page was built for publication: Searching for a Mobile Intruder in a Polygonal Region
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4015972)
