Loading...

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

Farhadi, A ; Sharif University of Technology | 2013

754 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/AUCC.2013.6697283
  3. Publisher: 2013
  4. Abstract:
  5. 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 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(n5) 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
  6. Keywords:
  7. Active set methods ; Centralized algorithms ; Computation overheads ; Consensus algorithms ; Distributed optimization ; Irrigation Networks ; Large-scale network ; Linear optimal controls ; Algorithms ; Irrigation ; Optimal control systems ; Distributed computer systems
  8. Source: 2013 3rd Australian Control Conference, AUCC 2013, Fremantle, WA ; Nov , 2013 , Pages 263-269 ; 9781479924981 (ISBN)
  9. URL: http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6697283&url=http%3A%2F%2Fieeexplore.ieee.org%2Fiel7%2F6685214%2F6697238%2F06697283.pdf%3Farnumber%3D6697283