Construction of the Time-Optimal Bounded Control for Linear Discrete-Time Systems Based on the Method of Superellipsoidal Approximation

IF 0.6 4区 计算机科学 Q4 AUTOMATION & CONTROL SYSTEMS
D. N. Ibragimov, V. M. Podgornaya
{"title":"Construction of the Time-Optimal Bounded Control for Linear Discrete-Time Systems Based on the Method of Superellipsoidal Approximation","authors":"D. N. Ibragimov, V. M. Podgornaya","doi":"10.1134/s0005117923090035","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The speed-in-action problem for a linear discrete-time system with bounded control is considered. In the case of superellipsoidal constraints on the control, the optimal control process is constructed explicitly on the basis of the discrete maximum principle. The problem of calculating the initial conditions for an adjoint system is reduced to solving a system of algebraic equations. The algorithm for generating a guaranteeing solution based on the superellipsoidal approximation method is proposed for systems with general convex control constraints. The procedure of superellipsoidal approximation is reduced to solving a number of convex programming problems. Examples are given.</p>","PeriodicalId":55411,"journal":{"name":"Automation and Remote Control","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Automation and Remote Control","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1134/s0005117923090035","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The speed-in-action problem for a linear discrete-time system with bounded control is considered. In the case of superellipsoidal constraints on the control, the optimal control process is constructed explicitly on the basis of the discrete maximum principle. The problem of calculating the initial conditions for an adjoint system is reduced to solving a system of algebraic equations. The algorithm for generating a guaranteeing solution based on the superellipsoidal approximation method is proposed for systems with general convex control constraints. The procedure of superellipsoidal approximation is reduced to solving a number of convex programming problems. Examples are given.

Abstract Image

基于超椭球近似法的线性离散时间系统时间最优有界控制的构建
摘要 研究了具有约束控制的线性离散时间系统的速度-动作问题。在控制有超椭球约束的情况下,根据离散最大原则明确地构造了最优控制过程。计算邻接系统初始条件的问题简化为求解一个代数方程系。针对具有一般凸控制约束的系统,提出了基于上椭球近似法生成保证解的算法。上椭球近似的过程被简化为解决一些凸编程问题。举例说明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Automation and Remote Control
Automation and Remote Control 工程技术-仪器仪表
CiteScore
1.70
自引率
28.60%
发文量
90
审稿时长
3-8 weeks
期刊介绍: Automation and Remote Control is one of the first journals on control theory. The scope of the journal is control theory problems and applications. The journal publishes reviews, original articles, and short communications (deterministic, stochastic, adaptive, and robust formulations) and its applications (computer control, components and instruments, process control, social and economy control, etc.).
文献相关原料
公司名称 产品信息 采购帮参考价格
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信