arXiv subjects

Ahmad F. Taha

Publications and source records attributed to Ahmad F. Taha.

At least 73 records · Page 4Linked to original sources

arXiv2020

How Effective is Model Predictive Control in Real-Time Water Quality Regulation? State-Space Modeling and Scalable Control

Real-time water quality control (WQC) in water distribution networks (WDN), the problem of regulating disinfectant levels, is challenging due to lack of (i) a proper control-oriented modeling considering complicated components (junctions, reservoirs, tanks, pipes, pumps, and valves) for water quality modeling in WDN and (ii) a corresponding scalable control algorithm that performs real-time water quality regulation. In this paper, we solve the WQC problem by (a) proposing a novel state-space representation of the WQC problem that provides an explicit relationship between inputs (chlorine dosage at booster stations) and states/outputs (chlorine concentrations in the entire network) and (b) designing a highly scalable model predictive control (MPC) algorithm that showcases fast response time and resilience against some sources of uncertainty.

math.OC↗

arXiv2020

Revisiting the Water Quality Sensor Placement Problem: Optimizing Network Observability and State Estimation Metrics

Real-time water quality (WQ) sensors in water distribution networks (WDN) have the potential to enable network-wide observability of water quality indicators, contamination event detection, and closed-loop feedback control of WQ dynamics. To that end, prior research has investigated a wide range of methods that guide the geographic placement of WQ sensors. These methods assign a metric for fixed sensor placement (SP) followed by \textit{metric-optimization} to obtain optimal SP. These metrics include minimizing intrusion detection time, minimizing the expected population and amount of contaminated water affected by an intrusion event. In contrast to the literature, the objective of this paper is to provide a computational method that considers the overlooked metric of state estimation and network-wide observability of the WQ dynamics. This metric finds the optimal WQ sensor placement that minimizes the state estimation error via the Kalman filter for noisy WQ dynamics -- a metric that quantifies WDN observability. To that end, the state-space dynamics of WQ states for an entire WDN are given and the observability-driven sensor placement algorithm is presented. The algorithm takes into account the time-varying nature of WQ dynamics due to changes in the hydraulic profile -- a collection of hydraulic states including heads (pressures) at nodes and flow rates in links which are caused by a demand profile over a certain period of time. Thorough case studies are given, highlighting key findings, observations, and recommendations for WDN operators. Github codes are included for reproducibility.

eess.SY↗

arXiv2020

Control Node Selection Algorithm for Nonlinear Dynamic Networks

The coupled problems of selecting control nodes and designing control actions for nonlinear network dynamics are fundamental scientific problems with applications in many diverse fields. These problems are thoroughly studied for linear dynamics; however, in spite of a number of open research questions, methods for nonlinear network dynamics are less developed. As observed by various studies, the prevailing graph-based controllability approaches for selecting control nodes might result in significantly suboptimal control performance for nonlinear dynamics. Herein we present a new, intuitive, and simple method for simultaneous control node selection and control sequence design for complex networks with nonlinear dynamics. The method is developed by incorporating the control node selection problem into an open-loop predictive control cost function and by solving the resulting mixed-integer optimization problem using a mesh adaptive direct search method. The developed framework is numerically robust and can deal with stiff networks, networks with non-smooth dynamics, as well as with control and actuator constraints. Good numerical performance of the method is demonstrated by testing it on prototypical Duffing oscillator and associative memory networks. The developed codes that can easily be adapted to models of other complex systems are available online.

eess.SY↗

arXiv2020

State Estimation in Water Distribution Networks through a New Successive Linear Approximation

State estimation (SE) of water distribution networks (WDNs) is difficult to solve due to nonlinearity/nonconvexity of water flow models, uncertainties from parameters and demands, lack of redundancy of measurements, and inaccurate flow and pressure measurements. This paper proposes a new, scalable successive linear approximation to solve the SE problem in WDNs. The approach amounts to solving either a sequence of linear or quadratic programs---depending on the operators' objectives. The proposed successive linear approximation offers a seamless way of dealing with valve/pump model nonconvexities, is different than a first order Taylor series linearization, and can incorporate with robust uncertainty modeling. Two simple testcases are adopted to illustrate the effectiveness of proposed approach using head measurements at select nodes.

eess.SY↗

arXiv2020

Computing Lipschitz Constants for Hydraulic Models of Water Distribution Networks

Drinking water distribution networks (WDN) are large-scale, dynamic systems spanning large geographic areas. Water networks include various components such as junctions, reservoirs, tanks, pipes, pumps, and valves. Hydraulic models for these components depicting mass and energy balance form nonlinear algebraic differential equations (NDAE). While control theoretic studies have been thoroughly explored for other complex infrastructure such as power and transportation systems, little is understood or even investigated for feedback control and state estimation problems for the NDAE models of WDN. The objective of this letter is to showcase a complete NDAE model of WDN followed by computing Lipschitz constants of the vector-valued nonlinearity in that model. The computation of Lipschitz constants of hydraulic models is crucial as it paves the way to apply a plethora of control-theoretic studies for water system applications. In particular, the computation of Lipschitz constant is explored through closed-form, analytical expressions as well as via numerical methods. Case studies reveal how such computations fare against each other for various water networks.

