7,526 research outputs found
A formulation and analysis of combat games
Combat which is formulated as a dynamical encounter between two opponents, each of whom has offensive capabilities and objectives is outlined. A target set is associated with each opponent in the event space in which he endeavors to terminate the combat, thereby winning. If the combat terminates in both target sets simultaneously, or in neither, a joint capture or a draw, respectively, occurs. Resolution of the encounter is formulated as a combat game; as a pair of competing event constrained differential games. If exactly one of the players can win, the optimal strategies are determined from a resulting constrained zero sum differential game. Otherwise the optimal strategies are computed from a resulting nonzero sum game. Since optimal combat strategies may frequently not exist, approximate or delta combat games are also formulated leading to approximate or delta optimal strategies. The turret game is used to illustrate combat games. This game is sufficiently complex to exhibit a rich variety of combat behavior, much of which is not found in pursuit evasion games
A formulation and analysis of combat games
Combat is formulated as a dynamical encounter between two opponents, each of whom has offensive capabilities and objectives. With each opponent is associated a target in the event space in which he endeavors to terminate the combat, thereby winning. If the combat terminates in both target sets simultaneously or in neither, a joint capture or a draw, respectively, is said to occur. Resolution of the encounter is formulated as a combat game; namely, as a pair of competing event-constrained differential games. If exactly one of the players can win, the optimal strategies are determined from a resulting constrained zero-sum differential game. Otherwise the optimal strategies are computed from a resulting non-zero-sum game. Since optimal combat strategies frequencies may not exist, approximate of delta-combat games are also formulated leading to approximate or delta-optimal strategies. To illustrate combat games, an example, called the turret game, is considered. This game may be thought of as a highly simplified model of air combat, yet it is sufficiently complex to exhibit a rich variety of combat behavior, much of which is not found in pursuit-evasion games
Cooperative Pursuit with Multi-Pursuer and One Faster Free-moving Evader
This paper addresses a multi-pursuer single-evader pursuit-evasion game where
the free-moving evader moves faster than the pursuers. Most of the existing
works impose constraints on the faster evader such as limited moving area and
moving direction. When the faster evader is allowed to move freely without any
constraint, the main issues are how to form an encirclement to trap the evader
into the capture domain, how to balance between forming an encirclement and
approaching the faster evader, and what conditions make the capture possible.
In this paper, a distributed pursuit algorithm is proposed to enable pursuers
to form an encirclement and approach the faster evader. An algorithm that
balances between forming an encirclement and approaching the faster evader is
proposed. Moreover, sufficient capture conditions are derived based on the
initial spatial distribution and the speed ratios of the pursuers and the
evader. Simulation and experimental results on ground robots validate the
effectiveness and practicability of the proposed method
A decomposition technique for pursuit evasion games with many pursuers
Here we present a decomposition technique for a class of differential games.
The technique consists in a decomposition of the target set which produces, for
geometrical reasons, a decomposition in the dimensionality of the problem.
Using some elements of Hamilton-Jacobi equations theory, we find a relation
between the regularity of the solution and the possibility to decompose the
problem. We use this technique to solve a pursuit evasion game with multiple
agents
Linear-quadratic stochastic pursuit-evasion games
A linear-quadratic differential game in which the system state is affected by disturbance and both players have access to different measurements is solved. The problem is first converted to an optimization problem in infinite-dimensional state space and then solved using standard techniques. For convenience, “L2-white noise” instead of “Wiener process” setup is used
- …