arXiv subjects

Aranya Chakrabortty

Publications and source records attributed to Aranya Chakrabortty.

42 records · Page 3Linked to original sources

arXiv2017

Locating Power Flow Solution Space Boundaries: A Numerical Polynomial Homotopy Approach

The solution space of any set of power flow equations may contain different number of real-valued solutions. The boundaries that separate these regions are referred to as power flow solution space boundaries. Knowledge of these boundaries is important as they provide a measure for voltage stability. Traditionally, continuation based methods have been employed to compute these boundaries on the basis of initial guesses for the solution. However, with rapid growth of renewable energy sources these boundaries will be increasingly affected by variable parameters such as penetration levels, locations of the renewable sources, and voltage set-points, making it difficult to generate an initial guess that can guarantee all feasible solutions for the power flow problem. In this paper we solve this problem by applying a numerical polynomial homotopy based continuation method. The proposed method guarantees to find all solution boundaries within a given parameter space up to a chosen level of discretization, independent of any initial guess. Power system operators can use this computational tool conveniently to plan the penetration levels of renewable sources at different buses. We illustrate the proposed method through simulations on 3-bus and 10-bus power system examples with renewable generation.

eess.SY↗

arXiv2017

Optimization Algorithms for Catching Data Manipulators in Power System Estimation Loops

In this paper we develop a set of algorithms that can detect the identities of malicious data-manipulators in distributed optimization loops for estimating oscillation modes in large power system models. The estimation is posed in terms of a consensus problem among multiple local estimators that jointly solve for the characteristic polynomial of the network model. If any of these local estimates are compromised by a malicious attacker, resulting in an incorrect value of the consensus variable, then the entire estimation loop can be destabilized. We present four iterative algorithms by which this instability can be quickly detected, and the identities of the compromised estimators can be revealed. The algorithms are solely based on the computed values of the estimates, and do not need any information about the model of the power system. Both large and covert attacks are considered. Results are illustrated using simulations of a IEEE 68-bus power system model.

eess.SY↗

arXiv2017

A Retrofitting-based Supplementary Controller Design for Enhancing Damping Performance of Wind Power Systems

In this paper we address the growing concerns of wind power integration from the perspective of power system dynamics and stability. We propose a new retrofit control technique where an additional controller is designed at the doubly-fed induction generator site inside the wind power plant. This controller cancels the adverse impacts of the power flow from the wind side to the grid side on the dynamics of the overall power system. The main advantage of this controller is that it can be implemented by feeding back only the wind states and wind bus voltage without depending on any of the other synchronous machines in the rest of the system. Through simulations of a 4-machine Kundur power system model we show that the retrofit can efficiently enhance the damping performance of the system variable despite very high values of wind penetration.

eess.SY↗

arXiv2017

Game-Theoretic Multi-Agent Control and Network Cost Allocation under Communication Constraints

Multi-agent networked linear dynamic systems have attracted attention of researchers in power systems, intelligent transportation, and industrial automation. The agents might cooperatively optimize a global performance objective, resulting in social optimization, or try to satisfy their own selfish objectives using a noncooperative differential game. However, in these solutions, large volumes of data must be sent from system states to possibly distant control inputs, thus resulting in high cost of the underlying communication network. To enable economically-viable communication, a game-theoretic framework is proposed under the \textit{communication cost}, or \textit{sparsity}, constraint, given by the number of communicating state/control input pairs. As this constraint tightens, the system transitions from dense to sparse communication, providing the trade-off between dynamic system performance and information exchange. Moreover, using the proposed sparsity-constrained distributed social optimization and noncooperative game algorithms, we develop a method to allocate the costs of the communication infrastructure fairly and according to the agents' diverse needs for feedback and cooperation. Numerical results illustrate utilization of the proposed algorithms to enable and ensure economic fairness of wide-area control among power companies.

eess.SY↗

arXiv2014

A Global Identifiability Condition for Consensus Networks with Tree Graphs

In this paper we present a sufficient condition that guarantees identifiability of linear network dynamic systems exhibiting continuous-time weighted consensus protocols with acyclic structure. Each edge of the underlying network graph $\mathcal G$ of the system is defined by a constant parameter, referred to as the weight of the edge, while each node is defined by a scalar state whose dynamics evolve as the weighted linear combination of its difference with the states of its neighboring nodes. Following the classical definitions of identifiability and indistinguishability, we first derive a condition that ensure the identifiability of the edge weights of $\mathcal G$ in terms of the associated transfer function. Using this characterization, we propose a sensor placement algorithm that guarantees identifiability of the edge weights. We describe our results using several illustrative examples.

eess.SY↗

arXiv2014

Exploring the Impact of Wind Penetration on Power System Equilibrium Using a Numerical Continuation Approach

In this paper we investigate how the equilibrium characteristics of conventional power systems may change with an increase in wind penetration. We first derive a differential-algebraic model of a power system network consisting of synchronous generators, loads and a wind power plant modeled by a wind turbine and a doubly-fed induction generator (DFIG). The models of these three components are coupled via nonlinear power flow equations. In contrast to the traditional approach for solving the power flows via iterative methods that often lead to only local solutions, we apply a recently developed parameter-homotopy based numerical continuation algorithm to compute all possible solutions. The method solves the power flow equations over multiple values of the wind penetration level with far less computational effort instead of solving them at each value individually. We observe that depending on the penetration limit and the setpoint value for the magnitude of the wind bus voltage, the system may exhibit several undesired or even unstable equilibria. We illustrate these results through a detailed simulation of a 5-machine power system model with wind injection, and highlight how the solutions may be helpful for small-signal stability assessment.

eess.SY↗