General information
Latest issue
Guidelines for authors

Search papers
Search references

Latest issue
Current issues
Archive issues
What is RSS

Izv. IMI UdGU:

Personal entry:
Save password
Forgotten password?

Izv. IMI UdGU, 2017, Volume 49, Pages 17–54 (Mi iimi338)  

This article is cited in 1 scientific paper (total in 1 paper)

Iterations of stability and the evasion problem with a constraint on the number of switchings of the formed control

A. G. Chentsovab

a N. N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, ul. S. Kovalevskoi, 16, Yekaterinburg, 620990, Russia
b Institute of Radioelectronics and Information Technologies, Ural Federal University, ul. Mira, 32, Yekaterinburg, 620002, Russia

Abstract: This paper is concerned with one variant of the programmed iterations method used for solving the differential game of guidance-evasion. The proposed procedure is connected with iterations on the basis of the property of stability of sets introduced by N.N. Krasovskii. A relationship is established between the resulting iteration procedure and the solution to the evasion problem under a constraint on the switching number of the formed control: the stability iterations define the set of successful solvability of the above-mentioned problem. It is proved that the guaranteed realization of evasion is possible if and only if (guaranteed) strong evasion (namely, the evasion with respect to neighborhoods of sets defining the guidance-evasion game) is realizable. A representation of strategies guaranteeing the evasion with constraints on the switching number is presented. The concrete operation of every such strategy consists in the formation of constant control extruding the trajectory from the set corresponding to the next iteration on the basis of the stability operator. The duration of operation of the above-mentioned control is defined in terms of the result of the multifunctional employment defined on the trajectory space; the values of this multifunctional are nonempty subsets of the remaining time interval. Attention is given to problems involved in the convergence, in the sense of Hausdorff metric, of fragments of sets which are realized by the iteration procedure. On this basis, conditions for convergence (in the Hausdorff metric) for the sets-iterations themselves are obtained.

Keywords: method of programmed iterations, nonanticipating multifunctional, stability operator, correction strategy.


Full text: PDF file (426 kB)
References: PDF file   HTML file

Bibliographic databases:

Document Type: Article
UDC: 517.977, 519.837.3
MSC: 37N35, 65J15, 47J25, 52A01, 91A25
Received: 30.10.2016

Citation: A. G. Chentsov, “Iterations of stability and the evasion problem with a constraint on the number of switchings of the formed control”, Izv. IMI UdGU, 49 (2017), 17–54

Citation in format AMSBIB
\by A.~G.~Chentsov
\paper Iterations of stability and the evasion problem with a constraint on the number of switchings of the formed control
\jour Izv. IMI UdGU
\yr 2017
\vol 49
\pages 17--54

Linking options:

    SHARE: FaceBook Twitter Livejournal

    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. G. Chentsov, D. M. Khachai, “Relaksatsiya differentsialnoi igry sblizheniya-ukloneniya i metody iteratsii”, Tr. IMM UrO RAN, 24, no. 4, 2018, 246–269  mathnet  crossref  elib
  • Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta
    Number of views:
    This page:118
    Full text:23

    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019