arXiv subjects

Nilanjan Roy Chowdhury

Publications and source records attributed to Nilanjan Roy Chowdhury.

4 recordsLinked to original sources

arXiv2026

Fixed-Time Voltage Regulation in Distribution Networks with Impedance Awareness

This letter introduces an optimization-based fixed time control algorithm for solving the voltage regulation problem of a radial and balanced power distribution network. The proposed algorithm requires no prior knowledge of the exact network impedance (resistance and reactance), yet guarantees voltage convergence to the predefined safe limit within a fixed time-window. We embrace results from Fixed-time stability (FxTs) and Control Lyapunov function (CLF) to analyze the stability and robustness of the underlying algorithm and then synthesize it leveraging the Quadratic Programming (QP) approach. We first analytically provide sufficient conditions on the control gains and the design parameters, that can ensure voltage regulation in fixed-time. Thereafter we transform the existing voltage regulation problem into an equivalent QP-based optimization framework and translate the aforesaid conditions to find feasible solutions for voltage stability. We empirically verify the efficacy of our proposed algorithm on the IEEE-33 bus distribution network and compare its performance against other existing robust control methods.

eess.SY↗

arXiv2020

Storage placement policy for minimizing frequency deviation: A combinatorial optimization approach

As the share of renewable sources is increasing the need for multiple storage units appropriately sized and located is essential to achieve better inertial response. This work focuses on the question of "how to distribute constant number of storage units in the gird under transient events such that the inertial response of the maximum frequency deviation is minimized?". To answer this question, we provide a comprehensive modeling framework for energy storage units placement and size for frequency stability under spatial effects. The distributed storage units are modeled as grid supporting inverters and the total storage capacity in the grid is bounded based on the allowed steady-state frequency deviation after disturbances. The problem of finding the optimal distributions can be considered as combinatorial problem which consists of high dimensional solutions. In this light, we develop two numeric approaches based on Brute-force search and adaptation of the Cross-entropy method for finding the best distribution and examined it on a case study of the future Israeli grid. The results on the case study provide a new insight---the storage units should be placed around the area of the disturbances, including in sites with high inertia in accordance to the network topology.

eess.SY↗

arXiv2019

A New Cyber-Secure Countermeasure for LTI systems under DoS attacks

This paper presents a new counter-measure to mitigate denial-of-service cyber-attacks in linear time-invariant (LTI) systems. We first design a sparse linear quadratic regulator (LQR) optimal controller for a given LTI plant and evaluate the priority of the feedback communication links in terms of the loss of closed-loop performance when the corresponding block of the feedback gain matrix is removed. An attacker may know about this priority ordering, and thereby attack the links with the highest priority. To prevent this, we present a message rerouting strategy by which the states that are scheduled to be transmitted through the high priority links can be rerouted through lower priority ones in case the former get attacked. Since the attacked link is not available for service, and the states of the low priority links can no longer be accommodated either, we run a structured $\mathcal{H}_2$ control algorithm to determine the post-attack optimal feedback gains. We illustrate various aspects of the proposed algorithms by simulations.

eess.SY↗

arXiv2014

Persistence based analysis of consensus protocols for dynamic graph networks

This article deals with the consensus problem involving agents with time-varying singularities in the dynamics or communication in undirected graph networks. Existing results provide control laws which guarantee asymptotic consensus. These results are based on the analysis of a system switching between piecewise constant and time-invariant dynamics. This work introduces a new analysis technique relying upon classical notions of persistence of excitation to study the convergence properties of the time-varying multi-agent dynamics. Since the individual edge weights pass through singularities and vary with time, the closed-loop dynamics consists of a non-autonomous linear system. Instead of simplifying to a piecewise continuous switched system as in literature, smooth variations in edge weights are allowed, albeit assuming an underlying persistence condition which characterizes sufficient inter-agent communication to reach consensus. The consensus task is converted to edge-agreement in order to study a stabilization problem to which classical persistence based results apply. The new technique allows precise computation of the rate of convergence to the consensus value.

eess.SY↗