Highly Influenced

# The Searchlight Scheduling Problem

@article{Sugihara1990TheSS, title={The Searchlight Scheduling Problem}, author={Kazuo Sugihara and Ichiro Suzuki and Masafumi Yamashita}, journal={SIAM J. Comput.}, year={1990}, volume={19}, pages={1024-1040} }

- Published 1990 in SIAM J. Comput.
DOI:10.1137/0219070

The problem of searching for a mobile robber in a simple polygon by a number of searchlights is considered. A searchlight is a stationary point which emits a single ray that cannot penetrate the boundary of the polygon. The direction of the ray can be changed continuously, and a point is detected by a searchlight at a given time if and only if it is on the ray. A robber is a point that can move continuously with unbounded speed. First, it is shown that the problem of obtaining a search schedule… CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

25 Citations

8 References

Similar Papers

#### References

##### Publications referenced by this paper.

Showing 1-8 of 8 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential