Standard

On solving pursuit game problems. PMM vol. 41, n{ring equal to} 5, 1977, pp. 825-832. / Chistiakov, S. V.

In: Journal of Applied Mathematics and Mechanics, Vol. 41, No. 5, 01.01.1977, p. 845-852.

Research output: Contribution to journal › Article › peer-review

Harvard

Chistiakov, SV 1977, 'On solving pursuit game problems. PMM vol. 41, n{ring equal to} 5, 1977, pp. 825-832', Journal of Applied Mathematics and Mechanics, vol. 41, no. 5, pp. 845-852. https://doi.org/10.1016/0021-8928(77)90167-8

APA

Chistiakov, S. V. (1977). On solving pursuit game problems. PMM vol. 41, n{ring equal to} 5, 1977, pp. 825-832. Journal of Applied Mathematics and Mechanics, 41(5), 845-852. https://doi.org/10.1016/0021-8928(77)90167-8

Vancouver

Chistiakov SV. On solving pursuit game problems. PMM vol. 41, n{ring equal to} 5, 1977, pp. 825-832. Journal of Applied Mathematics and Mechanics. 1977 Jan 1;41(5):845-852. https://doi.org/10.1016/0021-8928(77)90167-8

Author

Chistiakov, S. V. / On solving pursuit game problems. PMM vol. 41, n{ring equal to} 5, 1977, pp. 825-832. In: Journal of Applied Mathematics and Mechanics. 1977 ; Vol. 41, No. 5. pp. 845-852.

BibTeX

@article{00df7a46f77b42c486b69dd0ee100363,
title = "On solving pursuit game problems. PMM vol. 41, n{ring equal to} 5, 1977, pp. 825-832",
abstract = "Two methods are proposed for successive approximations of the value function of a pursuit game with limited time and with payoff function minτε{lunate}[0, t] H (x (τ), y (τ)), which are used directly for the constructive design of successive pursuit and evasion strategies which permit ε-optimal strategies to be found in any ε > c0. Necessary and sufficient conditions for some function to be the value function of the pursuit game being analyzed are derived as well. References [1-3] were devoted to sequential methods of constructing the value function or the payoff minimax in game problems of encounter at a specified instant. These methods were used in [1, 2] to construct maximal stable bridges the strategies extremal to which solve the corresponding problem, as is well known from [4], Sequential procedures for constructing maximal stable bridges without a preliminary construction of the value function or the payoff minimax also were examined in [1,2] and in [5].",
author = "Chistiakov, {S. V.}",
year = "1977",
month = jan,
day = "1",
doi = "10.1016/0021-8928(77)90167-8",
language = "English",
volume = "41",
pages = "845--852",
journal = "Journal of Applied Mathematics and Mechanics",
issn = "0021-8928",
publisher = "Elsevier",
number = "5",

}

RIS

TY - JOUR

T1 - On solving pursuit game problems. PMM vol. 41, n{ring equal to} 5, 1977, pp. 825-832

AU - Chistiakov, S. V.

PY - 1977/1/1

Y1 - 1977/1/1

N2 - Two methods are proposed for successive approximations of the value function of a pursuit game with limited time and with payoff function minτε{lunate}[0, t] H (x (τ), y (τ)), which are used directly for the constructive design of successive pursuit and evasion strategies which permit ε-optimal strategies to be found in any ε > c0. Necessary and sufficient conditions for some function to be the value function of the pursuit game being analyzed are derived as well. References [1-3] were devoted to sequential methods of constructing the value function or the payoff minimax in game problems of encounter at a specified instant. These methods were used in [1, 2] to construct maximal stable bridges the strategies extremal to which solve the corresponding problem, as is well known from [4], Sequential procedures for constructing maximal stable bridges without a preliminary construction of the value function or the payoff minimax also were examined in [1,2] and in [5].

AB - Two methods are proposed for successive approximations of the value function of a pursuit game with limited time and with payoff function minτε{lunate}[0, t] H (x (τ), y (τ)), which are used directly for the constructive design of successive pursuit and evasion strategies which permit ε-optimal strategies to be found in any ε > c0. Necessary and sufficient conditions for some function to be the value function of the pursuit game being analyzed are derived as well. References [1-3] were devoted to sequential methods of constructing the value function or the payoff minimax in game problems of encounter at a specified instant. These methods were used in [1, 2] to construct maximal stable bridges the strategies extremal to which solve the corresponding problem, as is well known from [4], Sequential procedures for constructing maximal stable bridges without a preliminary construction of the value function or the payoff minimax also were examined in [1,2] and in [5].

UR - http://www.scopus.com/inward/record.url?scp=49349133916&partnerID=8YFLogxK

U2 - 10.1016/0021-8928(77)90167-8

DO - 10.1016/0021-8928(77)90167-8

M3 - Article

VL - 41

SP - 845

EP - 852

JO - Journal of Applied Mathematics and Mechanics

JF - Journal of Applied Mathematics and Mechanics

SN - 0021-8928

IS - 5

ER -

ID: 48468902