Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Noncooperative and Cooperative Optimization of Electric Vehicle Charging Under Demand Uncertainty: A Robust Stackelberg Game
Chongqing Key Laboratory of Mobile Communications Technology and Institute of Personal Communication, Chongqing University of Posts & Telecommunications, Chongqing.
Chongqing Key Laboratory of Mobile Communications Technology and Institute of Personal Communication, Chongqing University of Posts & Telecommunications, Chongqing.
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.ORCID iD: 0000-0003-1902-9877
Number of Authors: 32016 (English)In: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359, Vol. 65, no 3, p. 1043-1058Article in journal (Refereed) Published
Abstract [en]

This paper studies the problem of energy charging using a robust Stackelberg game approach in a power system composed of an aggregator and multiple electric vehicles (EVs) in the presence of demand uncertainty, where the aggregator and EVs are considered to be a leader and multiple followers, respectively. We propose two different robust approaches under demand uncertainty: a noncooperative optimization and a cooperative design. In the robust noncooperative approach, we formulate the energy charging problem as a competitive game among self-interested EVs, where each EV chooses its own demand strategy to maximize its own benefit selfishly. In the robust cooperative model, we present an optimal distributed energy scheduling algorithm that maximizes the sum benefit of the connected EVs. We theoretically prove the existence and uniqueness of robust Stackelberg equilibrium for the two approaches and develop distributed algorithms to converge to the global optimal solution that are robust against the demand uncertainty. Moreover, we extend the two robust models to a time-varying power system to handle the slowly varying environments. Simulation results show the effectiveness of the robust solutions in uncertain environments.

Place, publisher, year, edition, pages
2016. Vol. 65, no 3, p. 1043-1058
National Category
Media and Communication Technology
Research subject
Mobile and Pervasive Computing
Identifiers
URN: urn:nbn:se:ltu:diva-14506DOI: 10.1109/TVT.2015.2490280ISI: 000372831500006Scopus ID: 2-s2.0-84963900681Local ID: de005e7d-b211-43b7-9933-d5e05ce858e9OAI: oai:DiVA.org:ltu-14506DiVA, id: diva2:987479
Note

Validerad; 2016; Nivå 2; 20160425 (andbra)

Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2018-07-10Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Vasilakos, Athanasios
By organisation
Computer Science
In the same journal
IEEE Transactions on Vehicular Technology
Media and Communication Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 41 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf