Progressive time optimal control of reactive systems

S. Ware, R. Su
{"title":"Progressive time optimal control of reactive systems","authors":"S. Ware, R. Su","doi":"10.1109/CDC.2015.7402767","DOIUrl":null,"url":null,"abstract":"In many practical applications, we need to compute a nonblocking supervisor that not only complies with pre-specified safety requirements but also achieves a certain time optimal performance such as maximum throughput. Previous time optimal synthesis methods have had the significant drawback of only being able to deal with acyclic behavior. In this paper we propose a time optimal synthesis method which can deal with potentially infinite behavior. This is accomplished by dividing a system into progressive behaviors with which the system must be capable of finishing it task within a finite amount of time, and nonprogressive behaviors which can lead to the system having more tasks to complete, and potentially infinite behavior. We also proposed an algorithm with pseudo polynomial time complexity for computing such a supervisor.","PeriodicalId":308101,"journal":{"name":"2015 54th IEEE Conference on Decision and Control (CDC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 54th IEEE Conference on Decision and Control (CDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.2015.7402767","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In many practical applications, we need to compute a nonblocking supervisor that not only complies with pre-specified safety requirements but also achieves a certain time optimal performance such as maximum throughput. Previous time optimal synthesis methods have had the significant drawback of only being able to deal with acyclic behavior. In this paper we propose a time optimal synthesis method which can deal with potentially infinite behavior. This is accomplished by dividing a system into progressive behaviors with which the system must be capable of finishing it task within a finite amount of time, and nonprogressive behaviors which can lead to the system having more tasks to complete, and potentially infinite behavior. We also proposed an algorithm with pseudo polynomial time complexity for computing such a supervisor.
无功系统的渐进时间最优控制
在许多实际应用中,我们需要计算一个既符合预先规定的安全要求,又能达到一定时间内最优性能(如最大吞吐量)的无阻塞监控器。以前的时间优化合成方法有一个明显的缺点,即只能处理无环行为。本文提出了一种处理潜在无限行为的时间最优综合方法。这是通过将系统划分为渐进行为(系统必须能够在有限时间内完成任务)和非渐进行为(可能导致系统有更多任务需要完成)以及潜在的无限行为来实现的。我们还提出了一种具有伪多项式时间复杂度的算法来计算这种监督器。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信