Nikolaos Gatsis

Yu Zhang, Nikolaos Gatsis, Georgios B. Giannakis

Due to its reduced communication overhead and robustness to failures, distributed energy management is of paramount importance in smart grids, especially in microgrids, which feature distributed generation (DG) and distributed storage (DS). Distributed economic dispatch for a microgrid with high renewable energy penetration and demand-side management operating in grid-connected mode is considered in this paper. To address the intrinsically stochastic availability of renewable energy sources (RES), a novel power scheduling approach is introduced. The approach involves the actual renewable energy as well as the energy traded with the main grid, so that the supply-demand balance is maintained. The optimal scheduling strategy minimizes the microgrid net cost, which includes DG and DS costs, utility of dispatchable loads, and worst-case transaction cost stemming from the uncertainty in RES. Leveraging the dual decomposition, the optimization problem formulated is solved in a distributed fashion by the local controllers of DG, DS, and dispatchable loads. Numerical results are reported to corroborate the effectiveness of the novel approach.

Ahmad F. Taha, Nikolaos Gatsis, Bing Dong et al.

This paper puts forth a mathematical framework for Buildings-to-Grid (BtG) integration in smart cities. The framework explicitly couples power grid and building's control actions and operational decisions, and can be utilized by buildings and power grids operators to simultaneously optimize their performance. Simplified dynamics of building clusters and building-integrated power networks with algebraic equations are presented---both operating at different time-scales. A model predictive control (MPC)-based algorithm that formulates the BtG integration and accounts for the time-scale discrepancy is developed. The formulation captures dynamic and algebraic power flow constraints of power networks and is shown to be numerically advantageous. The paper analytically establishes that the BtG integration yields a reduced total system cost in comparison with decoupled designs where grid and building operators determine their controls separately. The developed framework is tested on standard power networks that include thousands of buildings modeled using industrial data. Case studies demonstrate building energy savings and significant frequency regulation, while these findings carry over in network simulations with nonlinear power flows and mismatch in building model parameters. Finally, simulations indicate that the performance does not significantly worsen when there is uncertainty in the forecasted weather and base load conditions.

Mohammadhafez Bazrafshan, Nikolaos Gatsis

This paper develops a power management scheme that jointly optimizes the real power consumption of programmable loads and reactive power outputs of photovoltaic (PV) inverters in distribution networks. The premise is to determine the optimal demand response schedule that accounts for the stochastic availability of solar power, as well as to control the reactive power generation or consumption of PV inverters adaptively to the real power injections of all PV units. These uncertain real power injections by PV units are modeled as random variables taking values from a finite number of possible scenarios. Through the use of second order cone relaxation of the power flow equations, a convex stochastic program is formulated. The objectives are to minimize the negative user utility, cost of power provision, and thermal losses, while constraining voltages to remain within specified levels. To find the global optimum point, a decentralized algorithm is developed via the alternating direction method of multipliers that results in closed-form updates per node and per scenario, rendering it suitable to implement in distribution networks with large number of scenarios. Numerical tests and comparisons with an alternative deterministic approach are provided for typical residential distribution networks that confirm the efficiency of the algorithm.

Mohammadhafez Bazrafshan, Nikolaos Gatsis

The theme of this paper is three-phase distribution system modeling suitable for the Z-Bus load-flow. Detailed models of wye and delta constant-power, constant-current, and constant-impedance loads are presented. Models of transmission lines, voltage regulators, and transformers that build the bus admittance matrix (Y-Bus) are laid out. The Z-Bus load-flow is then reviewed and the singularity of the Y-Bus in case of certain transformer connections is rigorously discussed. Based on realistic assumptions and conventional modifications, the invertibility of the Y-Bus is proved. Last but not least, the MATLAB scripts that construct the detailed component models for the IEEE 37-bus, IEEE 123-bus, and 8500-node feeders as well as the European 906-bus low-voltage feeder are provided.

Mohammadhafez Bazrafshan, Nikolaos Gatsis

This paper derives a set of sufficient conditions guaranteeing that the load-flow problem in unbalanced three-phase distribution networks with wye and delta ZIP loads has a unique solution over a region that can be explicitly calculated from the network parameters. It is also proved that the well-known Z-Bus iterative method is a contraction over the defined region, and hence converges to the unique solution.

Ahmad F. Taha, Nikolaos Gatsis, Tyler Summers et al.

We propose methods to solve time-varying, sensor and actuator (SaA) selection problems for uncertain cyber-physical systems. We show that many SaA selection problems for optimizing a variety of control and estimation metrics can be posed as semidefinite optimization problems with mixed-integer bilinear matrix inequalities (MIBMIs). Although this class of optimization problems are computationally challenging, we present tractable approaches that directly tackle MIBMIs, providing both upper and lower bounds, and that lead to effective heuristics for SaA selection. The upper and lower bounds are obtained via successive convex approximations and semidefinite programming relaxations, respectively, and selections are obtained with a novel slicing algorithm from the solutions of the bounding problems. Custom branch-and-bound and combinatorial greedy approaches are also developed for a broad class of systems for comparison. Finally, comprehensive numerical experiments are performed to compare the different methods and illustrate their effectiveness.

