1 Search Results for "Qin, Junjie"


Document
Online Energy Storage Management: an Algorithmic Approach

Authors: Anthony Kim, Vahid Liaghat, Junjie Qin, and Amin Saberi

Published in: LIPIcs, Volume 60, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)


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.

Cite as

Anthony Kim, Vahid Liaghat, Junjie Qin, and Amin Saberi. Online Energy Storage Management: an Algorithmic Approach. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 60, pp. 12:1-12:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@InProceedings{kim_et_al:LIPIcs.APPROX-RANDOM.2016.12,
  author =	{Kim, Anthony and Liaghat, Vahid and Qin, Junjie and Saberi, Amin},
  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 =	{Jansen, Klaus and Mathieu, Claire and Rolim, Jos\'{e} D. P. and Umans, Chris},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.12},
  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}
}
  • Refine by Author
  • 1 Kim, Anthony
  • 1 Liaghat, Vahid
  • 1 Qin, Junjie
  • 1 Saberi, Amin

  • Refine by Classification

  • Refine by Keyword
  • 1 Approximation Algorithms
  • 1 Competitive Analysis
  • 1 Online Algorithms
  • 1 Power Control
  • 1 Routing
  • Show More...

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2016

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail