Dynamic network energy management via proximal message passing

Kraning, Matt|Chu, Eric|Lavaei, Javad

ISBN 10: 1601987145 / ISBN 13: 9781601987143

Editore: Now Publishers Inc, 2013

Riguardo questo articolo

Inhaltsverzeichnis1: Introduction 2: Network Model 3: Device Examples 4: Convexity 5: Proximal message passing 6: Numerical examples 7: Extensions 8: Conclusion. Ackowledgments. References.KlappentextrnrnDyna.

Codice articolo 4231640

Dati bibliografici

• Titolo: Dynamic network energy management via proximal message passing
• Editore: Now Publishers Inc
• Data di pubblicazione: 2013
• Lingua: Inglese
• ISBN 10: 1601987145
• ISBN 13: 9781601987143
• Rilegatura: Brossura
• Condizione: New

Descrizione articolo

Riassunto

Presents a fully decentralized method for dynamic network energy management based on message passing between devices. It considers a network of devices, such as generators, fixed loads, deferrable loads, and storage devices, each with its own dynamic constraints and objective, connected by AC and DC lines. The problem is to minimize the total network objective subject to the device and line constraints, over a given time horizon. This is a large optimization problem, with variables for consumption or generation for each device, power flow for each line, and voltage phase angles at AC buses, in each time period.

This text develops a decentralized method for solving this problem called proximal message passing. The method is iterative: at each step, each device exchanges simple messages with its neighbors in the network and then solves its own optimization problem, minimizing its own objective function, augmented by a term determined by the messages it has received. It is shown that this message passing method converges to a solution when the device objective and constraints are convex. The method is completely decentralized, and needs no global coordination other than synchronizing iterations; the problems to be solved by each device can typically be solved extremely efficiently and in parallel. The method is fast enough that even a serial implementation can solve substantial problems in reasonable time frames.

Results for several numerical experiments are reported, demonstrating the method's speed and scaling, including the solution of a problem instance with over ten million variables in under fifty minutes for a serial implementation; with decentralized computing, the solve time would be less than one second.