Ahmad F. Taha, Mohammadhafez Bazrafshan, Sebastian Nugroho et al.

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.

Nafiseh Ebrahimi, Sebastian Nugroho, Ahmad F. Taha et al.

The design of robots that are light, soft, powerful is a grand challenge. Since they can easily adapt to dynamic environments, soft robotic systems have the potential of changing the status-quo of bulky robotics. A crucial component of soft robotics is a soft actuator that is activated by external stimuli to generate desired motions. Unfortunately, there is a lack of powerful soft actuators that operate through lightweight power sources. To that end, we recently designed a highly scalable, flexible, biocompatible Electromagnetic Soft Actuator (ESA). With ESAs, artificial muscles can be designed by integrating a network of ESAs. The main research gap addressed in this work is in the absence of system-theoretic understanding of the impact of the realtime control and actuator selection algorithms on the performance of networked soft-body actuators and ESAs. The objective of this paper is to establish a framework that guides the analysis and robust control of networked ESAs. A novel ESA is described, and a configuration of soft actuator matrix to resemble artificial muscle fiber is presented. A mathematical model which depicts the physical network is derived, considering the disturbances due to external forces and linearization errors as an integral part of this model. Then, a robust control and minimal actuator selection problem with logistic constraints and control input bounds is formulated, and tractable computational routines are proposed with numerical case studies.

Sebastian A. Nugroho, Ahmad F. Taha, Nikolaos Gatsis et al.

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.

Sebastian Nugroho, Ahmad F. Taha, Tyler Summers et al.

In most dynamic networks, it is impractical to measure all of the system states; instead, only a subset of the states are measured through sensors. Consequently, and unlike full state feedback controllers, output feedback control utilizes only the measured states to obtain a stable closed-loop performance. This paper explores the interplay between the selection of minimal number of sensors and actuators (SaA) that yield a stable closed-loop system performance. Through the formulation of the static output feedback control problem, we show that the simultaneous selection of minimal set of SaA is a combinatorial optimization problem with mixed-integer nonlinear matrix inequality constraints. To address the computational complexity, we develop two approaches: The first approach relies on integer/disjunctive programming principles, while the second approach is a simple algorithm that is akin to binary search routines. The optimality of the two approaches is also discussed. Numerical experiments are included showing the performance of the developed approaches.

Mohammadhafez Bazrafshan, Nikolaos Gatsis, Marcio Giacomoni et al.

This paper develops a fixed-point iteration to solve the steady-state water flow equations in an urban water distribution network. The fixed-point iteration is derived upon the assumption of turbulent flow solutions and the validity of the Hazen-Williams head loss formula for water flow. Local convergence is ensured if the spectral radius of the Jacobian at the solution is smaller than one. The implication is that the solution is at least locally unique and that the spectral radius of the Jacobian provides an estimate of the convergence speed. A sample water network is provided to assert the application of the proposed method.

Shen Wang, Ahmad F. Taha, Nikolaos Gatsis et al.

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.

Mohammadhafez Bazrafshan, Nikolaos Gatsis, Ahmad Taha et al.

In this paper, the optimal power flow (OPF) problem is augmented to account for the costs associated with the load-following control of a power network. Load-following control costs are expressed through the linear quadratic regulator (LQR). The power network is described by a set of nonlinear differential algebraic equations (DAEs). By linearizing the DAEs around a known equilibrium, a linearized OPF that accounts for steady-state operational constraints is formulated first. This linearized OPF is then augmented by a set of linear matrix inequalities that are algebraically equivalent to the implementation of an LQR controller. The resulting formulation, termed LQR-OPF, is a semidefinite program which furnishes optimal steady-state setpoints and an optimal feedback law to steer the system to the new steady state with minimum load-following control costs. Numerical tests demonstrate that the setpoints computed by LQR-OPF result in lower overall costs and frequency deviations compared to the setpoints of a scheme where OPF and load-following control are considered separately.

Aditie Garg, Mana Jalali, Vassilis Kekatos et al.

Distribution grids are currently challenged by frequent voltage excursions induced by intermittent solar generation. Smart inverters have been advocated as a fast-responding means to regulate voltage and minimize ohmic losses. Since optimal inverter coordination may be computationally challenging and preset local control rules are subpar, the approach of customized control rules designed in a quasi-static fashion features as a golden middle. Departing from affine control rules, this work puts forth non-linear inverter control policies. Drawing analogies to multi-task learning, reactive control is posed as a kernel-based regression task. Leveraging a linearized grid model and given anticipated data scenarios, inverter rules are jointly designed at the feeder level to minimize a convex combination of voltage deviations and ohmic losses via a linearly-constrained quadratic program. Numerical tests using real-world data on a benchmark feeder demonstrate that nonlinear control rules driven also by a few non-local readings can attain near-optimal performance.

