Results 1  10
of
6,805
VisibilityBased PursuitEvasion in ThreeDimensional Environments
"... The problem of visibilitybased pursuitevasion was first introduced in 1992 by Suzuki and Yamashita [19]. Since then, it has attracted considerable attention in the communities of robot motion planning and computational geometry. Researchers have considered many variations of the problem, including ..."
Abstract
 Add to MetaCart
The problem of visibilitybased pursuitevasion was first introduced in 1992 by Suzuki and Yamashita [19]. Since then, it has attracted considerable attention in the communities of robot motion planning and computational geometry. Researchers have considered many variations of the problem
VisibilityBased PursuitEvasion in ThreeDimensional Environments
"... The problem of visibilitybased pursuitevasion was first introduced in 1992 by Suzuki and Yamashita [19]. Since then, it has attracted considerable attention in the communities of robot motion planning and computational geometry. Researchers have considered many variations of ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
The problem of visibilitybased pursuitevasion was first introduced in 1992 by Suzuki and Yamashita [19]. Since then, it has attracted considerable attention in the communities of robot motion planning and computational geometry. Researchers have considered many variations of
VisibilityBased PursuitEvasion with Bounded Speed
"... This paper presents an algorithm for a visibilitybased pursuitevasion problem in which bounds on the speeds of the pursuer and evader are given. The pursuer tries to find the evader inside of a simplyconnected polygonal environment, and the evader in turn tries actively to avoid detection. The ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
This paper presents an algorithm for a visibilitybased pursuitevasion problem in which bounds on the speeds of the pursuer and evader are given. The pursuer tries to find the evader inside of a simplyconnected polygonal environment, and the evader in turn tries actively to avoid detection
Hybrid Control for VisibilityBased PursuitEvasion Games
, 2004
"... Pursuitevasion games in complex environments have a rich but disconnected history. Continuous or differential pursuitevasion games focus on optimal control methods, and rely on very intense computations in order to provide locally optimal controls. Discrete pursuitevasion games on graphs are algo ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
are algorithmically much more appealing, but completely ignore the physical dynamics of the players, resulting in possibly infeasible motions. In this paper, we present a provable and algorithmically feasible solution for visibilitybased pursuitevasion games in simplyconnected environments, for players with dynamic
Visibilitybased pursuitevasion in an unknown planar environment
 International Journal of Robotics Research
, 2004
"... We address an online version of the visibilitybased pursuitevasion problem. We take a minimalist approach in modeling the capabilities of a pursuer robot. A point pursuer moves in an unknown, simplyconnected, piecewisesmooth planar environment, and is given the task of locating any unpredictable ..."
Abstract

Cited by 49 (6 self)
 Add to MetaCart
We address an online version of the visibilitybased pursuitevasion problem. We take a minimalist approach in modeling the capabilities of a pursuer robot. A point pursuer moves in an unknown, simplyconnected, piecewisesmooth planar environment, and is given the task of locating any
VisibilityBased PursuitEvasion in a Polygonal Environment
 International Journal of Computational Geometry and Applications
, 1997
"... This paper addresses the problem of planning the motion of one or more pursuers in a polygonal environment to eventually "see" an evader that is unpredictable, has unknown initial position, and is capable of moving arbitrarily fast. This problem was first introduced by Suzuki and Yamashita ..."
Abstract

Cited by 109 (25 self)
 Add to MetaCart
This paper addresses the problem of planning the motion of one or more pursuers in a polygonal environment to eventually "see" an evader that is unpredictable, has unknown initial position, and is capable of moving arbitrarily fast. This problem was first introduced by Suzuki and Yamashita. Our study of this problem is motivated in part by robotics applications, such as surveillance with a mobile robot equipped with a camera that must find a moving target in a cluttered workspace. A few bounds are introduced, and a complete algorithm is presented for computing a successful motion strategy for a single pursuer. For simplyconnected free spaces, it is shown that the minimum number of pursuers required is \Theta(lg n). For multiplyconnected free spaces, the bound is \Theta( p h + lg n) pursuers for a polygon that has n edges and h holes. A set of problems that are solvable by a single pursuer and require a linear number of recontaminations is shown. The complete algorithm searches a f...
Visibilitybased pursuitevasion with limited field of view.
 The International Journal of Robotics Research,
, 2006
"... Abstract We study a form of the pursuitevasion problem, in which one or more searchers must move through a given environment so as to guarantee detection of any and all evaders, which can move arbitrarily fast. Our goal is to develop techniques for coordinating teams of robots to execute this task ..."
Abstract

Cited by 92 (1 self)
 Add to MetaCart
Abstract We study a form of the pursuitevasion problem, in which one or more searchers must move through a given environment so as to guarantee detection of any and all evaders, which can move arbitrarily fast. Our goal is to develop techniques for coordinating teams of robots to execute
A VisibilityBased PursuitEvasion Problem
 SUBMITTED TO THE INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY AND APPLICATIONS
"... This paper addresses the problem of planning the motion of one or more pursuers in a polygonal environment to eventually "see" an evader that is unpredictable, has unknown initial position, and is capable of moving arbitrarily fast. A visibility region is associated witheach pursuer, and t ..."
Abstract

Cited by 82 (1 self)
 Add to MetaCart
This paper addresses the problem of planning the motion of one or more pursuers in a polygonal environment to eventually "see" an evader that is unpredictable, has unknown initial position, and is capable of moving arbitrarily fast. A visibility region is associated witheach pursuer
VisibilityBased PursuitEvasion in a Polygonal Region by a Searcher
 Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP
, 2001
"... We consider the most basic visibilitybased pursuitevasion problem defined as follows: Given a polygonal region, a searcher with 360 # vision, and an unpredictable intruder that is arbitrarily faster than the searcher, plan the motion of the searcher so as to see the intruder. In this paper, we ..."
Abstract

Cited by 48 (1 self)
 Add to MetaCart
We consider the most basic visibilitybased pursuitevasion problem defined as follows: Given a polygonal region, a searcher with 360 # vision, and an unpredictable intruder that is arbitrarily faster than the searcher, plan the motion of the searcher so as to see the intruder. In this paper
Capture Bounds for VisibilityBased Pursuit Evasion
, 2013
"... We investigate the following problem in the visibilitybased discretetime model of pursuit evasion in the plane: how many pursuers are needed to capture an evader in a polygonal environment with obstacles under the minimalist assumption that pursuers and the evader have the same maximum speed? When ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We investigate the following problem in the visibilitybased discretetime model of pursuit evasion in the plane: how many pursuers are needed to capture an evader in a polygonal environment with obstacles under the minimalist assumption that pursuers and the evader have the same maximum speed
Results 1  10
of
6,805