Kzuo Sugihara, Ichiro Suzuki, and Masafumi Yamashita. The searchlight scheduling problem. SIAM Journal of Computing, 19(6):1024--1040, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....in known polygonal environments (e.g. 2] These works differ from the CMOMMT problem, in that our robots must dynamically shift their positions over time to ensure that as many targets as possible remain under surveillance, and their sensors are noisy and of limited range. Sugihara et al. [3] address the searchlight scheduling problem, which involves searching for a mobile robber (which we call target) in a simple polygon by a number of fixed searchlights, regardless of the movement of the target. They develop certain necessary and sufficient conditions for the existence of a ....

Kzuo Sugihara, Ichiro Suzuki, and Masafumi Yamashita. The searchlight scheduling problem. SIAM Journal of Computing, 19(6):1024--1040, 1990.

....in known polygonal environments (e.g. 8] These works differ from the CMOMMT problem, in that our robots must dynamically shift their positions over time to ensure that as many targets as possible remain under surveillance, and their sensors are noisy and of limited range. Sugihara et al. [36] address the searchlight scheduling problem, which involves searching for a mobile robber (which we call target) in a simple polygon by a number of fixed searchlights, regardless of the movement of the target. They show that the problem of obtaining a search schedule for an instance having at ....

K. Sugihara, I. Suzuki, and M. Yamashita. The searchlight scheduling problem. SIAM Journal of Computing, 19(6):1024-1040, 1990.

....least one point in the sensor placement region. These works differ from the CMOMMT problem, in that our robots must dynamically shift their positions over time to ensure that as many targets as possible remain under surveillance, and their sensors are noisy and of limited range. Sugihara et al. [21] address the searchlight scheduling problem, which involves searching for a mobile robber (which we call target) in a simple polygon by a number of fixed searchlights, regardless of the movement of the target. Their objective is to determine whether a search schedule exists, given a polygon and ....

Kzuo Sugihara, Ichiro Suzuki, and Masafumi Yamashita. The searchlight scheduling problem. SIAM Journal of Computing, 19(6):1024 1040, 1990.

....at least one point in the sensor placement region. These works differ from the CMOMMT problem, in that our robots must dynamically shift their positions over time to ensure that as many targets as possible remain under surveillance, and their sensors are noisy and of limited range. Sugihara et al. [21] address the searchlight scheduling problem, which involves searching for a mobile robber (which we call target) in a simple polygon by a number of fixed searchlights, regardless of the movement of the target. Their objective is to determine whether a search schedule exists, given a polygon and ....

Kzuo Sugihara, Ichiro Suzuki, and Masafumi Yamashita. The searchlight scheduling problem. SIAM Journal of Computing, 19(6):1024--1040, 1990.

....in known polygonal environments (e.g. 4] These works differ from the CMOMMT problem, in that our robots must dynamically shift their positions over time to ensure that as many targets as possible remain under surveillance, and their sensors are noisy and of limited range. Sugihara et al. [15] address the searchlight scheduling problem, which involves searching for a mobile robber (which we call target) in a simple polygon by a number of fixed searchlights, regardless of the movement of the target. Their objective is to determine whether a search schedule exists, given a polygon and ....

Kzuo Sugihara, Ichiro Suzuki, and Masafumi Yamashita. The searchlight scheduling problem. SIAM Journal of Computing, 19(6):1024--1040, 1990.

.... searcher, attempts have been made to compute the the minimum required number of searchers using various parameters of the polygon, including the bushiness and the number of reflex vertices [14] 16] Other related problems include the two guard problem [4] 5] 15] and the searchlight problem [12]. In this paper we introduce a variant of the problem, termed boundary search, in which a single searcher has to find the intruders in a polygonal region from the boundary of the region, without entering the interior. This is akin to searching a cage in a zoo from outside, or searching an office ....

K. Sugihara, I. Suzuki and M. Yamashita, "The searchlight scheduling problem," SIAM J. Computing 19, 6, 1990, 1024--1040.

....However, many of these conditions are only necessary or sufficient, and even a necessary and sufficient condition for a simple polygon to be searchable by a single 1 searcher is left as an open problem. Another variation of the polygon search problem is the searchlight scheduling problem [16], in which the intruder must be found using the flashlights of stationary 1 searchers. In the two guards problem [6, 7] one asks if it is possible for two mobile guards to walk in opposite directions starting from a point on the polygon boundary and meet at another point on the boundary, keeping ....

K. Sugihara, I. Suzuki and M. Yamashita, "The searchlight scheduling problem," SIAM J. Computing 19, 6, 1990, 1024--1040.

No context found.

K. Sugihara, I. Suzuki, and M. Yamashita. The searchlight scheduling problem. SIAM J. Comput., 19(6):1024--1040, 1990.

No context found.

K. Sugihara, I. Suzuki, and M. Yamashita. The searchlight scheduling problem. SIAM J. Comput., 19(6):1024--1040, 1990.

No context found.

Kzuo Sugihara, Ichiro Suzuki, and Masafumi Yamashita. The searchlight scheduling problem. SIAM Journal of Computing, 19(6):1024--1040, 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC