Kenta Hanada1, Takayuki Wada1, Izumi Masubuchi2, Toru Asai3, Yasumasa Fujisaki
16:10 - 16:30 | Tue 20 Aug | Lau, 5-205 | TuC3.3
A time averaging algorithm is proposed for load balancing in distributed power dispatch, where a multi-agent system technique is employed. Each agent is connected to each generator to be controlled, and the agents are linked by the information lines modeled by a directed graph. The objective of this distributed algorithm is to achieve an average load balancing of generators over time. The convergence analysis of the algorithm is provided, which reveals an explicit relation between the number of iterations and the closeness of the ideal balancing in terms of the characteristic values of the graph Laplacian. This result also gives a rigorous stopping rule for the time averaging algorithm. Numerical examples demonstrate preferable behaviors of the proposed algorithm.