The Searchlight Scheduling Problem

DOI10.1137/0219070MaRDI QIDQ3495667zbMATH OpenOpenAlexFDO

Authors Kazuo Sugihara, Ichiro Suzuki, Masafumi Yamashita

Publication date 1990

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0219070

zbMATH Keywords

one-way sweep strategysearch schedulesearchlightsvisibility

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Recommendations

• Searching for a Mobile Intruder in a Polygonal Region
• Searching polyhedra by rotating half-planes
• A complete algorithm for searchlight scheduling
• scientific article; zbMATH DE number 2080272
• SEARCHING A POLYGONAL REGION FROM THE BOUNDARY

Cited in

(12)

• The searchlight problem for road networks
• A complete algorithm for searchlight scheduling
• Finding the minimum-distance schedule for a boundary searcher with a flashlight
• scientific article; zbMATH DE number 1471731 (Why is no real title available?)
• SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
• SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
• Continuous surveillance of points by rotating floodlights
• Searching polyhedra by rotating half-planes
• Control sequencing in a game of identity pursuit-evasion
• Cops and robber game without recharging
• Searching a polygonal region by a group of stationary \(k\)-searchers
• An annotated bibliography on guaranteed graph searching

This page was built for publication: The Searchlight Scheduling Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495667)