Results 1  10
of
303,120
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
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
Randomized PursuitEvasion in a Polygonal Environment
, 2004
"... This paper contains two main results: First, we revisit the wellknown visibility based pursuitevasion problem and show that, in contrast to deterministic strategies, a single pursuer can locate an unpredictable evader in any simplyconnected polygonal environment using a randomized strategy. The ..."
Abstract

Cited by 90 (12 self)
 Add to MetaCart
This paper contains two main results: First, we revisit the wellknown visibility based pursuitevasion problem and show that, in contrast to deterministic strategies, a single pursuer can locate an unpredictable evader in any simplyconnected polygonal environment using a randomized strategy
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
PURSUITEVASION GAMES IN MOBILE NETWORKS
, 2010
"... In the last two decades, there has been an enormous effort to deploy a network of autonomous mobile platforms in various scenarios related to military as well as civilian applications. Interesting research problems related to security range from the development of secure communication protocols for ..."
Abstract
 Add to MetaCart
or the communication network. In contradistinction to the previous research in this area, we model the intrusion as a pursuitevasion game in continuous time and space. We model the intruder as an antagonistic agent and apply tools from differential game theory in order to obtain the optimal motion strategies
On Discretetime Pursuitevasion Games with Sensing Limitations
, 2007
"... We address discretetime pursuitevasion games in the plane where every player has identical sensing and motion ranges restricted to closed discs of given sensing and stepping radii. A single evader is initially located inside a bounded subset of the environment and does not move until detected. We ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We address discretetime pursuitevasion games in the plane where every player has identical sensing and motion ranges restricted to closed discs of given sensing and stepping radii. A single evader is initially located inside a bounded subset of the environment and does not move until detected. We
On Discretetime Pursuitevasion Games with Sensing Limitations
"... We address discretetime pursuitevasion games in the plane where every player has identical sensing and motion ranges restricted to closed discs of given sensing and stepping radii. A single evader is initially located inside a bounded subset of the environment and does not move until detected. We ..."
Abstract
 Add to MetaCart
We address discretetime pursuitevasion games in the plane where every player has identical sensing and motion ranges restricted to closed discs of given sensing and stepping radii. A single evader is initially located inside a bounded subset of the environment and does not move until detected. 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
Visibilitybased pursuitevasion with limited field of view
 International Journal of Robotics Research
, 2004
"... 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 in ap ..."
Abstract

Cited by 94 (2 self)
 Add to MetaCart
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
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
Results 1  10
of
303,120