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