Searcharxiv⌕ Search

arXiv subjects

Ahmad F. Taha

Publications and source records attributed to Ahmad F. Taha.

At least 19 recordsLinked to original sources

The Race between Protection and Control: Fast Reactive Reserves Against Overvoltage Cascade

In an overvoltage cascade, each relay trip removes reactive power absorption and raises the voltage at other plants, often faster than controls can act. This paper determines how much fast reactive power to hold, where, and how fast, so that no contingency trips a plant. A trip certificate allows a relay to pick up if it resets before its delay expires, making the sizing a linear program. A necessary condition identifies the relays that only preventive action can protect, and the reserve of one control decreases with the relay delay and increases with its latency. In nonlinear simulations of four systems, the corrective actions prevent every trip within the analysis window for relays without reset hysteresis, and each plant's own set point is the most effective reserve. A 2\% hysteresis or a small error in the relay voltage can change the reserve as much as the relay delay.

eess.SY↗

Dynamic Centrality Measures for Water Distribution Network Hydraulics

Water distribution networks (WDNs) are susceptible to various failures, including but not limited to human errors, cyber-attacks, and network modifications, necessitating the vulnerability analysis of WDNs. Graph-theoretic centrality measures---as a main class of centrality measures---aim to rank the network components solely based on their influence (i.e., criticality) on the WDN topology in the case of input changes, while overlooking the WDN dynamics. To overcome such a limitation, this paper uses a control-theoretic centrality measure to identify the network's most and least influential pipes in WDNs, by simultaneously incorporating the dynamics and topology of the WDN. First, given a WDN modeled by nonlinear differential-algebraic equations (NDAEs) consisting of transient flow dynamics as differential equation (DE) and conservation of water mass as algebraic equation (AE) and considering the pipe flow rates as states of the state-space (SS) representation, we extract a linearized system modeled by linear ordinary differential equations (LODEs) around the equilibrium (i.e., steady) flow rate vector. Second, treating pipe flow rates as SS nodes (states), we introduce a node centrality-based measure, namely \textit{vulnerability vector (VV)}, to rank the network pipes based on their influence on the dynamics and topology of the WDN in the case of input changes. In particular, the network's most and least influential pipes can be identified through such a centrality-based approach. This enables water engineers to understand the WDN's vulnerability better and effectively prioritize the maintenance and operational efforts on the most influential pipes within the WDN.

eess.SY↗

Beyond Binary Controllability: Reachability Margins for Power Systems via Scalable Screening

This paper studies unreachability screening for power systems, focusing on the inadequate control authority that arises under stressed grid conditions. Its main result is an infeasibility \textit{margin} for linearized differential algebraic equation models that quantifies how far a prescribed terminal target lies from the reachable set in finite time. The paper specifically develops a conic benchmark method together with two first order methods based on projected subgradients and bundle updates for scalably repeated screening. Studies on IEEE benchmark networks show reduced terminal reachability under stressed conditions and tighter actuation limits, while first order methods remain accurate and substantially faster on large systems. Comparisons with standard reachability methods such as CORA further demonstrate the usefulness and scalability of the proposed infeasibility margins. All results and codes are included in a Github repository.

eess.SY↗

The Iberian Blackout: A Black Swan or a Gray Rhino? A Protection-Aware Dynamic Voltage Security Assessment

On 28 April 2025, the Iberian power system collapsed after a rapid voltage rise that led to widespread generation disconnections and loss of synchronism. The final report of the ENTSO-E Expert Panel attributes the blackout to several interacting factors including ineffective voltage control, fixed power factor operation, misaligned protection settings, manual shunt reactor switching, and limited observability. These factors raise a general question: given the current state, can the next trip, ramp, topology action, or shunt switching raise the voltages measured by overvoltage relays above their settings before voltage controls respond? We answer it with a protection-aware dynamic voltage security assessment. For each candidate event, the method computes the voltage at every overvoltage relay over the relay time window from a dynamic model of the network, its controls, and its relays. It predicts which relays trip after a first trip, identifies assets whose relay or measurement data are insufficient for a safety conclusion, and, when one exists, computes a minimum-cost fast reactive power action that keeps all relay voltages below their settings. Case studies on four benchmark systems and a 2000-bus system that reproduces the mechanism of the Iberian blackout show that the method flagged every event that caused a secondary trip within the relay window, never declared safe a plant that tripped within that window, and, on the benchmarks, found fast reactive power actions that prevented the trips within the relay window whenever it judged such actions feasible. These results were validated with nonlinear time-domain simulations. The code is publicly available.

