143,376 research outputs found
Model Predictive Control for Smart Grids with Multiple Electric-Vehicle Charging Stations
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 constraints and
meeting demand. The present paper develops a model predictive control (MPC)-
based approach to address the joint PEV charging scheduling and power control
to minimize both PEV charging cost and energy generation cost in meeting both
residence and PEV power demands. Unlike in related works, no assumptions are
made about the probability distribution of PEVs' arrivals, the known PEVs'
future demand, or the unlimited charging capacity of PEVs. The proposed
approach is shown to achieve a globally optimal solution. Numerical results for
IEEE benchmark power grids serving Tesla Model S PEVs show the merit of this
approach
Efficient Database Generation for Data-driven Security Assessment of Power Systems
Power system security assessment methods require large datasets of operating
points to train or test their performance. As historical data often contain
limited number of abnormal situations, simulation data are necessary to
accurately determine the security boundary. Generating such a database is an
extremely demanding task, which becomes intractable even for small system
sizes. This paper proposes a modular and highly scalable algorithm for
computationally efficient database generation. Using convex relaxation
techniques and complex network theory, we discard large infeasible regions and
drastically reduce the search space. We explore the remaining space by a highly
parallelizable algorithm and substantially decrease computation time. Our
method accommodates numerous definitions of power system security. Here we
focus on the combination of N-k security and small-signal stability.
Demonstrating our algorithm on IEEE 14-bus and NESTA 162-bus systems, we show
how it outperforms existing approaches requiring less than 10% of the time
other methods require.Comment: Database publicly available at:
https://github.com/johnnyDEDK/OPs_Nesta162Bus - Paper accepted for
publication at IEEE Transactions on Power System
Decomposition Algorithms for Stochastic Programming on a Computational Grid
We describe algorithms for two-stage stochastic linear programming with
recourse and their implementation on a grid computing platform. In particular,
we examine serial and asynchronous versions of the L-shaped method and a
trust-region method. The parallel platform of choice is the dynamic,
heterogeneous, opportunistic platform provided by the Condor system. The
algorithms are of master-worker type (with the workers being used to solve
second-stage problems, and the MW runtime support library (which supports
master-worker computations) is key to the implementation. Computational results
are presented on large sample average approximations of problems from the
literature.Comment: 44 page
- …