{"title":"一种用于自动化灌溉网络的分布式优化算法的计算时间分析","authors":"A. Farhadi, M. Cantoni, P. Dower","doi":"10.1109/CDC.2013.6760207","DOIUrl":null,"url":null,"abstract":"This paper considers the computation time of two algorithms for solving a structured constrained linear optimal control problem with finite horizon quadratic cost within the context of automated irrigation networks. The first is a standard centralized algorithm based on the interior point method that does not exploit problem structure. The second is distributed and based on a consensus algorithm, not specifically tailored to account for system structure, but devised rather to facilitate the management of conflicting computational and communication overheads. It is shown that there is a significant advantage in terms of computation time in using the second algorithm in large-scale networks. Specifically, for a fixed horizon length the computation time of the centralized algorithm grows as O(n4) with the number n of sub-systems. By contrast, it is observed via a combination of analysis and experiment that the computation time of the distributed algorithm grows as O(n) with the number n of sub-systems.","PeriodicalId":415568,"journal":{"name":"52nd IEEE Conference on Decision and Control","volume":"122 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Computation time analysis of a distributed optimization algorithm applied to automated irrigation networks\",\"authors\":\"A. Farhadi, M. Cantoni, P. Dower\",\"doi\":\"10.1109/CDC.2013.6760207\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the computation time of two algorithms for solving a structured constrained linear optimal control problem with finite horizon quadratic cost within the context of automated irrigation networks. The first is a standard centralized algorithm based on the interior point method that does not exploit problem structure. The second is distributed and based on a consensus algorithm, not specifically tailored to account for system structure, but devised rather to facilitate the management of conflicting computational and communication overheads. It is shown that there is a significant advantage in terms of computation time in using the second algorithm in large-scale networks. Specifically, for a fixed horizon length the computation time of the centralized algorithm grows as O(n4) with the number n of sub-systems. By contrast, it is observed via a combination of analysis and experiment that the computation time of the distributed algorithm grows as O(n) with the number n of sub-systems.\",\"PeriodicalId\":415568,\"journal\":{\"name\":\"52nd IEEE Conference on Decision and Control\",\"volume\":\"122 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"52nd IEEE Conference on Decision and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.2013.6760207\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"52nd IEEE Conference on Decision and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.2013.6760207","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Computation time analysis of a distributed optimization algorithm applied to automated irrigation networks
This paper considers the computation time of two algorithms for solving a structured constrained linear optimal control problem with finite horizon quadratic cost within the context of automated irrigation networks. The first is a standard centralized algorithm based on the interior point method that does not exploit problem structure. The second is distributed and based on a consensus algorithm, not specifically tailored to account for system structure, but devised rather to facilitate the management of conflicting computational and communication overheads. It is shown that there is a significant advantage in terms of computation time in using the second algorithm in large-scale networks. Specifically, for a fixed horizon length the computation time of the centralized algorithm grows as O(n4) with the number n of sub-systems. By contrast, it is observed via a combination of analysis and experiment that the computation time of the distributed algorithm grows as O(n) with the number n of sub-systems.