eess.SY↗

Ranking the Parameters Shaping Grid Dynamics

Generator and transmission line parameters do not shape the time-domain behavior of a power system equally; a parameter that dominates one dynamic property can be almost invisible to another. This paper studies how the physical parameters of a detailed and general nonlinear differential algebraic equation (DAE) grid model shape the properties that decide whether system states such as frequencies, voltages, and angles can be inferred, observed, controlled, and kept stable. The rankings are conditional as they depend on where grid sensors and actuators sit, on the operating region and the disturbance, on the network topology, and on other settings that the operator chooses. The framework combines DAE trajectory sensitivities, variational Gramians, and stability margin sensitivities to measure how much each parameter reshapes the network dynamics. On three benchmark systems, the rankings show where dynamic leverage concentrates and where the control-theoretic metrics disagree, and they point to how parameter studies can guide calibration, sensor and actuator placement, and security assessment. The proposed methods herein are also scalable and can be tested on grids with tens of thousands of buses.

eess.SY↗

Stability and Controllability Margins of Water Network Hydraulics

Pump and valve actuation in water distribution networks (WDNs) affects how pressures, flows, and tank levels respond to demand changes and other disturbances. This paper presents a stability and controllability analysis of WDN hydraulics. Starting from a general nonlinear differential algebraic equation (DAE) model of WDNs with arbitrary topology and network components (valves and pumps), we investigate three questions. First, we study local well-posedness of the network dynamics and characterize the loss of differentiability introduced by pump and valve switching. Second, we introduce regularization methods that smooth flow and pressure trajectories under changing controls. Third, we quantify how network parametric uncertainty impacts local stability and controllability, while establishing error bounds on the resulting margins. For water operations, stability means that pressures and flows return to steady values after a disturbance, and controllability means that pump and valve actions can move pressures, flows, and tank levels; the margins we compute measure how far a network is from losing either. We demonstrate that the proposed DAE models produce trajectories that closely match EPANET, a widely used WDN simulator, for benchmark networks. The case studies also show that the WDN DAE relates the recovery of pressures and flows to a weighted Laplacian of the network, ranks pipes by their effect on the local dynamics, and reveals that certain demand variation changes the stability and controllability margins without eliminating local stability or the ability of pumps to affect pressures and flows. The developed theoretical foundations enable network analysis, mitigation strategies, and system design.

eess.SY↗

Data Center Load Reductions: Attribution, Measurement Limits, and Estimation

Hundreds of gigawatts of data center loads are seeking interconnection in the United States given the massive growth of artificial intelligence and cloud computing. In recent years, several incidents of data centers reducing their loads by hundreds to thousands of megawatts have been documented, raising grid reliability concerns. U.S. regulators have since ordered reliability standards for the integration of computational loads, and the North American Electric Reliability Corporation (NERC) now calls on transmission owners to install disturbance recorders at these facilities to support root cause analysis. Such recorders usually observe only electrical quantities at the point of interconnection (POI). A sudden load reduction can be caused by a change in workload or a switch to backup supply. This work shows when POI measurements can distinguish the two mechanisms. It is established that they can produce identical POI voltage and current in a quasi-static constant power model, and during the transient their separation depends on the reduction relative to measurement noise, the clearing time, the dynamics through which workload reaches the POI, and the recorder bandwidth. When POI data are insufficient, an estimator that uses workload data is proposed to determine how much of the facility stayed connected. The results of this work identify the measurements and grid information utilities need to determine why data center load dropped.