math.OC↗

arXiv2020

Robust Dynamic State Estimation of Synchronous Machines with Asymptotic State Estimation Error Performance Guarantees

A robust observer for performing power system dynamic state estimation (DSE) of a synchronous generator is proposed. The observer is developed using the concept of $\mathcal{L}_{\infty}$ stability for uncertain, nonlinear dynamic generator models. We use this concept to (i) design a simple, scalable, and robust dynamic state estimator and (ii) obtain a performance guarantee on the state estimation error norm relative to the magnitude of uncertainty from unknown generator inputs, and process and measurement noises. Theoretical methods to obtain upper and lower bounds on the estimation error are also provided. Numerical tests validate the performance of the $\mathcal{L}_{\infty}$-based estimator in performing DSE under various scenarios. The case studies reveal that the derived theoretical bounds are valid for a variety of case studies and operating conditions, while yielding better performance than existing power system DSE methods.

eess.SY↗

arXiv2020

Asymmetric Cell Transmission Model-Based, Ramp-Connected Robust Traffic Density Estimation under Bounded Disturbances

In modern transportation systems, traffic congestion is inevitable. To minimize the loss caused by congestion, various control strategies have been developed most of which rely on observing real-time traffic conditions. As vintage traffic sensors are limited, traffic density estimation is very helpful for gaining network-wide observability. This paper deals with this problem by first, presenting a traffic model for stretched highway having multiple ramps built based on asymmetric cell transmission model (ACTM). Second, based on the assumption that the encompassed nonlinearity of the ACTM is Lipschitz, a robust dynamic observer framework for performing traffic density estimation is proposed. Numerical test results show that the observer yields a sufficient performance in estimating traffic densities having noisy measurements, while being computationally faster the Unscented Kalman Filter in performing real-time estimation.

eess.SY↗

arXiv2020

New Insights on One-Sided Lipschitz and Quadratically Inner-Bounded Nonlinear Dynamic Systems

Nonlinear dynamic systems can be classified into various classes depending on the modeled nonlinearity. These classes include Lipschitz, bounded Jacobian, one-sided Lipschitz (OSL), and quadratically inner-bounded (QIB). Such classes essentially yield bounding constants characterizing the nonlinearity. This is then used to design observers and controllers through Riccati equations or matrix inequalities. While analytical expressions for bounding constants of Lipschitz and bounded Jacobian nonlinearity are studied in the literature, OSL and QIB classes are not thoroughly analyzed---computationally or analytically. In short, this paper develops analytical expressions of OSL and QIB bounding constants. These expressions are posed as constrained maximization problems, which can be solved via various optimization algorithms. This paper also presents a novel insight particularly on QIB function set: any function that is QIB turns out to be also Lipschitz continuous.

math.OC↗

arXiv2020

A New Derivative-Free Linear Approximation for Solving the Network Water Flow Problem with Convergence Guarantees

Addressing challenges in urban water infrastructure systems including aging infrastructure, supply uncertainty, extreme events, and security threats, depend highly on water distribution networks modeling emphasizing the importance of realistic assumptions, modeling complexities, and scalable solutions. In this study, we propose a derivative-free, linear approximation for solving the network water flow problem (WFP). The proposed approach takes advantage of the special form of the nonlinear head loss equations and, after the transformation of variables and constraints, the WFP reduces to a linear optimization problem that can be efficiently solved by modern linear solvers. Ultimately, the proposed approach amounts to solving a series of linear optimization problems. We demonstrate the proposed approach through several case studies and show that the approach can model arbitrary network topologies and various types of valves and pumps, thus providing modeling flexibility. Under mild conditions, we show that the proposed linear approximation converges. We provide sensitivity analysis and discuss in detail the current limitations of our approach and suggest solutions to overcome these. All the codes, tested networks, and results are freely available on Github for research reproducibility.

math.OC↗

arXiv2019

Receding Horizon Control for Drinking Water Networks: The Case for Geometric Programming

