{"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.