eess.SY↗

Verification and Forward Invariance of Control Barrier Functions for Differential-Algebraic Systems

Differential-algebraic equations (DAEs) arise in power networks, chemical processes, and multibody systems, where algebraic constraints encode physical conservation laws. The safety of such systems is critical, yet safe control is challenging because algebraic constraints restrict allowable state trajectories. Control barrier functions (CBFs) provide computationally efficient safety filters for ordinary differential equation (ODE) systems. However, existing CBF methods are not directly applicable to DAEs due to potential conflicts between the CBF condition and the constraint manifold. This paper introduces DAE-aware CBFs that incorporate the differential-algebraic structure through projected vector fields. We derive conditions that ensure forward invariance of safe sets while preserving algebraic constraints and extend the framework to higher-index DAEs. A systematic verification framework is developed, establishing necessary and sufficient conditions for geometric correctness and feasibility of DAE-aware CBFs. For polynomial systems, sum-of-squares certificates are provided, while for nonpolynomial and neural network candidates, satisfiability modulo theories are used for falsification. The approach is validated on wind turbine and flexible-link manipulator systems.

eess.SY↗

Safe Control of Semi-Explicit Differential-Algebraic Systems: Control Barrier Functions with SOS Verification

Differential-algebraic equation (DAE) systems arise in power networks, multibody mechanics, and chemical processes, where algebraic constraints couple dynamic and algebraic states. Standard control barrier function (CBF) methods, designed for ordinary differential equations, fail for DAE systems because the algebraic constraints impose compatibility requirements that may render safety filters infeasible. This paper develops a safety-critical control framework for semi-explicit DAE systems using CBFs that consider compatibility with the algebraic constraints, termed DAE-aware CBFs. We construct projected vector fields on the constraint manifold to account for the hidden dynamics, while ensuring compatibility conditions that keep the algebraic constraints satisfied. We then present sum of squares (SOS) verification conditions that certify both correctness and feasibility of the resulting DAE-aware CBF. The framework is validated on power system case studies.

eess.SY↗

Stabilizing Traffic Flow Via Autonomous Vehicles: A Less Conservative Approach

This paper explores stabilizing traffic flow using a minimum number of autonomous vehicles (AVs) under control constraints. In contrast to most studies, we consider a heterogeneous parameter setup scenario for human-driven vehicles (HVs) to reflect real-world differences in driving behavior. While current literature uses an H-Infinity based sufficient condition to ensure the string stability of traffic flow, this often yields a conservative lower bound on the AV penetration rate to stabilize traffic flow. To reduce such conservativeness and obtain a less conservative lower bound, we ensure the string stability of traffic flow by directly imposing the possession of no growing eigenmodes. We also systematically find a minimum number of required AVs and solve for the optimal control parameters via nonlinear optimization. We finally assess the intended conservativeness reduction via numerical simulations. Quantitatively, applying our algorithm to the homogeneous HV baseline in the literature (the result built upon an H-Infinity based sufficient condition) reduces (improves) the AV penetration rate by 17.14% while ensuring the string stability of traffic flow. We observe a trade-off between the stabilization/performance degradation and the number of utilized identical AVs. Quantitatively, our last numerical simulation corroborates that the AV penetration rate can be reduced by 61.54% at the expense of 27.66% higher position difference deviation from the equilibrium and a 92.47% degradation in the real stability radius (RSR)---a metric to measure the stability robustness under the perturbation/uncertainty---associated with the aggregated linearized dynamics while ensuring the string stability of traffic flow. This trade-off helps engineers/operators make better traffic control decisions.

eess.SY↗

Connections Between Determinantal Point Processes and Gramians in Control

