{"title":"部分信息环境下的分布式预定义时间约束社会成本最小化问题","authors":"","doi":"10.1016/j.sysconle.2024.105872","DOIUrl":null,"url":null,"abstract":"<div><p>In this letter, the social cost minimization problem with coupled equality constraints is studied, where the agents endeavor to collaboratively minimize the sum of all local cost functions, and each local cost function depends on a global decision variable consisting of the decisions of all participants. In a setting where only partial information about one’s own decisions and cost function is available, the first single-time scale predefined-time distributed algorithm based on the time-based-generator scheme is designed to tackle the problem. With the help of the Lyapunov stability theory, it is demonstrated that the algorithm can converge to the optimal solution in an arbitrarily specified time independent of the initial state and control parameters. Finally, the effectiveness of the proposed algorithm is verified by numerical simulations.</p></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2024-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed predefined-time constrained social cost minimization problem under the partial information setting\",\"authors\":\"\",\"doi\":\"10.1016/j.sysconle.2024.105872\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this letter, the social cost minimization problem with coupled equality constraints is studied, where the agents endeavor to collaboratively minimize the sum of all local cost functions, and each local cost function depends on a global decision variable consisting of the decisions of all participants. In a setting where only partial information about one’s own decisions and cost function is available, the first single-time scale predefined-time distributed algorithm based on the time-based-generator scheme is designed to tackle the problem. With the help of the Lyapunov stability theory, it is demonstrated that the algorithm can converge to the optimal solution in an arbitrarily specified time independent of the initial state and control parameters. Finally, the effectiveness of the proposed algorithm is verified by numerical simulations.</p></div>\",\"PeriodicalId\":49450,\"journal\":{\"name\":\"Systems & Control Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2024-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Systems & Control Letters\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167691124001609\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Systems & Control Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167691124001609","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
Distributed predefined-time constrained social cost minimization problem under the partial information setting
In this letter, the social cost minimization problem with coupled equality constraints is studied, where the agents endeavor to collaboratively minimize the sum of all local cost functions, and each local cost function depends on a global decision variable consisting of the decisions of all participants. In a setting where only partial information about one’s own decisions and cost function is available, the first single-time scale predefined-time distributed algorithm based on the time-based-generator scheme is designed to tackle the problem. With the help of the Lyapunov stability theory, it is demonstrated that the algorithm can converge to the optimal solution in an arbitrarily specified time independent of the initial state and control parameters. Finally, the effectiveness of the proposed algorithm is verified by numerical simulations.
期刊介绍:
Founded in 1981 by two of the pre-eminent control theorists, Roger Brockett and Jan Willems, Systems & Control Letters is one of the leading journals in the field of control theory. The aim of the journal is to allow dissemination of relatively concise but highly original contributions whose high initial quality enables a relatively rapid review process. All aspects of the fields of systems and control are covered, especially mathematically-oriented and theoretical papers that have a clear relevance to engineering, physical and biological sciences, and even economics. Application-oriented papers with sophisticated and rigorous mathematical elements are also welcome.