Suboptimal control of bunches of trajectories of discrete deterministic automaton time-invariant systems
- 作者: Bortakovskii A.1, Nemychenkov G.1
-
隶属关系:
- Moscow Institute of Aviation (National Research University)
- 期: 卷 56, 编号 6 (2017)
- 页面: 914-929
- 栏目: Optimal Control
- URL: https://journals.rcsi.science/1064-2307/article/view/220002
- DOI: https://doi.org/10.1134/S106423071706003X
- ID: 220002
如何引用文章
详细
The optimal control problem for discrete deterministic time-invariant automaton systems under parametric uncertainty is considered. The changes in the state (switching) of the system are described by a recurrence equation. The switching times and their number are not specified in advance—they are found by optimization. The initial state of the system is not known exactly. For this reason, the problems of finding the optimal on the average and the optimal guaranteeing (minimax) controls of bunches of trajectories are formulated. It is proposed to solve these problems using the separation principle, which assumes that the bunch is controlled using the control that is optimal for a specially chosen individual trajectory in the bunch. Generally, this control is suboptimal. Algorithms for the synthesis of suboptimal control of bunches are developed. It is proved that, in the linear-quadratic time-invariant problems, the suboptimal bunch control is optimal on the average or is the optimal minimax control, depending on the problem being solved.
作者简介
A. Bortakovskii
Moscow Institute of Aviation (National Research University)
编辑信件的主要联系方式.
Email: asbortakov@mail.ru
俄罗斯联邦, Moscow, 125993
G. Nemychenkov
Moscow Institute of Aviation (National Research University)
Email: asbortakov@mail.ru
俄罗斯联邦, Moscow, 125993
![](/img/style/loading.gif)