Determinantal point processes (DPPs) are probability models over subsets of a ground set that favor diverse selections while suppressing redundancy. That is, they tend to assign higher likelihood to collections whose elements complement one another instead of repeating the same information. For example, in recommendation systems, a DPP prefers showing users several relevant items that differ in content or style, rather than many near-duplicates of essentially the same item. Although DPPs have been studied extensively in machine learning, random matrix theory, and popularized through components of YouTube's search recommendation system, they have not been considered in the context of dynamic systems; time domain analysis is not a feature of DPPs. This paper establishes interesting connections between DPPs and control theory. By showing that the observability (controllability) Gramian parameterized by sensor (control) node subsets is a DPP, we provide a probabilistic and spectral perspective on sensor (actuator) selection for linear dynamic systems. This notion of probability here does not represent stochastic uncertainty in the system dynamics; it instead represents a likelihood measure over sensor (actuator) configurations induced by the Gramian. To that end, we derive an effective observable rank condition, characterize the balance between individual node contributions and diversity, and establish node inclusion monotonicity and negative dependence properties. Finally, we show that this formulation recovers classical greedy optimization guarantees and admits a maximum a posteriori interpretation of the sensor/actuator node selection problem. Numerical case studies on three network topologies corroborate the theoretical results.

math.OC↗

Modeling Spectral Energy Shifts in Spatio-Temporal Graph Anomaly Detection

Graph anomaly detection methods aim to distinguish anomalous nodes. While prior methods characterize anomalies through increased variation in the spectral energy distributions, they overlook those that result in decreased variation, i.e., camouflaged anomalies that appear normal. We show that this type of anomaly persists across multiple datasets and remains undetectable by existing spectral approaches. To address this limitation, we propose a node-level spectral energy formulation that is fully compatible with message passing and enables the detection of camouflaged anomalies. Building on this formulation, we introduce an energy-aware graph learning framework that models spectral shifts through energy-driven message passing in both static and time-series graphs. Besides, our unified architecture extends to temporal settings without introducing specialized sequence modules, enabling efficient learning under long sliding windows. Extensive experiments on large-scale benchmarks demonstrate the effectiveness and scalability of our approach.

cs.LG↗

Observability for Nonlinear Systems: Connecting Variational Dynamics, Lyapunov Exponents, and Empirical Gramians

Observability quantification is a key problem in dynamic network sciences. While it has been thoroughly studied for linear systems, observability quantification for nonlinear networks is less intuitive and more cumbersome. One common approach to quantify observability for nonlinear systems is via the Empirical Gramian (Empr-Gram) -- a generalized form of the Gramian of linear systems. In this paper, we produce three new results. First, we establish that a variational form of discrete-time autonomous nonlinear systems yields a so-called Variational Gramian (Var-Gram) that is equivalent to the classic Empr-Gram under linear output mappings; the former being easier to compute than the latter. Via Lyapunov exponents derived from Lyapunov's direct method, the paper's second result derives connections between existing observability measures and Var-Gram. The third result demonstrates the applicability of these new notions for sensor selection/placement in nonlinear systems. Numerical case studies demonstrate these three developments and their merits.

eess.SY↗

Partitioning and Observability in Linear Systems via Submodular Optimization

Network partitioning has gained recent attention as a pathway to enable decentralized operation and control in large-scale systems. This paper addresses the interplay between partitioning, observability, and sensor placement (SP) in dynamic networks. The problem, being computationally intractable at scale, is a largely unexplored, open problem in the literature. To that end, the paper's objective is designing scalable partitioning of linear systems while maximizing observability metrics of the subsystems. We show that the partitioning problem can be posed as a submodular maximization problem -- and the SP problem can subsequently be solved over the partitioned network. Consequently, theoretical bounds are derived to compare observability metrics of the original network with those of the resulting partitions, highlighting the impact of partitioning on system observability. Case studies on networks of varying sizes corroborate the derived theoretical bounds.

eess.SY↗

Exploring Uncertainty Propagation in Coupled Hydrologic and Hydrodynamic Systems via Distribution-Agnostic State Space Analysis

