Name
Abstract | ||
|---|---|---|
AbstractIn this paper, a novel decentralized algorithm is proposed to minimize power flow loss in a large-scale future grid connecting with many real-time-distributed generation systems by which power flows bi-directionally. The DC-power loss at each link is defined as the product of resistance and the square of current that can be considered as a quadratic flow cost. We employ the notion of tie-sets that reduces the complexity of the power flow loss problem by dividing a power network into a set of loops that forms a linear vector space on which the power loss problem can be formulated as a convex optimization problem. As finding a solution in each tie-set enables global optimization, we realize parallel computing within a system of independent tie-sets by integrating autonomous agents. Simulation results demonstrate the minimization of the power loss on every link by iteratively optimized power flows and show the superiority against the traditional centralized optimization scheme. Copyright © 2014 John Wiley & Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1002/cta.1999 | Periodicals |
Keywords | Field | DocType |
power loss, DC-power flow, smart grid, distributed energy resource, distributed control, tie-set graph theory | Mathematical optimization,Distributed power,Autonomous agent,Global optimization,Smart grid,Control theory,Computer science,Quadratic equation,Minification,Convex optimization,Grid | Journal |
Volume | Issue | ISSN |
43 | 9 | 0098-9886 |
Citations | PageRank | References |
2 | 0.41 | 6 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kiyoshi Nakayama | 1 | 27 | 7.51 |
| Changhong Zhao | 2 | 173 | 18.49 |
| Lubomir Bic | 3 | 332 | 125.18 |
| Michael B. Dillencourt | 4 | 498 | 57.58 |
| Jack Brouwer | 5 | 7 | 1.52 |