Paresh Risbud, Nikolaos Gatsis, Ahmad Taha

Sensors such as phasor measurement units (PMUs) endowed with GPS receivers are ubiquitously installed providing real-time grid visibility. A number of PMUs can cooperatively enable state estimation routines. However, GPS spoofing attacks can notably alter the PMU measurements, mislead the network operator, and drastically impact subsequent corrective control actions. Leveraging a novel measurement model that explicitly accounts for the GPS spoofing attacks, this paper formulates an optimization problem to identify the most vulnerable PMUs in the network. A greedy algorithm is developed to solve the aforementioned problem. Furthermore, the paper develops a computationally efficient alternating minimization algorithm for joint state estimation and attack reconstruction. Numerical tests on IEEE benchmark networks validate the developed methods.

Ali Khalajmehrabadi, Nikolaos Gatsis, David Akopian et al.

This paper introduces the Time Synchronization Attack Rejection and Mitigation (TSARM) technique for Time Synchronization Attacks (TSAs) over the Global Positioning System (GPS). The technique estimates the clock bias and drift of the GPS receiver along with the possible attack contrary to previous approaches. Having estimated the time instants of the attack, the clock bias and drift of the receiver are corrected. The proposed technique is computationally efficient and can be easily implemented in real time, in a fashion complementary to standard algorithms for position, velocity, and time estimation in off-the-shelf receivers. The performance of this technique is evaluated on a set of collected data from a real GPS receiver. Our method renders excellent time recovery consistent with the application requirements. The numerical results demonstrate that the TSARM technique outperforms competing approaches in the literature.

Ali Khalajmehrabadi, Nikolaos Gatsis, David Akopian

Wireless Local Area Network (WLAN) has become a promising choice for indoor positioning as the only existing and established infrastructure, to localize the mobile and stationary users indoors. However, since WLAN has been initially designed for wireless networking and not positioning, the localization task based on WLAN signals has several challenges. Amongst the WLAN positioning methods, WLAN fingerprinting localization has recently achieved great attention due to its promising results. WLAN fingerprinting faces several challenges and hence, in this paper, our goal is to overview these challenges and the state-of-the-art solutions. This paper consists of three main parts: 1) Conventional localization schemes; 2) State-of-the-art approaches; 3) Practical deployment challenges. Since all the proposed methods in WLAN literature have been conducted and tested in different settings, the reported results are not equally comparable. So, we compare some of the main localization schemes in a single real environment and assess their localization accuracy, positioning error statistics, and complexity. Our results depict illustrative evaluation of WLAN localization systems and guide to future improvement opportunities.

Ali Khalajmehrabadi, Nikolaos Gatsis, David Akopian

This paper introduces novel schemes for indoor localization, outlier detection, and radio map interpolation using Wireless Local Area Networks (WLANs). The localization method consists of a novel multicomponent optimization technique that minimizes the squared $\ell_{2}$-norm of the residuals between the radio map and the online Received Signal Strength (RSS) measurements, the $\ell_{1}$-norm of the user's location vector, and weighted $\ell_{2}$-norms of layered groups of Reference Points (RPs). RPs are grouped using a new criterion based on the similarity between the so-called Access Point (AP) coverage vectors. In addition, since AP readings are prone to containing inordinate readings, called outliers, an augmented optimization problem is proposed to detect the outliers and localize the user with cleaned online measurements. Moreover, a novel scheme to record fingerprints from a smaller number of RPs and estimate the radio map at RPs without recorded fingerprints is developed using sparse recovery techniques. All localization schemes are tested on RSS fingerprints collected from a real environment. The overall scheme has comparable complexity with competing approaches, while it performs with high accuracy under a small number of APs and finer granularity of RPs.

Ali Khalajmehrabadi, Nikolaos Gatsis, Daniel Pack et al.

In this paper, we introduce two indoor Wireless Local Area Network (WLAN) positioning methods using augmented sparse recovery algorithms. These schemes render a sparse user's position vector, and in parallel, minimize the distance between the online measurement and radio map. The overall localization scheme for both methods consists of three steps: 1) coarse localization, obtained from comparing the online measurements with clustered radio map. A novel graph-based method is proposed to cluster the offline fingerprints. In the online phase, a Region Of Interest (ROI) is selected within which we search for the user's location; 2) Access Point (AP) selection; and 3) fine localization through the novel sparse recovery algorithms. Since the online measurements are subject to inordinate measurement readings, called outliers, the sparse recovery methods are modified in order to jointly estimate the outliers and user's position vector. The outlier detection procedure identifies the APs whose readings are either not available or erroneous. The proposed localization methods have been tested with Received Signal Strength (RSS) measurements in a typical office environment and the results show that they can localize the user with significantly high accuracy and resolution which is superior to the results from competing WLAN fingerprinting localization methods.