Results 11 to 20 of about 16,814 (295)
Pursuit and evasion differential games in Hilbert Space [PDF]
International Game Theory Review, 2010 We consider pursuit and evasion differential game problems described by an infinite system of differential equations with countably many Pursuers in Hilbert space. Integral constraints are imposed on the controls of players.
Ibragimov, Gafurjan I. +1 more
core +4 more sources
The Role of Visibility in Pursuit/Evasion Games [PDF]
Robotics, 2014 The cops-and-robber (CR) game has been used in mobile robotics as a discretized model (played on a graph G) of pursuit/evasion problems. The “classic” CR version is a perfect information game: the cops’ (pursuer’s) location is always known to the robber (evader) and vice versa.
Athanasios Kehagias +2 more
+10 more sources
Qualitative Criterion for Interception in a Pursuit/Evasion Game [PDF]
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2009 A qualitative account is given of a differential pursuit/evasion game. A criterion for the existence of an intercept solution is obtained using future cones that contain all attainable trajectories of target or interceptor originating from an initial ...
Isaacs R. +4 more
core +2 more sources
Bounded-Rational Pursuit-Evasion Games [PDF]
2021 American Control Conference (ACC), 2020 We present a framework that incorporates the idea of bounded rationality into dynamic stochastic pursuit-evasion games. The solution of a stochastic game is characterized, in general, by its (Nash) equilibria in feedback form. However, computing these Nash equilibrium strategies may require extensive computational resources.
Yue Guan +3 more
openalex +4 more sources
Pursuit-evasion games on latin square graphs [PDF]
Journal of Combinatorics, 2021 We investigate various pursuit-evasion parameters on latin square graphs, including the cop number, metric dimension, and localization number. The cop number of latin square graphs is studied, and for $k$-MOLS$(n),$ bounds for the cop number are given. If $n>(k+1)^2,$ then the cop number is shown to be $k+2.$ Lower and upper bounds are provided for ...
Shreya Ahirwar +5 more
openalex +3 more sources
Hierarchical Decompositions of Stochastic Pursuit-Evasion Games [PDF]
2022 IEEE 61st Conference on Decision and Control (CDC), 2022 In this work we present a hierarchical framework for solving discrete stochastic pursuit-evasion games (PEGs) in large grid worlds. With a partition of the grid world into superstates (e.g., "rooms"), the proposed approach creates a two-resolution decision-making process, which consists of a set of local PEGs at the original state level and an ...
Yue Guan +3 more
openalex +3 more sources
A Stochastic Characterization of the Capture Zone in Pursuit-Evasion Games [PDF]
Games, 2020 Simone Battistini
exaly +2 more sources
An Introduction to Pursuit-evasion Differential Games [PDF]
2020 American Control Conference (ACC), 2020 Pursuit and evasion conflicts represent challenging problems with important applications in aerospace and robotics. In pursuit-evasion problems, synthesis of intelligent actions must consider the adversary's potential strategies. Differential game theory provides an adequate framework to analyze possible outcomes of the conflict without assuming ...
Isaac E. Weintraub +2 more
openaire +2 more sources
Aerospace, 2023 This paper presents a solution strategy for deterministic time-optimal pursuit–evasion games with linear state constraints, convex control constraints, and linear dynamics that is consistent with linearized relative orbital motion models such as the ...
Olli Jansson, Matthew W. Harris
doaj +1 more source
Models and Strategies for J2-Perturbed Orbital Pursuit–Evasion Games
Space: Science & Technology, 2023 This paper discusses the modeling and solving of orbital pursuit–evasion games (OPEGs) under J2 perturbation. The optimal long-range maneuver method under J2 perturbation is designed, and it is proved that the effect of eccentricity can be ignored when ...
Hongyu Han, Zhaohui Dang
doaj +1 more source