arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1109.3772eess.SYcs.SYmath.OC
收藏

线性离散时间系统最小时间控制问题的数值解

A numerical solution to the minimum-time control problem for linear discrete-time systems

Univ Lille Nord de France(法国北部里尔大学);EMDouai, IA(杜艾矿业学院,信息与自动化系)

Laurent Bako, Dulin Chen, Stéphane Lecoeuche

AI总结:

针对任意离散时间线性系统,提出基于稀疏优化的数值方法,通过最小化状态序列中非零元素个数求解最小时间控制问题。

摘要:

最小时间控制问题在于寻找一个控制策略,使给定动态系统从给定初始状态尽可能快地到达给定目标状态(或状态集合)。这是最优控制理论中一个众所周知的挑战性问题,只有少数小维度系统存在闭式解。本文针对任意离散时间线性系统提出了一个非常通用的最小时间问题解。这是一个基于稀疏优化的数值解,即在固定控制时域内最小化状态序列中非零元素的数量。我们考虑了单输入和多输入系统。一个重要观察是,与连续时间情况相反,离散时间系统的最小时间控制不一定完全是bang-bang控制。

英文摘要:

The minimum-time control problem consists in finding a control policy that will drive a given dynamic system from a given initial state to a given target state (or a set of states) as quickly as possible. This is a well-known challenging problem in optimal control theory for which closed-form solutions exist only for a few systems of small dimensions. This paper presents a very generic solution to the minimum-time problem for arbitrary discrete-time linear systems. It is a numerical solution based on sparse optimization, that is the minimization of the number of nonzero elements in the state sequence over a fixed control horizon. We consider both single input and multiple inputs systems. An important observation is that, contrary to the continuous-time case, the minimum-time control for discrete-time systems is not necessarily entirely bang-bang.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