On the minimum attention control problem for linear systems: A linear programming approach

M. Donkers, P. Tabuada, W. Heemels
{"title":"On the minimum attention control problem for linear systems: A linear programming approach","authors":"M. Donkers, P. Tabuada, W. Heemels","doi":"10.1109/CDC.2011.6161239","DOIUrl":null,"url":null,"abstract":"In this paper, we present a novel solution to the minimum attention control problem. In minimum attention control, the objective is to minimise the ‘attention’ that a control task requires, given certain performance requirements. Here, we interpret ‘attention’ as the inverse of the time elapsed between two consecutive executions of a control task. Instrumental for the solution will be a novel extension of the notion of a control Lyapunov function. By focussing on linear plants, by allowing for only a finite number of possible intervals between two subsequent executions of the control task and by taking the extended control Lyapunov function to be ∞-norm based, we can formulate the minimum attention control problem as a linear program, which can be solved efficiently online. Furthermore, we provide a technique to construct suitable ∞-norm-based (extended) control Lyapunov functions for our purposes. Finally, we illustrate the theory using a numerical example, showing that minimum attention control can outperform an alternative implementation-aware control law available in the literature.","PeriodicalId":360068,"journal":{"name":"IEEE Conference on Decision and Control and European Control Conference","volume":"143 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Conference on Decision and Control and European Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.2011.6161239","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

Abstract

In this paper, we present a novel solution to the minimum attention control problem. In minimum attention control, the objective is to minimise the ‘attention’ that a control task requires, given certain performance requirements. Here, we interpret ‘attention’ as the inverse of the time elapsed between two consecutive executions of a control task. Instrumental for the solution will be a novel extension of the notion of a control Lyapunov function. By focussing on linear plants, by allowing for only a finite number of possible intervals between two subsequent executions of the control task and by taking the extended control Lyapunov function to be ∞-norm based, we can formulate the minimum attention control problem as a linear program, which can be solved efficiently online. Furthermore, we provide a technique to construct suitable ∞-norm-based (extended) control Lyapunov functions for our purposes. Finally, we illustrate the theory using a numerical example, showing that minimum attention control can outperform an alternative implementation-aware control law available in the literature.
线性系统最小注意控制问题:一种线性规划方法
本文提出了一种解决最小注意控制问题的新方法。在最小注意力控制中,目标是在给定某些性能要求的情况下,将控制任务所需的“注意力”最小化。在这里,我们将“注意力”解释为两个连续执行控制任务之间的时间倒数。对控制李雅普诺夫函数概念的新扩展将有助于解决这一问题。通过关注线性植物,通过在两个后续执行控制任务之间只允许有限数量的可能间隔,并通过将扩展控制Lyapunov函数作为基于∞范数的函数,我们可以将最小注意力控制问题表示为线性规划,可以在线有效地求解。此外,我们提供了一种技术来构造适合的基于∞范数的(扩展)控制李雅普诺夫函数。最后,我们用一个数值例子来说明该理论,表明最小注意力控制可以优于文献中可用的替代实现感知控制律。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信