数据驱动的加工网络自适应调度策略

IF 2.4 Q2 AUTOMATION & CONTROL SYSTEMS
Fethi Bencherki;Anders Rantzer
{"title":"数据驱动的加工网络自适应调度策略","authors":"Fethi Bencherki;Anders Rantzer","doi":"10.1109/LCSYS.2024.3516637","DOIUrl":null,"url":null,"abstract":"This letter presents and analyzes an adaptive data-driven controller that learns the optimal processing rate in a multi-unit processing network in the presence of disturbances. We formulate an optimization problem of linear cost, linear dynamics for the processing network model and an affine constraint on the dispatcher policy. A data-driven linear equation is constructed, based on which the online dispatcher policy is updated. An upper bound on the gap between the optimal cost and the cost incurred by the data-driven controller is extracted.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":"8 ","pages":"2841-2846"},"PeriodicalIF":2.4000,"publicationDate":"2024-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Data-Driven Adaptive Dispatching Policies for Processing Networks\",\"authors\":\"Fethi Bencherki;Anders Rantzer\",\"doi\":\"10.1109/LCSYS.2024.3516637\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This letter presents and analyzes an adaptive data-driven controller that learns the optimal processing rate in a multi-unit processing network in the presence of disturbances. We formulate an optimization problem of linear cost, linear dynamics for the processing network model and an affine constraint on the dispatcher policy. A data-driven linear equation is constructed, based on which the online dispatcher policy is updated. An upper bound on the gap between the optimal cost and the cost incurred by the data-driven controller is extracted.\",\"PeriodicalId\":37235,\"journal\":{\"name\":\"IEEE Control Systems Letters\",\"volume\":\"8 \",\"pages\":\"2841-2846\"},\"PeriodicalIF\":2.4000,\"publicationDate\":\"2024-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Control Systems Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10794679/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Control Systems Letters","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10794679/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

本文提出并分析了一种自适应数据驱动控制器,该控制器在存在干扰的多单元处理网络中学习最佳处理速率。我们提出了一个线性代价优化问题、处理网络模型的线性动力学问题和调度策略的仿射约束问题。构造了一个数据驱动的线性方程,在此基础上更新在线调度策略。提取了最优代价与数据驱动控制器产生的代价之差的上界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Data-Driven Adaptive Dispatching Policies for Processing Networks
This letter presents and analyzes an adaptive data-driven controller that learns the optimal processing rate in a multi-unit processing network in the presence of disturbances. We formulate an optimization problem of linear cost, linear dynamics for the processing network model and an affine constraint on the dispatcher policy. A data-driven linear equation is constructed, based on which the online dispatcher policy is updated. An upper bound on the gap between the optimal cost and the cost incurred by the data-driven controller is extracted.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Control Systems Letters
IEEE Control Systems Letters Mathematics-Control and Optimization
CiteScore
4.40
自引率
13.30%
发文量
471
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信