Optimal Battery Aging: An Adaptive Weights Dynamic Programming Algorithm

We present an algorithm to handle the optimization over a long horizon of an electric microgrid including a battery energy storage system. While the battery is an important and costly component of the microgrid, its aging process is often not taken into account by the energy management system, mostl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of optimization theory and applications Jg. 179; H. 3; S. 1043 - 1053
Hauptverfasser: Heymann, Benjamin, Martinon, Pierre
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.12.2018
Springer Nature B.V
Springer Verlag
Schlagworte:
Adaptive algorithms
Algorithms
Applications of Mathematics
Batteries
Calculus of Variations and Optimal Control; Optimization
Computer simulation
Computing time
Distributed generation
Dynamic programming
Energy management
Energy storage
Engineering
Mathematical models
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Optimization and Control
Parallel processing
Technical Note
Theory of Computation
Weight
Control
93A13
49L20
Energy management system
93C15
Aging
90C39
49M29
49M27
Dynamic programming
Dynamic Programing
Energy Management System
ISSN:0022-3239, 1573-2878
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present an algorithm to handle the optimization over a long horizon of an electric microgrid including a battery energy storage system. While the battery is an important and costly component of the microgrid, its aging process is often not taken into account by the energy management system, mostly because of modeling and computing challenges. We address the computing aspect by a new approach combining dynamic programming, decomposition and relaxation techniques. We illustrate this adaptive weight’ method with numerical simulations for a toy microgrid model. Compared to a straightforward resolution by dynamic programming, our algorithm decreases the computing time by more than one order of magnitude, can be parallelized, and allows for online implementations. We believe that this approach can be used for other applications presenting fast and slow variables.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0022-3239
1573-2878
DOI:10.1007/s10957-018-1371-9