arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1307.8232math.OCcs.ITcs.SYeess.SYmath.IT
收藏

最大手松控制与L1最优性

Maximum-Hands-Off Control and L1 Optimality

Kyoto University(京都大学);The University of Newcastle(纽卡斯尔大学);The University of Melbourne(墨尔本大学)

Masaaki Nagahara, Daniel E. Quevedo, Dragan Nesic

AI总结:

本文提出最大手松控制新范式,证明L1最优控制与最大手松控制等价,展示其在连续控制中的应用及有效性。

摘要:

本文提出一种称为最大手松控制的新控制范式。手松控制定义为支持集远小于时间跨度的控制。最大手松控制是所有可行控制中支持集最小的。我们证明L1最优控制问题的解即为最大手松控制,反之亦然。该结果解释了L1最优性在计算最大手松控制中的作用。解通常具有

英文摘要:

In this article, we propose a new paradigm of control, called a maximum-hands-off control. A hands-off control is defined as a control that has a much shorter support than the horizon length. The maximum-hands-off control is the minimum-support (or sparsest) control among all admissible controls. We first prove that a solution to an L1-optimal control problem gives a maximum-hands-off control, and vice versa. This result rationalizes the use of L1 optimality in computing a maximum-hands-off control. The solution has in general the "bang-off-bang" property, and hence the control may be discontinuous. We then propose an L1/L2-optimal control to obtain a continuous hands-off control. Examples are shown to illustrate the effectiveness of the proposed control method.

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

↑