Optimal, network-driven control of Water Distribution Networks (WDN) is very difficult: valve and pump models form non-trivial, combinatorial logic; hydraulic models are nonconvex; water demand patterns are uncertain; and WDN are naturally large-scale. Prior research on control of WDN addressed major research challenges, yet either (i) adopted simplified hydraulic models, WDN topologies, and rudimentary valve/pump modeling or (ii) used mixed-integer, nonconvex optimization to solve WDN control problems. The objective of this paper is to develop tractable computational algorithms to manage WDN operation, while considering arbitrary topology, flow direction, an abundance of valve types, control objectives, hydraulic models, and operational constraints---all while only using convex, continuous optimization. Specifically, we propose new Geometric Programming (GP)-based Model Predictive Control (MPC) algorithms, designed to solve the water flow equations and obtain WDN controls, i.e., pump/valve schedules alongside heads and flows. The proposed approach amounts to solving a series of convex optimization problems that graciously scale to large networks. The proposed approach is tested using a 126-node network with many valves and pumps and shown to outperform traditional, rule-based control. The developed GP-based MPC algorithms, as well as the numerical test results are all included on Github.

eess.SY↗

arXiv2019

Sensor Placement Strategies for Some Classes of Nonlinear Dynamic Systems via Lyapunov Theory

In this paper, the problem of placing sensors for some classes of nonlinear dynamic systems (NDS) is investigated. In conjunction with mixed-integer programming, classical Lyapunov-based arguments are used to find the minimal sensor configuration such that the NDS internal states can be observed while still optimizing some estimation metrics. The paper's approach is based on two phases. The first phase assumes that the encompassed nonlinearities belong to one of the following function set classifications: bounded Jacobian, Lipschitz continuous, one-sided Lipschitz, or quadratically inner-bounded. To parameterize these classifications, two approaches based on stochastic point-based and interval-based optimization methods are explored. Given the parameterization, the second phase formulates the sensor placement problem for various NDS classes through mixed-integer convex programming. The theoretical optimality of the sensor placement alongside a state estimator design are then given. Numerical tests on traffic network models showcase that the proposed approach yields sensor placements that are consistent with conventional wisdom in traffic theory.

math.OC↗

arXiv2019

A Control-Theoretic Approach for Scalable and Robust Traffic Density Estimation using Convex Optimization

Monitoring and control of traffic networks represent alternative, inexpensive strategies to minimize traffic congestion. As the number of traffic sensors is naturally constrained by budgetary requirements, real-time estimation of traffic flow in road segments that are not equipped with sensors is of significant importance---thereby providing situational awareness and guiding real-time feedback control strategies. To that end, firstly we build a generalized traffic flow model for stretched highways with arbitrary number of ramp flows based on the Lighthill Whitham Richards (LWR) flow model. Secondly, we characterize the function set corresponding to the nonlinearities present in the LWR model, and use this characterization to design real-time and robust state estimators (SE) for stretched highway segments. Specifically, we show that the nonlinearities from the derived models are locally Lipschitz continuous by providing the analytical Lipschitz constants. Thirdly, the analytical derivation is then incorporated through a robust SE method given a limited number of traffic sensors, under the impact of process and measurement disturbances and unknown inputs. The estimator is based on deriving a convex semidefinite optimization problem. Finally, numerical tests are given showcasing the applicability, scalability, and robustness of the proposed estimator for large systems under high magnitude disturbances, parametric uncertainty, and unknown inputs.

eess.SY↗

arXiv2019

Robust Control for Renewable-Integrated Power Networks Considering Input Bound Constraints and Worst-Case Uncertainty Measure

Uncertainty from renewable energy and loads is one of the major challenges for stable grid operation. Various approaches have been explored to remedy these uncertainties. In this paper, we design centralized or decentralized state-feedback controllers for generators while considering worst-case uncertainty. Specifically, this paper introduces the notion of $\mathcal{L}_{\infty}$ robust control and stability for uncertain power networks. Uncertain and nonlinear differential algebraic equation model of the network is presented. The model includes unknown disturbances from renewables and loads. Given an operating point, the linearized state-space presentation is given. Then, the notion of $\mathcal{L}_{\infty}$ robust control and stability is discussed, resulting in a nonconvex optimization routine that yields a state feedback gain mitigating the impact of disturbances. The developed routine includes explicit input-bound constraints on generators' inputs and a measure of the worst-case disturbance. The feedback control architecture can be centralized, distributed, or decentralized. Algorithms based on successive convex approximations are then given to address the nonconvexity. Case studies are presented showcasing the performance of the $\mathcal{L}_{\infty}$ controllers in comparison with automatic generation control and $\mathcal{H}_{\infty}$ control methods.

eess.SY↗

arXiv2019

Characterizing the Nonlinearity of Power System Generator Models

