An Efficient Algorithm for a Visibility-Based Surveillance-Evasion Game

2012 ◽  
Author(s):  
Ryo Takei ◽  
Richard Tsai ◽  
Zhengyuan Zhou ◽  
Yanina Landa
Keyword(s):  
Efficient Algorithm ◽  
Evasion Game ◽  
Surveillance Evasion

scholarly journals An efficient algorithm for a visibility-based surveillance-evasion game

2014 ◽  
Vol 12 (7) ◽  
pp. 1303-1327 ◽  
Author(s):  
Ryo Takei ◽  
Richard Tsai ◽  
Zhengyuan Zhou ◽  
Yanina Landa
Keyword(s):  
Efficient Algorithm ◽  
Evasion Game ◽  
Surveillance Evasion

LEVEL SETS OF THE VALUE FUNCTION IN DIFFERENTIAL GAMES WITH THE HOMICIDAL CHAUFFEUR DYNAMICS

2001 ◽  
Vol 03 (01) ◽  
pp. 67-112 ◽  
Author(s):  
V. S. PATSKO ◽  
V. L. TUROVA
Keyword(s):  
Differential Games ◽  
Level Sets ◽  
Value Functions ◽  
Capture Time ◽  
Evasion Game ◽  
Homicidal Chauffeur ◽  
Turn Radius ◽  
The Value Function ◽  
Maximal Time ◽  
Surveillance Evasion

Three differential games with the dynamics of the homicidal chauffeur are considered. The first problem is the Isaacs' homicidal chauffeur differential game. In this game, a pursuer P minimises the capture time of an evader E. The objective of the evader is to prevent the capture or to maximise the capture time. The magnitude of the velocity is constant for the pursuer, and his maneuverability is bounded through a minimal turn radius. The maneuverability of the evader is not bounded. The pursuer's control is the rate of turn; the evader steers by choosing directions of his velocity. The main difference of the second problem is that the size of the constraint on the control parameter of the evader depends on the position of the game. The idea of such a modification was suggested by Bernhard. The third problem is a conic surveillance-evasion game studied by Lewin and Olsder. In this game, the dynamics is the same as in the Isaacs' problem, but the goals of the players differ from the classic formulation: an evader E minimises the time of escaping from a detection set that is a two-dimensional semiinfinite cone. The detection set is attached to the velocity vector of a pursuer P whose objective is to keep the evader within the detection set for maximal time. The paper describes the computation of level sets of the value functions for these games. The algorithm proposed by the authors is used. An analysis of families of semipermeable curves is carried out. The results of this analysis are used to check the correctness of the computation of level sets and to explain the appearance of holes in victory domains of the pursuer in the second problem.

The surveillance-evasion game of degree

1975 ◽  
Vol 16 (3-4) ◽  
pp. 339-353 ◽  
Author(s):  
J. Lewin ◽  
J. V. Breakwell
Keyword(s):  
Evasion Game ◽  
Surveillance Evasion

Computational Micrograph Registration with Sieve Processes

1996 ◽  
Vol 54 ◽  
pp. 440-441
Author(s):  
P.J. Phillips ◽  
J. Huang ◽  
S. M. Dunn
Keyword(s):  
Planar Graph ◽  
Efficient Algorithm ◽  
Spatial Organization ◽  
Spatial Arrangement ◽  
Stereo Image ◽  
Image Model ◽  
Geometric Invariants ◽  
Point Set

In this paper we present an efficient algorithm for automatically finding the correspondence between pairs of stereo micrographs, the key step in forming a stereo image. The computation burden in this problem is solving for the optimal mapping and transformation between the two micrographs. In this paper, we present a sieve algorithm for efficiently estimating the transformation and correspondence.In a sieve algorithm, a sequence of stages gradually reduce the number of transformations and correspondences that need to be examined, i.e., the analogy of sieving through the set of mappings with gradually finer meshes until the answer is found. The set of sieves is derived from an image model, here a planar graph that encodes the spatial organization of the features. In the sieve algorithm, the graph represents the spatial arrangement of objects in the image. The algorithm for finding the correspondence restricts its attention to the graph, with the correspondence being found by a combination of graph matchings, point set matching and geometric invariants.

Energy efficient algorithm for lookup-tables on mobile devices

2016 ◽  
Vol 2016 (7) ◽  
pp. 1-6
Author(s):  
Sergey Makov ◽  
Vladimir Frantc ◽  
Viacheslav Voronin ◽  
Igor Shrayfel ◽  
Vadim Dubovskov ◽  
...  
Keyword(s):  
Mobile Devices ◽  
Efficient Algorithm ◽  
Energy Efficient ◽  
Lookup Tables
Sign in / Sign up

Export Citation Format

Share Document