Loading...

Computation time analysis of a distributed optimization algorithm applied to automated irrigation networks

Farhadi, A ; Sharif University of Technology | 2013

524 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/CDC.2013.6760207
  3. Publisher: Institute of Electrical and Electronics Engineers Inc , 2013
  4. Abstract:
  5. 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 Ο(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 Ο(n) with the number n of sub-systems
  6. Keywords:
  7. Algorithms ; Irrigation ; Linear programming ; Optimal control systems ; Optimization ; Centralized algorithms ; Communication overheads ; Consensus algorithms ; Distributed optimization ; Interior point methods ; Irrigation Networks ; Large-scale network ; Linear optimal controls ; Distributed computer systems
  8. Source: Proceedings of the IEEE Conference on Decision and Control ; Dec , 2013 , Pages 2193-2199 ; 01912216 (ISSN) ; 9781467357173 (ISBN)
  9. URL: http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6760207&url=http%3A%2F%2Fieeexplore.ieee.org%2Fiel7%2F6749719%2F6759837%2F06760207.pdf%3Farnumber%3D6760207