Results 261 to 270 of about 275,165 (298)
Some of the next articles are maybe not open access.
Randomized Pursuit-Evasion in Graphs
Combinatorics, Probability and Computing, 2002We analyse a randomized pursuit-evasion game played by two players on a graph, a hunter and a rabbit. Let $G$ be any connected, undirected graph with $n$ nodes. The game is played in rounds and in each round both the hunter and the rabbit are located at a node of the graph.
Micah Adler +4 more
openaire +3 more sources
Pursuit—Evasion games on graphs
Journal of Graph Theory, 1988AbstractTwo players, Red and Blue, each independently choose a vertex of a connected graph G. Red must then pay Blue an amount equal to the distance between the vertices chosen. In this note, we investigate the value ν(G)of this pursuit‐evasion game for various classes of graphs G, as well as those optimal mixed strategies for achieving ν(G).
Fan R. K. Chung +2 more
openaire +3 more sources
Uncertain pursuit-evasion game
Soft Computing, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yanghe Feng +3 more
openaire +1 more source
Pursuit, evasion and defense in the plane
2012 American Control Conference (ACC), 2012Multi-player games are important for analyzing complex real-world applications that involve both cooperative and adversarial agents, but computational complexity complicates solving such games. We study a modified pursuit-evasion game with multiple pursuers and a single evader, played in a convex domain with an exit through which the evader may escape.
Selina Pan +5 more
openaire +2 more sources
Pursuit-evasion with fixed beams
2016 IEEE International Conference on Robotics and Automation (ICRA), 2016We introduce a complete algorithm for solving a pursuit-evasion problem in a simply-connected two-dimensional environment, for the case of a single pursuer equipped with fixed beam sensors. The input for our algorithm is an environment and a collection of sensor directions, in which each is capable of line-of-sight detection in a fixed direction.
Nicholas M. Stiffler, Jason M. O'Kane
openaire +2 more sources
A pursuit-evasion BUG algorithm
Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), 2002We 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 elusive target will be detected, if such a strategy ...
Stjepan Rajko, Steven M. LaValle
openaire +2 more sources
Pursuit-Evasion Guidance in a Switched System
SIAM Journal on Control and Optimization, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vladimir Turetsky, Tal Shima
openaire +1 more source
Vision-Based Pursuit-Evasion in a Grid
SIAM Journal on Discrete Mathematics, 2008We revisit the problem of pursuit-evasion in a grid introduced by Sugihara and Suzuki [SIAM J. Discrete Math., 2 (1989), pp. 126-143] in the line-of-sight vision model. Consider an arbitrary evader Z with the maximum speed of 1 who moves (in a continuous way) on the streets and avenues of an n × n grid Gn.
Adrian Dumitrescu +3 more
openaire +1 more source
A pursuit-evasion problem on a grid
Information Processing Letters, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A Note on Generalized Pursuit-Evasion Games
SIAM Journal on Control, 1975Two player zero sum differential games are an extension of optimal control problems. When the cost or payoff is the integral of some function h up to the first time the trajectory enters a “terminal set” the differential game is one of survival. If $h \equiv 1$, the payoff is just the time elapsed up to the “capture time” and the game is one of pursuit
Elliott, Robert J., Friedman, Avner
openaire +2 more sources