Geometric properties of successful solvability sets in pursuit game problems

DOI10.1134/S0081543808030024MaRDI QIDQ2378006zbMATH OpenOpenAlexFDO

Authors Yuriĭ V. Averbukh

Publication date 5 January 2009

Published in Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0081543808030024

zbMATH Keywords

solvability set: pursuit game: connectedness: continuous time dependence

Mathematics Subject Classification ID

Differential games and control (49N70) Differential games (aspects of game theory) (91A23)

Review text

Consider a nonlinear differential pursuit game (2-player, zero sum). The author has previously shown that the sections of the successful solvability set may be disconnected and may depend discontinuously on time. The main result of this paper is a sufficient condition for those sections to be connected and depend continuously on time.

Recommendations

• scientific article; zbMATH DE number 3852837
• scientific article; zbMATH DE number 4164601
• Methods of solution of a class of pursuit-evasion problems
• scientific article; zbMATH DE number 4059164
• On two pursuit differential game problems with state and geometric constraints in a Hilbert space

This page was built for publication: Geometric properties of successful solvability sets in pursuit game problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2378006)