Power system dynamics are naturally nonlinear. The nonlinearity stems from power flows, generator dynamics, and electromagnetic transients. Characterizing the nonlinearity of the dynamical power system model is useful for designing superior estimation and control methods, providing better situational awareness and system stability. In this paper, we consider the synchronous generator model with a phasor measurement unit (PMU) that is installed at the terminal bus of the generator. The corresponding nonlinear process-measurement model is shown to be locally Lipschitz, i.e., the dynamics are limited in how fast they can evolve in an arbitrary compact region of the state-space. We then investigate different methods to compute Lipschitz constants for this model, which is vital for performing dynamic state estimation (DSE) or state-feedback control using Lyapunov theory. In particular, we compare a derived analytical bound with numerical methods based on low discrepancy sampling algorithms. Applications of the computed bounds to dynamic state estimation are showcased. The paper is concluded with numerical tests.

eess.SY↗

arXiv2019

Tuning-Free, Low Memory Robust Estimator to Mitigate GPS Spoofing Attacks

The operation of critical infrastructures such as the electrical power grid, cellphone towers, and financial institutions relies on precise timing provided by stationary GPS receivers. These GPS devices are vulnerable to a type of spoofing called Time Synchronization Attack (TSA), whose objective is to maliciously alter the timing provided by the GPS receiver. The objective of this paper is to design a tuning-free, low memory robust estimator to mitigate such spoofing attacks. The contribution is that the proposed method dispenses with several limitations found in the existing state-of-the-art methods in the literature that require parameter tuning, availability of the statistical distributions of noise, real-time optimization, or heavy computations. Specifically, we (i) utilize an observer design for linear systems under unknown inputs, (ii) adjust it to include a state-correction algorithm, (iii) design a realistic experimental setup with real GPS data and sensible spoofing attacks, and (iv) showcase how the proposed tuning-free, low memory robust estimator can combat TSAs. Numerical tests with real GPS data demonstrate that accurate time can be provided to the user under various attack conditions.

eess.SY↗

arXiv2019

Energy Crowdsourcing and Peer-to-Peer Energy Trading in Blockchain-Enabled Smart Grids

The power grid is rapidly transforming, and while recent grid innovations increased the utilization of advanced control methods, the next-generation grid demands technologies that enable the integration of distributed energy resources (DERs)---and consumers that both seamlessly buy and sell electricity. This paper develops an optimization model and blockchain-based architecture to manage the operation of crowdsourced energy systems (CES), with peer-to-peer (P2P) energy trading transactions. An operational model of CESs in distribution networks is presented considering various types of energy trading transactions and crowdsourcees. Then, a two-phase operation algorithm is presented: Phase I focuses on the day-ahead scheduling of generation and controllable DERs, whereas Phase II is developed for hour-ahead or real-time operation of distribution networks. The developed approach supports seamless P2P energy trading between individual prosumers and/or the utility. The presented operational model can also be used to operate islanded microgrids. The CES framework and the operation algorithm are then prototyped through an efficient blockchain implementation, namely the IBM Hyperledger Fabric. This implementation allows the system operator to manage the network users to seamlessly trade energy. Case studies and prototype illustration are provided.

eess.SY↗

arXiv2019

Algorithms for Joint Sensor and Control Nodes Selection in Dynamic Networks

The problem of placing or selecting sensors and control nodes plays a pivotal role in the operation of dynamic networks. This paper proposes optimal algorithms and heuristics to solve the simultaneous sensor and actuator selection problem in linear dynamic networks. In particular, a sufficiency condition of static output feedback stabilizability is used to obtain the minimal set of sensors and control nodes needed to stabilize an unstable network. We show the joint sensor/actuator selection and output feedback control can be written as a mixed-integer nonconvex problem. To solve this nonconvex combinatorial problem, three methods based on (1) mixed-integer nonlinear programming, (2) binary search algorithms, and (3) simple heuristics are proposed. The first method yields optimal solutions to the selection problem---given that some constants are appropriately selected. The second method requires a database of binary sensor/actuator combinations, returns optimal solutions, and necessitates no tuning parameters. The third approach is a heuristic that yields suboptimal solutions but is computationally attractive. The theoretical properties of these methods are discussed and numerical tests on dynamic networks showcase the trade-off between optimality and computational time.

math.OC↗

arXiv2019

Geometric Programming-Based Control for Nonlinear, DAE-Constrained Water Distribution Networks

Control of water distribution networks (WDNs) can be represented by an optimization problem with hydraulic models describing the nonlinear relationship between head loss, water flow, and demand. The problem is difficult to solve due to the non-convexity in the equations governing water flow. Previous methods used to obtain WDN controls (i.e., operational schedules for pumps and valves) have adopted simplified hydraulic models. One common assumption found in the literature is the modification of WDN topology to exclude loops and assume a known water flow direction. In this paper, we present a new geometric programming-based model predictive control approach, designed to solve the water flow equations and obtain WDN controls. The paper considers the nonlinear difference algebraic equation (DAE) form of the WDN dynamics, and the GP approach amounts to solving a series of convex optimization problems and requires neither the knowledge of water flow direction nor does it restrict the water network topology. A case study is presented to illustrate the performance of the proposed method.

math.OC↗