Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Dokl. RAN. Math. Inf. Proc. Upr.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia, 2020, Volume 495, Pages 107–111
DOI: https://doi.org/10.31857/S268695432006020X (Mi danma143) 		 
This article is cited in 4 scientific papers (total in 4 papers)

CONTROL PROCESSES

The problem of trajectories avoiding a sparse terminal set

L. P. Yugai

Almalyk Branch of the National University of Science and Technology "MISIS", Almalyk, Uzbekistan
Full-text PDF (169 kB) Citations (4)
References:
PDF
HTML
DOI: https://doi.org/10.31857/S268695432006020X
Abstract: The problem of avoidance (evasion) in conflict-controlled processes in L.S. Pontryagin and E.F. Mishchenko’s statement is considered. The terminal set has a special discrete (sparse) structure. In contrast to other works, it consists of a countable number of points with distances not limited from below by a fixed positive constant. New sufficient conditions and an evasion method are obtained which make it possible to solve a number of avoiding trajectory problems for oscillatory systems, including the problem of swinging a generalized mathematical pendulum.
Keywords: avoiding, evasion, pursuer, evader, control, discrete sparse terminal set, pendulum.
Presented: F. L. Chernous'ko
Received: 20.10.2020
Revised: 20.10.2020
Accepted: 23.10.2020
English version:
Doklady Mathematics, 2020, Volume 102, Issue 3, Pages 538–541
DOI: https://doi.org/10.1134/S1064562420060228
Bibliographic databases:
Document Type: Article
UDC: 517.9
Language: Russian
Citation: L. P. Yugai, “The problem of trajectories avoiding a sparse terminal set”, Dokl. RAN. Math. Inf. Proc. Upr., 495 (2020), 107–111; Dokl. Math., 102:3 (2020), 538–541
Citation in format AMSBIB
\Bibitem{Yug20}
\by L.~P.~Yugai
\paper The problem of trajectories avoiding a sparse terminal set
\jour Dokl. RAN. Math. Inf. Proc. Upr.
\yr 2020
\vol 495
\pages 107--111
\mathnet{http://mi.mathnet.ru/danma143}
\crossref{https://doi.org/10.31857/S268695432006020X}
\zmath{https://zbmath.org/?q=an:1478.49039}
\elib{https://elibrary.ru/item.asp?id=44367213}
\transl
\jour Dokl. Math.
\yr 2020
\vol 102
\issue 3
\pages 538--541
\crossref{https://doi.org/10.1134/S1064562420060228}
Linking options:
  • https://www.mathnet.ru/eng/danma143
  • https://www.mathnet.ru/eng/danma/v495/p107
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia
    Statistics & downloads:
    Abstract page:115
    Full-text PDF :47
    References:13
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024