Results 1  10
of
887,533
A Complete PursuitEvasion Algorithm for Two Pursuers Using Beam Detection
 in IEEE International Conference on Robotics and Automation, 2002
, 2002
"... We present an algorithm for a pair of pursuers, each with one rotating beam (flashlight, laser or a camera), searching for an unpredictable, moving target in a 2D environment (simple polygon). Given a polygon with n edges, the algorithm decides in time O(n ) whether it can be cleared by the pursu ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
We present an algorithm for a pair of pursuers, each with one rotating beam (flashlight, laser or a camera), searching for an unpredictable, moving target in a 2D environment (simple polygon). Given a polygon with n edges, the algorithm decides in time O(n ) whether it can be cleared
A pursuitevasion BUG algorithm
 In Proc. IEEE Int’l Conf. on Robotics and Automation
, 1954
"... We consider the problem of searching for an unpredictable moving target, using a robot that lacks a map of the environment, lacks the ability to construct a map, and has imperfect navigation ability. We present a complete algorithm, which yields a motion strategy for the robot that guarantees the el ..."
Abstract

Cited by 20 (13 self)
 Add to MetaCart
We consider the problem of searching for an unpredictable moving target, using a robot that lacks a map of the environment, lacks the ability to construct a map, and has imperfect navigation ability. We present a complete algorithm, which yields a motion strategy for the robot that guarantees
VisibilityBased PursuitEvasion with Bounded
"... Summary. 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 detectio ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
Summary. 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
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 115 (28 self)
 Add to MetaCart
pursuer and require a linear number of recontaminations is shown. The complete algorithm searches a f...
Constrained PursuitEvasion Problems in the Plane
, 2005
"... In pursuitevasion problems, we are presented with one or more pursuers attempting to capture one or more evaders. We consider pursuers and evaders limited by a maximum speed moving in the twodimensional plane with obstacles. We then investigate two problems in this domain. In the first, where we a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In pursuitevasion problems, we are presented with one or more pursuers attempting to capture one or more evaders. We consider pursuers and evaders limited by a maximum speed moving in the twodimensional plane with obstacles. We then investigate two problems in this domain. In the first, where we
Scalable and Practical PursuitEvasion
"... In this paper, we consider the design and implementation of practical, yet nearoptimal, pursuitevasion games. In prior work, we developed, using the theory of zerosum games, minimal completiontime strategies for pursuitevasion. Unfortunately, those strategies do not scale beyond a small number ..."
Abstract
 Add to MetaCart
In this paper, we consider the design and implementation of practical, yet nearoptimal, pursuitevasion games. In prior work, we developed, using the theory of zerosum games, minimal completiontime strategies for pursuitevasion. Unfortunately, those strategies do not scale beyond a small number
PursuitEvasion Game for Normal Distributions
"... Abstract — In this paper we consider a probabilistic model of a pursuitevasion game on Rn, in which neither pursuer nor evader positions are known with certainty. Both parties are represented by normal distributions that evolve according to a Kalman filter as new sensor readings (observation from o ..."
Abstract
 Add to MetaCart
Abstract — In this paper we consider a probabilistic model of a pursuitevasion game on Rn, in which neither pursuer nor evader positions are known with certainty. Both parties are represented by normal distributions that evolve according to a Kalman filter as new sensor readings (observation from
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
Algorithms and Complexity Results for PursuitEvasion Problems
, 2009
"... We study pursuitevasion problems where a number of pursuers have to clear a given graph. We study when polynomialtime algorithms exist to determine how many pursuers are needed to clear a given graph and how a given number of pursuers should move on the graph to clear it with either a minimum sum ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
We study pursuitevasion problems where a number of pursuers have to clear a given graph. We study when polynomialtime algorithms exist to determine how many pursuers are needed to clear a given graph and how a given number of pursuers should move on the graph to clear it with either a minimum sum
Results 1  10
of
887,533