I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM J. Comp., 21(5):863-888, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....in Sections 1.3 and 2 are given only as a conceptual framework and are not directly used by the algorithm in Section 4. Section 5 concludes the paper with a summary and directions for future research. 1. 1 Related work Pursuit evasion in the plane was introduced by Suzuki and Yamashita [SY92] They considered a single pursuer looking for an evader inside a simple polygon. They defined di#erent kinds of pursuers depending on the number of flashlights that the pursuer is equipped with, e.g. a 1 searcher has one flashlight, a k searcher has k flashlights, and an has 360 # vision. ....

....di#erent kinds of pursuers depending on the number of flashlights that the pursuer is equipped with, e.g. a 1 searcher has one flashlight, a k searcher has k flashlights, and an has 360 # vision. This naturally defines a pursuit evasion problem for each class of searchers. Independently of [SY92] Icking and Klein [IK92] defined the two guard walkability problem , which is a search problem for two guards whose starting and goal position are given, and who move on the boundary of a polygon while maintaining mutual visibility. A solution to the two guards problem was provided in [IK92] ....

[Article contains additional citation context not shown here]

Ichiro Suzuki and Masafumi Yamashita. Searching for a mobile intruder in a polygonal region. SIAM Journal on Computing, 21(5):863--888, October 1992.

....intruders using sonars, lasers, or cameras. Mobile robots can be used by special forces in high risk military operations to systematically search a building in enemy territory before it is declared safe for entry. Related work. Pursuit evasion in the plane was introduced by Suzuki and Yamashita [1]. They considered a single pursuer looking for an evader inside a simple polygon. They defined di#erent kinds of pursuers depending on the number of beams (flashlights) is equipped with, e.g. a 1 searcher has one flashlight, a k searcher has k flashlights, and an # searcher has 360 # vision. ....

....They defined di#erent kinds of pursuers depending on the number of beams (flashlights) is equipped with, e.g. a 1 searcher has one flashlight, a k searcher has k flashlights, and an # searcher has 360 # vision. This naturally defines a pursuit evasion problem for each class of searchers. [1, 2, 3] presented polynomial solutions for deciding searchability of special classes of polygons, the general case single pursuer problem was open for quite a while. Recently, the authors provided a O(n ) solution for a single 1 searcher in a polygon [4] Park et al. [5] presented polynomial solutions ....

[Article contains additional citation context not shown here]

I. Suzuki and M. Yamashita, "Searching for a mobile intruder in a polygonal region," SIAM J. on Computing, vol. 21, no. 5, pp. 863--888, 1992.

....time. Beside network security [14] the graph searching problem has many other applications, including pursuit evasion problems in a labyrinth [26] decontamination problems in a system of tunnels, and mobile computing problems in which agents or robots [11] are looking for a hostile intruder [33]. Moreover, the graph searching problem also arises in VLSI design through its equivalence with the gate matrix layout problem [10, 22] It is hence not surprising that it gave rise to numerous papers. Another reason for this success is that the problem and its several variants (node search, ....

....any link (see also [2] Thilikos [36] used graph minors to derive a linear time algorithm that checks whether a network has a search number at most 2. For other results on graph searching, the reader is referred to [7, 8, 12, 30, 32] Contributions to related search problems can be found in [6, 25, 33, 34, 38, 39] and the references therein. 1.2 Limit of Existing Solutions In all existing solutions for the standard version of the problem (i.e. edge search) as well as for any of its variants known to the authors (e.g. node search, or mixed search) it is assumed that agents can be removed from their ....

I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM Journal on Computing, 21(5):863-888, 1992.

....a simple polygon P with n edges, decides whether P is 1 searchable and if so, outputs a search schedule. Although the problem has been open for a while, no complete characterizations or ecient algorithms were developed. Naturally, several, restricted variants were considered. Independently of Ref. [12], Icking and Klein de ned the two guard walkability problem, which is a search problem for two guards whose starting and goal position are given, and who move on the boundary of a polygon so that they are always mutually visible. Icking and Klein gave an O(n log n) solution, which later was ....

....Lee et al. de ned 1 searchability for a room (i.e. a polygon with one door a point which has to remain clear at all times) and presented an O(n log n) decision algorithm and a method to construct a solution in time O(n ) In this paper we solve the original problem de ned in Ref. [12], and we show that it is a nontrivial generalization of the variants of 1 searchability de ned in Refs. 7,10] Originally, the problem of 1 searchability of a polygon was introduced in Ref. 12] together with a more general problem in which the pursuer (a.k.a. k searcher) has k ashlights; when ....

[Article contains additional citation context not shown here]

I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM Journal on Computing, 21(5):863-888, 1992.

