Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Izv. IMI UdGU:
Year:
Volume:
Issue:
Page:
Find






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


Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, 2022, Volume 60, Pages 16–33
DOI: https://doi.org/10.35634/2226-3594-2022-60-02
(Mi iimi433)
 

This article is cited in 3 scientific papers (total in 3 papers)

MATHEMATICS

Approximate calculation of reachable sets for linear control systems with different control constraints

I. V. Zykov

Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, ul. S. Kovalevskoi, 16, Yekaterinburg, 620108, Russia
Full-text PDF (275 kB) Citations (3)
References:
Abstract: The paper considers the problem of approximate construction of reachability sets for a linear control system, when the control action is constrained simultaneously by geometric and several integral constraints. A variant of the transition from a continuous to a discrete system is proposed by uniformly dividing the time interval and replacing the controls at the step of dividing them with their mean values. The convergence of the reachability set of the approximating system to the reachability set of the original system in the Hausdorff metric is proved as the discretization step tends to zero, and an estimate is obtained for the rate of convergence. An algorithm for constructing the boundary of reachable sets based on solving a family of conic programming problems is proposed. Numerical simulation has been carried out.
Keywords: controlled system, reachable set, double constraints, integral constraints, geometric constraints, discrete approximation, Hausdorff metric.
Funding agency Grant number
Ministry of Science and Higher Education of the Russian Federation 075-02-2022-874
The work was performed as part of research conducted in the Ural Mathematical Center with the financial support of the Ministry of Science and Higher Education of the Russian Federation (Agreement number 075–02–2022–874).
Received: 13.02.2022
Accepted: 10.07.2022
Bibliographic databases:
Document Type: Article
UDC: 517.977.55, 517.977.58
MSC: 49M25, 49N05
Language: Russian
Citation: I. V. Zykov, “Approximate calculation of reachable sets for linear control systems with different control constraints”, Izv. IMI UdGU, 60 (2022), 16–33
Citation in format AMSBIB
\Bibitem{Zyk22}
\by I.~V.~Zykov
\paper Approximate calculation of reachable sets for linear control systems with different control constraints
\jour Izv. IMI UdGU
\yr 2022
\vol 60
\pages 16--33
\mathnet{http://mi.mathnet.ru/iimi433}
\crossref{https://doi.org/10.35634/2226-3594-2022-60-02}
Linking options:
  • https://www.mathnet.ru/eng/iimi433
  • https://www.mathnet.ru/eng/iimi/v60/p16
  • This publication is cited in the following 3 articles:
    1. D.N. Ibragimov, S.S. Samonov, “On the conditions of limited sets of reachability and controllability for linear systems with discrete time and total first-order constraints on scalar control”, Modelling and Data Analysis, 15:1 (2025), 51  crossref
    2. V. P. Maksimov, “K voprosu o tochnosti vychisleniya dostizhimykh znachenii tselevykh funktsionalov dlya sistem upravleniya s nepreryvnym i diskretnym vremenem”, Tr. IMM UrO RAN, 30, no. 3, 2024, 207–216  mathnet  crossref  elib
    3. V. P. Maksimov, “On the Error of Calculating the Reachable Values of Objective Functionals for Control Systems with Continuous and Discrete Times”, Proc. Steklov Inst. Math., 327:S1 (2024), S198  crossref
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta
    Statistics & downloads:
    Abstract page:245
    Full-text PDF :93
    References:24
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025