2019
DOI: 10.1109/tsg.2017.2789333
|View full text |Cite
|
Sign up to set email alerts
|

Model Predictive Control for Smart Grids With Multiple Electric-Vehicle Charging Stations

Abstract: Next-generation power grids will likely enable concurrent service for residences and plug-in electric vehicles (PEVs). While the residence power demand profile is known and thus can be considered inelastic, the PEVs' power demand is only known after random PEVs' arrivals. PEV charging scheduling aims at minimizing the potential impact of the massive integration of PEVs into power grids to save service costs to customers while power control aims at minimizing the cost of power generation subject to operating co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
58
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3
3
2

Relationship

2
6

Authors

Journals

citations
Cited by 126 publications
(58 citation statements)
references
References 29 publications
0
58
0
Order By: Relevance
“…Following the developments in [41]- [45], instead of handling the nonconvex constraints (29b) and g 2 (y y y) ≥ |Z| and g 3 (c c c) ≥ N −|Z| we incorporate the degree of their satisfaction into the objective in (22), leading to the following penalized optimization problem: where μ > 0 is a penalty parameter. This penalized optimization problem is exact with sufficiently large μ in the sense that its optimal solution is also optimal for (22).…”
Section: Scalable Penalty Algorithms For Optimal Pmu Placementmentioning
confidence: 99%
See 1 more Smart Citation
“…Following the developments in [41]- [45], instead of handling the nonconvex constraints (29b) and g 2 (y y y) ≥ |Z| and g 3 (c c c) ≥ N −|Z| we incorporate the degree of their satisfaction into the objective in (22), leading to the following penalized optimization problem: where μ > 0 is a penalty parameter. This penalized optimization problem is exact with sufficiently large μ in the sense that its optimal solution is also optimal for (22).…”
Section: Scalable Penalty Algorithms For Optimal Pmu Placementmentioning
confidence: 99%
“…The computational complexity of Algorithm 1 is determined by (45), which is the computational complexity of the convex problem (41)/(42) solved at each iteration, and the number of iterations for its convergence. Fig.…”
Section: B Computation Experiencementioning
confidence: 99%
“…Like [13], we consider an electric power grid with a set of buses N := {1, 2, ..., N } connected through a set of flow lines L ⊆ N ×N , under which bus k is connected to bus m if and only if (k, m) ∈ L. Denote by N (k) the set of other buses connected to bus k. G ⊆ N is the set of those buses that are connected to distributed generators (DGs). Bus k ∈ N \ G is not connected to DGs and bus k ∈ G also has a function to serve PEVs and will be referred as charging station (CS) k. Thus, there are M = |G| CSs in the grid.…”
Section: Mpc For Joint Pev Bang-bang Charging Coordination and Grid Pmentioning
confidence: 99%
“…The numerical solution of Eq. (26) shows that the variables converge to zero in the finite time, T r , and the upper bound of this time is as below [23]…”
Section: Two Novel Approaches Of Terminal Sliding Mode Controlmentioning
confidence: 99%
“…In [6], a Cyber-Physical Power System (CPPS) paradigm has been presented for smart transmission grids control, modeling, and monitoring. In [26], a model predictive control (MPC)-based approach has been proposed for smart grids with multiple electric-vehicle charging stations. In [34], a resonance attacks have been investigated on Load Frequency Control of Smart Grids.…”
Section: Introductionmentioning
confidence: 99%