Abstract
A pursuit problem in which players have identical maximal velocity and the evader moves over a strictly convex smooth n-dimensional hypersurface is investigated. It is shown that pursuit can be completed from any initial position. If the hypersurface contains a planar part, then pursuit can be evaded from certain initial positions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
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.
Petrov, N.N., A Problem of Group Pursuit with Phase Constraints, Prikl. Mat. Mekh., 1988, vol. 52, issue 6, pp. 1030-1033.
Petrosyan, L.S., Differentsial'nye igry presledovaniya (Differential Pursuit Games), Leningrad: Leningr. Gos. Univ., 1977.
Pshennichnyi, B.N., Simple Pursuit of Several Targets, Kibernetika, 1976, no. 3, pp. 145-146.
Chernous'ko, F.L., A Problem of Evasion of Several Pursuers, Prikl. Mat. Mekh., 1976, vol. 40, issue 1, pp. 14-24.
Ivanov, R.P., Simple Pursuit-Evasion on a Compact, Dokl. Akad. Nauk SSSR, 1980, vol. 254, no. 6, pp. 1318-1321.
Rikhsiev, B.B., Group Pursuit on a Convex Compact, Avtom. Telemekh., 1990, no. 9, pp. 55-56.
Gromoll, D., Klingenberg, W., and Meyer, W., Riemannsche Geometrie im grossen, Berlin: Springer, 1968. Translated under the title Rimanova geometriya v tselom, Moscow: Mir, 1971.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kuchkarov, A.S., Rikhsiev, B.B. A Pursuit Problem under Phase Constraints. Automation and Remote Control 62, 1259–1262 (2001). https://doi.org/10.1023/A:1010297326898
Issue Date:
DOI: https://doi.org/10.1023/A:1010297326898