Abstract
A pursuit game is called alternative if, at any state of the game, a pursuer can terminate it on any of two given target sets and the Boltz payoff function differs on these sets only in the terminal part. By assumption, the optimal universal feedback strategies of the pursuer are known for each fixed terminal alternative. Endeavoring to decrease its payoff via the choice of an alternative, the pursuer may compare guaranteed results (e.g., at the initial and current states) and apply one of two fixed-alternative strategies. If both players optimize the choice of their alternatives depending on the position, the state of the pursuit game can enter some neighborhood of a hypersurface with equivalent alternatives (in the sense of payoffs) and stay there for a finite period of time. In different formalizations, the solutions generated by an appropriate differential equation with discontinuous right-hand side (ideal solutions, limits of Euler polygonal lines, generalized solutions) lead to different outcomes. For certain states, they even increase the payoff in comparison with the pursuit strategy based on the preferable alternative chosen at the initial state (due to sliding mode occurrence). The author introduces a method of constructing pursuit strategies with memory and a finite number of admissible switchings for the target alternative. The proposed method allows estimating the guaranteed result of the pursuer by confining to the solution concept of the limits of Euler polygonal lines.
Similar content being viewed by others
References
Abramyants, T.G., Maslov, E.P., and Rubinovich, E.Y., Elementary Differential Game of Alternate Pursuit, Autom. Remote Control, 1980, vol. 41, no. 8, part 2, pp. 1043–1052.
Isaaks, R., Differential Games. A Mathematical Theory with Applications to Warfare and Pursuit, Control, and Optimization, New York: Wiley, 1952. Translated under the title Differentsial’nye igry, Moscow: Mir, 1967.
Kamneva, L.V., The Sufficient Conditions of Stability for the Value Function of a Differential Game in Terms of Singular Points, J. Appl. Math. Mech., 2003, vol. 67, no. 3, pp. 329–343.
Krasovskii, N.N. and Kotel’nikova, A.N., Unification of Differential Games, Generalized Solutions of the Hamilton-Jacobi Equations, and a Stochastic Guide, Differ. Equat., 2009, vol. 45, no. 11, pp. 1653–1668.
Krasovskii, N.N. and Subbotin, A.I., Pozitsionnye differentsial’nye igry (Positional Differential Games), Moscow: Nauka, 1974.
Malafeev, O.A. and Petrosyan, L.A., A Simple Pursuit Game in the Plane with an Obstacle, Upravl. Sist., 1971, no. 1, pp. 31–42.
Subbotin, A.I., Obobshchennye resheniya uravnenii v chastnykh proizvodnykh pervogo poryadka. Perspektivy dinamicheskoi optimizatsii (Generalized Solutions to Equations in Partial First-Order Derivatives. Prospects of Dynamic Optimization), Izhevsk: Inst. Komp. Issled., 2003.
Filippov, A.F., Differentsial’nye uravneniya s razryvnoi pravoi chast’yu (Differential Equations with Discontinuous Right-hand Side), Moscow: Nauka, 1985.
Shevchenko, I.I., An Elementary Model of Successive Pursuit, Autom. Remote Control, 1982, vol. 43, no. 4, part 1, pp. 456–460.
Shevchenko, I.I., An Elementary Game of Pursuit with Positions Separated by an Obstacle, Autom. Remote Control, 1989, vol. 50, no. 12, part 1, pp. 1641–1649.
Shevchenko, I.I., Geometriya al’ternativnogo presledovaniya (Geometry of Alternative Pursuit), Vladivostok: Dal’nevost. Univ., 2003.
Shevchenko, I.I., Reduction of Differential Games of Alternative Pursuit, Izv. TINRO, 2005, vol. 143, pp. 374–392.
Bernhard, P., Singular Surfaces in Differential Games: An Introduction, in Differential Games and Applications, Springer Lecture Notes in Information and Control Sciences, Hargedorn, P., Knobloch, H.W., and Olsder, G.H., Eds., Berlin: Springer, 1977, vol. 3, pp. 1–33.
Breakwell, J.V. and Hagedorn, P., Point Capture of Two Evaders in Succession, J. Optimiz. Theory Appl., 1979, vol. 27, no. 1, pp. 90–97.
Isbell, J.R., Pursuit Around a Hole, Naval Res. Quart., 1967, vol. 14, pp. 569–571.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © I.I. Shevchenko, 2012, published in Matematicheskaya Teoriya Igr i Prilozheniya, 2012, Vol. 4, No. 4, pp. 114–128.
Rights and permissions
About this article
Cite this article
Shevchenko, I.I. Guaranteed strategies with memory for alternative pursuit. Autom Remote Control 75, 1861–1868 (2014). https://doi.org/10.1134/S0005117914100129
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117914100129