Borhan M. Sanandaji

Borhan M. Sanandaji, Pravin P. Varaiya

The paper presents an approach to estimate Origin-Destination (OD) flows and their path splits, based on traffic counts on links in the network. The approach called Compressive Origin-Destination Estimation (CODE) is inspired by Compressive Sensing (CS) techniques. Even though the estimation problem is underdetermined, CODE recovers the unknown variables exactly when the number of alternative paths for each OD pair is small. Noiseless, noisy, and weighted versions of CODE are illustrated for synthetic networks, and with real data for a small region in East Providence. CODE's versatility is suggested by its use to estimate the number of vehicles and the Vehicle-Miles Traveled (VMT) using link counts.

Borhan M. Sanandaji, Michael B. Wakin, Tyrone L. Vincent

Recovery of the initial state of a high-dimensional system can require a large number of measurements. In this paper, we explain how this burden can be significantly reduced when randomized measurement operators are employed. Our work builds upon recent results from Compressive Sensing (CS). In particular, we make the connection to CS analysis for random block diagonal matrices. By deriving Concentration of Measure (CoM) inequalities, we show that the observability matrix satisfies the Restricted Isometry Property (RIP) (a sufficient condition for stable recovery of sparse vectors) under certain conditions on the state transition matrix. For example, we show that if the state transition matrix is unitary, and if independent, randomly-populated measurement matrices are employed, then it is possible to uniquely recover a sparse high-dimensional initial state when the total number of measurements scales linearly in the sparsity level (the number of non-zero entries) of the initial state and logarithmically in the state dimension. We further extend our RIP analysis for scaled unitary and symmetric state transition matrices. We support our analysis with a case study of a two-dimensional diffusion process.

Amir Ghaderi, Borhan M. Sanandaji, Faezeh Ghaderi

The paper presents a spatio-temporal wind speed forecasting algorithm using Deep Learning (DL)and in particular, Recurrent Neural Networks(RNNs). Motivated by recent advances in renewable energy integration and smart grids, we apply our proposed algorithm for wind speed forecasting. Renewable energy resources (wind and solar)are random in nature and, thus, their integration is facilitated with accurate short-term forecasts. In our proposed framework, we model the spatiotemporal information by a graph whose nodes are data generating entities and its edges basically model how these nodes are interacting with each other. One of the main contributions of our work is the fact that we obtain forecasts of all nodes of the graph at the same time based on one framework. Results of a case study on recorded time series data from a collection of wind mills in the north-east of the U.S. show that the proposed DL-based forecasting algorithm significantly improves the short-term forecasts compared to a set of widely-used benchmarks models.

Borhan M. Sanandaji, Akin Tascikaraoglu, Kameshwar Poolla et al.

Integrating wind power into the grid is challenging because of its random nature. Integration is facilitated with accurate short-term forecasts of wind power. The paper presents a spatio-temporal wind speed forecasting algorithm that incorporates the time series data of a target station and data of surrounding stations. Inspired by Compressive Sensing (CS) and structured-sparse recovery algorithms, we claim that there usually exists an intrinsic low-dimensional structure governing a large collection of stations that should be exploited. We cast the forecasting problem as recovery of a block-sparse signal $\boldsymbol{x}$ from a set of linear equations $\boldsymbol{b} = A\boldsymbol{x}$ for which we propose novel structure-sparse recovery algorithms. Results of a case study in the east coast show that the proposed Compressive Spatio-Temporal Wind Speed Forecasting (CST-WSF) algorithm significantly improves the short-term forecasts compared to a set of widely-used benchmark models.

He Hao, Borhan M. Sanandaji, Kameshwar Poolla et al.

Residential Thermostatically Controlled Loads (TCLs) such as Air Conditioners (ACs), heat pumps, water heaters, and refrigerators have an enormous thermal storage potential for providing regulation reserve to the grid. In this paper, we study the potential resource and economic analysis of TCLs providing frequency regulation service. In particular, we show that the potential resource of TCLs in California is more than enough for both current and predicted near-future regulation requirements for the California power system. Moreover, we estimate the cost and revenue of TCLs, discuss the qualification requirements, recommended policy changes, and participation incentive methods, and compare TCLs with other energy storage technologies. We show that TCLs are potentially more cost-effective than other energy storage technologies such as flywheels, Li-ion, advanced lead acid, and Zinc Bromide batteries.