28 September 2018 in IEEE Transactions on Smart Grid
Electrochemical energy storage (ES) units (e.g. batteries) have been field-validated as an efficient back-up resource that enhances resilience of distribution systems. However, using these units for resilience is insufficient to justify their installation economically and, therefore, these units are often installed in locations where they yield the greatest economic value during normal operations. Motivated by the recent progress in mobile ES technologies, i.e. ES units can be moved using public transportation routes, this paper proposes to use this spatial flexibility to bridge the gap between the economically optimal locations during normal operations and the locations where extra back-up capacity is necessary during disasters. We propose a two-stage optimization model that optimizes investments in mobile ES units in the first stage and can re-route the installed mobile ES units in the second stage to form dynamic microgrids (MGs) and to avoid the expected load shedding caused by disasters. Since the proposed model cannot be solved efficiently with off-the-shelf solvers, even for relatively small instances, we apply the progressive hedging algorithm. The proposed model and algorithm are tested on a 15-bus radial distribution test system.
23 December 2019 in IEEE Transactions on Power Systems
Peer-to-peer interactions between small-scale energy resources exploit distribution network infrastructure as an electricity carrier, but remain financially unaccountable to electric power utilities. This status-quo raises multiple challenges. First, peer-to-peer energy trading reduces the portion of electricity supplied to end-customers by utilities and their revenue streams. Second, utilities must ensure that peer-to-peer transactions comply with distribution network limits. This paper proposes a peer-to-peer energy trading architecture, in two configurations, that couples peer-to-peer interactions and distribution network operations. The first configuration assumes that these interactions are settled by the utility in a centralized manner, while the second one is peer-centric and does not involve the utility. Both configurations use distribution locational marginal prices to compute network usage charges that peers must pay to the utility for using the distribution network.
11 May 2021 in IEEE Transactions on Power Systems
Appropriately designed renewable support policies can play a leading role in promoting renewable expansions and contribute to low emission goals. Meanwhile, ill-designed policies may distort electricity markets, put power utilities and generation companies on an unlevel playing field and, in turn, cause inefficiencies. This paper proposes a framework to optimize policymaking for renewable energy sources, while incorporating conflicting interests and objectives of different stakeholders. We formulate a tri-level optimization problem where each level represents a different entity: a state regulator, a power utility and a wholesale electricity market. To solve this tri-level problem, we exploit optimality conditions and develop a modification of the Column-and-Cut Generation (C&CG) algorithm that generates cuts for bilinear terms. The case study based on the ISO New England 8-zone test system reveals different policy trade-offs that policymakers face under different decarbonization goals and implementation scenarios.
29 February 2024 in IEEE Transactions on Control of Network Systems
Graph signal processing (GSP) has emerged as a powerful tool for practical network applications, including power system monitoring. Recent research has focused on developing GSP-based methods for state estimation, attack detection, and topology identification using the representation of the power system voltages as smooth graph signals. Within this framework, efficient methods have been developed for detecting false data injection (FDI) attacks, which until now were perceived as non-smooth with respect to the graph Laplacian matrix. Consequently, these methods may not be effective against smooth FDI attacks. In this paper, we propose a graph FDI (GFDI) attack that minimizes the Laplacian-based graph total variation (TV) under practical constraints. We present the GFDI attack as the solution for a non-convex constrained optimization problem. The solution to the GFDI attack problem is obtained through approximating it using $\ell _{1}$ relaxation. A series of quadratic programming problems that are classified as convex optimization problems are solved to obtain the final solution. We then propose a protection scheme that identifies the minimal set of measurements necessary to constrain the GFDI output to a high graph TV, thereby enabling its detection by existing GSP-based detectors. Our numerical simulations on the IEEE-57 and IEEE-118 bus test cases reveal the potential threat posed by well-designed GSP-based FDI attacks. Moreover, we demonstrate that integrating the proposed protection design with GSP-based detection can lead to significant hardware cost savings compared to previous designs of protection methods against FDI attacks.
1 December 2020 in Electric Power Systems Research