Computation time analysis of centralized and distributed optimization algorithms applied to automated irrigation networks

Alireza Farhadi, Peter M. Dower, Michael Cantoni
2013 2013 Australian Control Conference  
This paper compares 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 active set method that does not exploit problem structure. The second is distributed and is based on a consensus algorithm, not specifically tailored to account for system structure. It is shown that there is a significant
more » ... is a significant advantage in terms of computation overhead (the time spent computing the optimal solution) in using the second algorithm in large-scale networks. Specifically, for a fixed horizon length the computation overhead of the centralized algorithm grows as O(n 5 ) with the number n of sub-systems. By contrast, it is observed via a combination of analysis and experiment that given n times resources for computation the computation overhead of the distributed algorithm grows as O(n) with the number n of sub-systems.
doi:10.1109/aucc.2013.6697283 dblp:conf/aucc/FarhadiDC13 fatcat:ivoukhcnwzcodirowiwkm25v7m