Просмотреть запись

COMPUTING THE REACHABLE SET BOUNDARY FOR AN ABSTRACT CONTROL SYSTEM: REVISITED

Электронный научный архив УРФУ

Информация об архиве | Просмотр оригинала
 
 
Поле Значение
 
Заглавие COMPUTING THE REACHABLE SET BOUNDARY FOR AN ABSTRACT CONTROL SYSTEM: REVISITED
 
Автор Gusev, M. I.
 
Тематика REACHABLE SET
NONLINEAR MAPPING
CONTROL SYSTEM
EXTREMAL PROBLEM
MAXIMUM PRINCIPLE
 
Описание A control system can be treated as a mapping that maps a control to a trajectory (output) of the system. From this point of view, the reachable set, which consists of the ends of all trajectories at a given time, can be considered an image of the set of admissible controls into the state space under a nonlinear mapping. The paper discusses some properties of such abstract reachable sets. The principal attention is paid to the description of the set boundary.
 
Дата 2024-02-14T05:20:46Z
2024-02-14T05:20:46Z
2023
 
Тип Article
Journal article (info:eu-repo/semantics/article)
Published version (info:eu-repo/semantics/publishedVersion)
 
Идентификатор Gusev M. I. COMPUTING THE REACHABLE SET BOUNDARY FOR AN ABSTRACT CONTROL SYSTEM: REVISITED / M. I. Gusev. — Text : electronic // Ural Mathematical Journal. — 2023. — Volume 9. — № 2. — P. 99-108.
2414-3952
https://umjuran.ru/index.php/umj/article/view/705
http://elar.urfu.ru/handle/10995/129436
59690656
10.15826/umj.2023.2.008
 
Язык en
 
Связанные ресурсы Ural Mathematical Journal. 2023. Volume 9. № 2
 
Права Creative Commons Attribution License
https://creativecommons.org/licenses/by/4.0/
 
Формат application/pdf