.... topology reconstruction: E is typically a single entity (sometimes two) G is unknown to the entity, and P is the construction of a map of the graph (e.g. see [2, 5, 6] Other examples are graph exploration [7, 8, 11] wake up [1, 15] black hole search [9, 10] searching for a mobile intruder [17], etc. In this paper, we focus on a fundamental problem in distributed mobile computing: election, that is the process by which a group of autonomous asynchronous mobile entities initially in the same state and scattered in G selects one of them as a leader. We are interested in generic (or ....

I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM Journal on Computing, 21(5):863-888, 1992.

....regardless of the movement of the target. They develop certain necessary and sufficient conditions for the existence of a search schedule in certain situations, under the assumption of a single target, no entrances exits to the polygon, and fixed searcher positions Suzuki and Yamashita [4] address the polygon search problem, which deals with searching for a mobile tar get in a simple polygon by a single mobile searcher. They examine two cases: one in which the searcher s visibility is restricted to k rays emanating from its position, and one in which the searcher can see in all ....

Ichiro Suzuki and Masafumi Yamashita. Searching for a mobile intruder in a polygonal region. SIAM Journal of Computing, 21(5):863--888, 1992.

....Kalman Filter. The main problem with these map building techniques is that they are time consuming and computationally expensive, even in the case of simple two dimensional rectilinear environments [2] On the other hand, most of the literature in pursuit evasion games, see e.g. 3] 4] 5] [6], 7] assumes worst case motion for the evaders and an accurate map of the environment. In practice, this results in overly conservative pursuit policies applied to inaccurate maps built from noisy measurements. In [8] the pursuit evasion game and map building problems are combined in a single ....

I. Suzuki and M. Yamashita, "Searching for a mobile intruder in a polygonal region," SIAM Journal on Computing, vol. 21, no. 5, pp. 863--888, Oct. 1992.

....be reduced to that for insraces having no searchlight on the polygon boundary. They also present a necessary and sufficient condition for the existence of a search schedule for exactly two searchlights in the interior. They do not address issues of computational complexity. Suzuki and Yamashita [37] address the polygon search problem, which deals with searching for a mobile target in a simple polygon by a mobile searcher. They examine two cases: one in which the searcher s visibility is restricted to k rays emanating from its position, and one in which the searcher can see in all directions ....

....of the force vectors will couse eoch robot to move owoy from its robot neighbors ond then idle in one locotion. While this moy be occeptoble in some opplicotions, in generol, we would like to hove the robots octively ond intelligently seek out potentiol torgets in the oreo. Suzuki ond Yomoshito [37] oddress this problem through the development of seorch schedules for x: seorchers . An x: seorcher is o mobile seorcher thor hos o 360 infinite field of view. A seorch schedule for on x: seorcher is o poth through o simple polygonol areo thor ollows the seorcher (or robot) to detect o mobile ....

Ichiro Suzuki and Masafumi Yamashita. Searching for a mobile intruder in a polygonal region. SIAM Journal of Computing, 21(5):863-888, 1992.

....exit the polygon after the start of the problem, and that the searchers maintain fixed positions. It also does not give a prescriptive algorithm for determining the appropriate search schedule for any given simple polygon, although algorithms for special cases are provided. Suzuki and Yamashita [22] address the polygon search problem, which deals with searching for a mobile target in a simple polygon by a single mobile searcher. They examine two cases: one in which the searcher s visibility is restricted to k rays emanating from its position, and one in which the searcher can see in all ....

....of the force vectors will cause each robot to move away from its robot neighbors and then idle in one location. While this may be acceptable in some applications, in general, we would like to have the robots actively and intelligently seek out potential targets in the area. Suzuki and Yamashita [22] address this problem through the development of search schedules for c searchers . An c searcheF is a mobile searcher that has a 360 infinite field of view. A search schedule for an c searcher is a path through a simple polygonal area that allows the searcher (or robot) to detect a mobile ....

[Article contains additional citation context not shown here]

Ichiro Suzuki and Masafumi Yamashita. Searching for a mobile intruder in a polygonal region. SIAM Journal of Computing, 21(5):863 888, 1992.

No context found.

I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM J. Comp., 21(5):863-888, 1992.

No context found.

I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM J. Computing, 21(5):863--888, October 1992.

No context found.

I. Suzuki and M. Yamashita, \Searching for a mobile intruder in a polygonal region," SIAM Journal on Computing, vol. 21, no. 5, pp. 863-888, 1992.

No context found.

I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM J. Computing, 21(5):863-888, October 1992.

No context found.

I. Suzuki and M. Yamashita, "Searching for a mobile intruder in a polygonal region," SIAM Journal on Computing, vol. 21, no. 5, pp. 863--888, 1992.

No context found.

I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM J. Comput, 21(5):863-888, October 1992.

No context found.

I. Suzuki and M. Yamashita, "Searching for a mobile intruder in a polygonal region," SIAM Journal on Computing, vol. 21, no. 5, pp. 863--888, 1992.

No context found.

I. Suzuki and M. Yamashita, "Searching for a mobile intruder in a polygonal region," SIAM Journal on Computing, vol. 21, no. 5, pp. 863--888, 1992.

No context found.

I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM J. Computing, 21(5):863--888, October 1992.

No context found.

I. Suzuki and M. Yamashita, "Searching for a Mobile Intruder in a Polygonal Region", SIAM J. Comput., 21(5), 1992, pp. 863-888.

No context found.

I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM Journal on Computing, 21(5):863--888, 1992.

No context found.

I. Suzuki and M. Yamashita. Searching for a Mobile Intruder in a Polygonal Region. Siam Journal on Computing, 21(5):868--888, 1992.

No context found.

I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM Journal on Computing, 21(5):863--888, 1992.

No context found.

I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM J. Comput., 21:863-888, 1992.

No context found.

I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM Journal on Computing, 21(5):863--888, 1992.

No context found.

I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM Journal on Computing, 21(5):863--888, 1992.

First 50 documents

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