Accurate overland runoff and infiltration predictions are critical for effective water resources management, in particular for urban flood management. However, the inherent uncertainty in rainfall patterns, soil properties, and initial conditions makes reliable flood forecasting a challenging task. This paper presents a framework for quantifying the impact of these uncertainties on hydrologic and hydrodynamic simulations via a state space approach based on a differential algebraic equation (DAE) formulation that couples surface and subsurface constraints with the governing dynamics. Under this formulation, the complex interactions between overland flow and infiltration dynamics are captured in realtime. To account for uncertainty in inputs and parameters, the proposed framework quantifies and propagates these uncertainties through the DAE model formulation under partial measurements. The effectiveness of the approach is demonstrated through a series of numerical experiments on synthetic and real world catchments, highlighting its ability to provide probabilistic estimates of watershed state conditions while accounting for uncertainty. An important aspect of the proposed methods is that they are distribution-agnostic, i.e., they only require covariances of uncertainty and not specific types of distributions. The proposed framework is further validated against Monte Carlo (MC) ensemble simulations while providing probabilistic state estimates for measured and unmeasured watershed states under partial gauging.

eess.SY↗

Revisiting The PBH Test: Fast Uncontrollability Certificates via Krylov Methods

This letter revisits the classical PBH test through the lens of finite-horizon reachability. By casting state transfer as a minimum energy, primal optimization problem, we show that unreachable state-space maneuvers admit dual infeasibility certificates. These certificates are computable without forming the controllability matrix meaning that uncontrollability can be efficiently certified. We prove that any such certificate is a linear combination of uncontrollable generalized eigenvectors, thereby providing a spectral interpretation without a global eigendecomposition. We also devise algorithms based on Krylov sub-space methods that extract some of the uncontrollable PBH modes from a certificate and demonstrate favorable scaling on large dynamic networks with thousands of nodes.

math.OC↗

Power System CBFs

Control barrier functions (CBFs) have become a standard tool in safety critical-control systems. CBFs convert state constraints into real time control conditions that certify forward invariance (meaning that once the system starts in a safe region, it remains there for all future times) and minimally modify a nominal controller only when safety is at risk. In power systems, CBF based methods have been proposed for frequency and voltage safety, but they largely remain disconnected from three key features that are central to power system operation: differential algebraic equation (DAE) models that capture network power flow constraints, safety specifications involving algebraic variables such as bus voltages, and formal verification of the resulting closed loop system. This paper closes this gap by developing a CBF framework for power system DAE models that supports safety constraints on both dynamic and algebraic variables. The framework provides real time safety filtering through an optimization layer that wraps around an existing controller and minimally modifies its command to enforce safety. In addition, it provides formal verification (i.e., a mathematical guarantee that all admissible trajectories satisfy the prescribed safety constraints) through an offline reachability based certificate of safe operation. The result is a unified filter and verify methodology for enforcing and certifying frequency and voltage safety in power systems while preserving the DAE structure of the underlying model.

eess.SY↗

DAE-Aware Bayesian Inference for Joint Generator-Network Parameter Estimation

This paper addresses the classic problem of parameter estimation (PE) in multimachine power system models. Such models are typically described by a set of nonlinear differential-algebraic equations (DAE), where generator physics and network power flow equations are coupled. DAE models are well established in classic power system textbooks, but parameter identification and estimation of generator inertia and damping together with network branch resistances and reactances for these models remain relatively underexplored. In contrast to prior approaches that rely on ODE approximations, this paper develops a joint Bayesian inference framework to perform PE of generator and network parameters while exploiting grid DAE models. It further combines physics-aware statistical modeling with computationally efficient posterior sampling to make joint Bayesian calibration practical. Results on the IEEE 9-bus system show accurate parameter recovery with well-behaved posterior uncertainty, while a short 39-bus study provides evidence that the framework remains effective on a materially larger joint-estimation problem. These results are obtained without requiring overly conservative priors.

eess.SY↗