Aggregative Game for Distributed Charging Strategy of PEVs in a Smart Charging Station

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

This paper proposes a charging strategy for plug-in electric vehicles (PEVs) in a smart charging station (SCS) that considers load constraints and time anxieties. Due to the rapidly growing load demand of PEVs and the load capacity investments in infrastructure, PEV charging needs to be subject to overload limits, beyond which failures can occur. The time anxiety is presented to address some of the uncertainties that may arise while charging PEVs. Under an aggregative game framework, this paper constructs a price-driven charging model to minimize costs by choosing the optimal charging strategy. Meanwhile, since the driver information is an aggregated item in the PEV cost function, the drivers’ privacy can be protected. Then, a distributed reflected forward–backward (RFB) splitting method is developed to search for the generalized Nash equilibria (GNE) of the game. The convergence of the proposed algorithm and the effectiveness of the charging strategy are verified by the detailed simulation and results.

Cite

CITATION STYLE

APA

Kang, T., Li, H., & Zheng, L. (2023). Aggregative Game for Distributed Charging Strategy of PEVs in a Smart Charging Station. Axioms, 12(2). https://doi.org/10.3390/axioms12020186

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free