The beta version of DROPS 2 is now publicly available! Check this page out at DROPS 2 now!


License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2016.12
URN: urn:nbn:de:0030-drops-66355
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6635/
Go to the corresponding LIPIcs Volume Portal

Kim, Anthony ; Liaghat, Vahid ; Qin, Junjie ; Saberi, Amin

Online Energy Storage Management: an Algorithmic Approach

pdf-format:
LIPIcs-APPROX-RANDOM-2016-12.pdf (0.6 MB)

Abstract

Motivated by the importance of energy storage networks in smart grids, we provide an algorithmic study of the online energy storage management problem in a network setting, the first to the best of our knowledge. Given online power supplies, either entirely renewable supplies or those in combination with traditional supplies, we want to route power from the supplies to demands using storage units subject to a decay factor. Our goal is to maximize the total utility of satisfied demands less the total production cost of routed power. We model renewable supplies with the zero production cost function and traditional supplies with convex production cost functions. For two natural storage unit settings, private and public, we design poly-logarithmic competitive algorithms in the network flow model using the dual fitting and online primal dual methods for convex problems. Furthermore, we show strong hardness results for more general settings of the problem. Our techniques may be of independent interest in other routing and storage management problems.

BibTeX - Entry

@InProceedings{kim_et_al:LIPIcs:2016:6635,
  author =	{Anthony Kim and Vahid Liaghat and Junjie Qin and Amin Saberi},
  title =	{{Online Energy Storage Management: an Algorithmic Approach}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
  pages =	{12:1--12:23},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-018-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{60},
  editor =	{Klaus Jansen and Claire Mathieu and Jos{\'e} D. P. Rolim and Chris Umans},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6635},
  URN =		{urn:nbn:de:0030-drops-66355},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2016.12},
  annote =	{Keywords: Online Algorithms, Competitive Analysis, Routing, Storage, Approximation Algorithms, Power Control}
}

Keywords: Online Algorithms, Competitive Analysis, Routing, Storage, Approximation Algorithms, Power Control
Collection: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)
Issue Date: 2016
Date of publication: 06.09.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI