Dariush Fooladivanda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Dariush Fooladivanda has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Alejandro. D. Dominguez-Garcia
University of Illinois at Urbana-Champaign
4 shared publications - Catherine Rosenberg
Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada
2 shared publications - Dan Li
Department of Mechanical and Aerospace Engineering University of California San Diego La Jolla 92092 CA USA
2 shared publications - Madi Zholbaryssov
Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Champaign, illinois United States of America 61820
2 shared publications - Peter W. Sauer
University of Illinois at Urbana-Champaign
2 shared publications - Sonia Martinez
Contextual Robotics Institute and the Department of Mechanical and Aerospace Engineering, UC San Diego, La Jolla, CA, USA
2 shared publications
Latest Publications
- 2 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (9) , 6153-6168
Online Optimization and Ambiguity-Based Learning of Distributionally Uncertain Dynamic Systems
This paper proposes a novel approach to construct data-driven online solutions to optimization problems (P) subject to a class of distributionally uncertain dynamical systems. The introduced framework allows for the simultaneous learning of distributional system uncertainty via a parameterized, control-dependent ambiguity set using a finite historical data set, and its use to make online decisions with probabilistic regret function bounds. Leveraging the merits of Machine Learning, the main technical approach relies on the theory of Distributional Robust Optimization (DRO), to hedge against uncertainty and provide less conservative results than standard Robust Optimization approaches. Starting from recent results that describe ambiguity sets via parameterized, and control-dependent empirical distributions as well as ambiguity radii, we first present a tractable reformulation of the corresponding optimization problem while maintaining the probabilistic guarantees. We then specialize these problems to the cases of 1) optimal one-stage control of distributionally uncertain nonlinear systems, and 2) resource allocation under distributional uncertainty. A novelty of this work is that it extends DRO to online optimization problems subject to a distributionally uncertain dynamical system constraint, handled via a control-dependent ambiguity set that leads to online-tractable optimization with probabilistic guarantees on regret bounds. Further, we introduce an online version of the Nesterov's accelerated-gradient algorithm, and analyze its performance to solve this class of problems via dissipativity theory.
- 2 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (9) , 6153-6168
Online Optimization and Ambiguity-Based Learning of Distributionally Uncertain Dynamic Systems
This paper proposes a novel approach to construct data-driven online solutions to optimization problems (P) subject to a class of distributionally uncertain dynamical systems. The introduced framework allows for the simultaneous learning of distributional system uncertainty via a parameterized, control-dependent ambiguity set using a finite historical data set, and its use to make online decisions with probabilistic regret function bounds. Leveraging the merits of Machine Learning, the main technical approach relies on the theory of Distributional Robust Optimization (DRO), to hedge against uncertainty and provide less conservative results than standard Robust Optimization approaches. Starting from recent results that describe ambiguity sets via parameterized, and control-dependent empirical distributions as well as ambiguity radii, we first present a tractable reformulation of the corresponding optimization problem while maintaining the probabilistic guarantees. We then specialize these problems to the cases of 1) optimal one-stage control of distributionally uncertain nonlinear systems, and 2) resource allocation under distributional uncertainty. A novelty of this work is that it extends DRO to online optimization problems subject to a distributionally uncertain dynamical system constraint, handled via a control-dependent ambiguity set that leads to online-tractable optimization with probabilistic guarantees on regret bounds. Further, we introduce an online version of the Nesterov's accelerated-gradient algorithm, and analyze its performance to solve this class of problems via dissipativity theory.
- 11 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 5 (4) , 1351-1356
Online Learning of Parameterized Uncertain Dynamical Environments With Finite-Sample Guarantees
We present a novel online learning algorithm for a class of unknown and uncertain dynamical environments that are fully observable. First, we obtain a novel probabilistic characterization of systems whose mean behavior is known but which are subject to additive, unknown subGaussian disturbances. This characterization relies on recent concentration of measure results and is given in terms of ambiguity sets. Second, we extend the results to environments whose mean behavior is also unknown but described by a parameterized class of possible mean behaviors. Our algorithm adapts the ambiguity set dynamically by learning the parametric dependence online, and retaining similar probabilistic guarantees with respect to the additive, unknown disturbance. We illustrate the results on a differential-drive robot subject to environmental uncertainty.
- 11 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 5 (4) , 1351-1356
Online Learning of Parameterized Uncertain Dynamical Environments With Finite-Sample Guarantees
We present a novel online learning algorithm for a class of unknown and uncertain dynamical environments that are fully observable. First, we obtain a novel probabilistic characterization of systems whose mean behavior is known but which are subject to additive, unknown subGaussian disturbances. This characterization relies on recent concentration of measure results and is given in terms of ambiguity sets. Second, we extend the results to environments whose mean behavior is also unknown but described by a parameterized class of possible mean behaviors. Our algorithm adapts the ambiguity set dynamically by learning the parametric dependence online, and retaining similar probabilistic guarantees with respect to the additive, unknown disturbance. We illustrate the results on a differential-drive robot subject to environmental uncertainty.
- Open Access
Secure State Estimation and Control for Cyber Security of AC Microgrids
A timely, accurate, and secure dynamic state estimation is needed for reliable monitoring and efficient control of microgrids. The synchrophasor technology enables us to obtain synchronized measurements in real-time and to develop dynamic state estimators for real-time monitoring and control of microgrids. In this study, we consider an AC microgrid comprising several synchronous generators and inverter-interface power supplies, and focus on securely estimating the dynamic states of the microgrid from a set of corrupted data. We propose a dynamic state estimator which enables the microgrid operator to reconstruct the dynamic states of the microgrid from a set of corrupted data. Finally, we consider an AC microgrid with the same topology as the IEEE 33-bus distribution system, and numerically show that the proposed secure estimation algorithm can accurately reconstruct the attack signals.
Open AccessSecure State Estimation and Control for Cyber Security of AC Microgrids
A timely, accurate, and secure dynamic state estimation is needed for reliable monitoring and efficient control of microgrids. The synchrophasor technology enables us to obtain synchronized measurements in real-time and to develop dynamic state estimators for real-time monitoring and control of microgrids. In this study, we consider an AC microgrid comprising several synchronous generators and inverter-interface power supplies, and focus on securely estimating the dynamic states of the microgrid from a set of corrupted data. We propose a dynamic state estimator which enables the microgrid operator to reconstruct the dynamic states of the microgrid from a set of corrupted data. Finally, we consider an AC microgrid with the same topology as the IEEE 33-bus distribution system, and numerically show that the proposed secure estimation algorithm can accurately reconstruct the attack signals.
- Open Access
Joint User Association and Resource Allocation in Heterogeneous Cellular Networks: Comparison of Two Modeling Approaches
The performance of different combinations of user association (UA) and resource allocation (RA) in heterogeneous cellular networks has been extensively studied using a classic modeling approach based on system snapshots. There have been also many studies focusing on the dynamics of the system using queueing models. These modeling approaches are rarely compared with each other though they each bring different insights to the design problem. In this paper, we consider a queueing model-based approach to study the interplay of UA and RA, and compare the results to those obtained using snapshot models. Specifically, we formulate three different joint UA and RA optimization problems corresponding to the following three performance metrics: the maximum achievable arrival rate, the average system delay, and the maximum per-user delay. These problems are non-convex integer programs. We have therefore developed numerical techniques to compute either their exact solutions or tight lower bounds. We obtain results for different combinations of RA and UA schemes, and compare the trends with those obtained via the snapshot approach. The trends on RA are very similar, which we take as a cross-validation of the two modeling approaches for this kind of problem. The trends on user association are somewhat different which indicates a lack of robustness of the results and the need for a careful validation of UA models.
Open AccessJoint User Association and Resource Allocation in Heterogeneous Cellular Networks: Comparison of Two Modeling Approaches
The performance of different combinations of user association (UA) and resource allocation (RA) in heterogeneous cellular networks has been extensively studied using a classic modeling approach based on system snapshots. There have been also many studies focusing on the dynamics of the system using queueing models. These modeling approaches are rarely compared with each other though they each bring different insights to the design problem. In this paper, we consider a queueing model-based approach to study the interplay of UA and RA, and compare the results to those obtained using snapshot models. Specifically, we formulate three different joint UA and RA optimization problems corresponding to the following three performance metrics: the maximum achievable arrival rate, the average system delay, and the maximum per-user delay. These problems are non-convex integer programs. We have therefore developed numerical techniques to compute either their exact solutions or tight lower bounds. We obtain results for different combinations of RA and UA schemes, and compare the trends with those obtained via the snapshot approach. The trends on RA are very similar, which we take as a cross-validation of the two modeling approaches for this kind of problem. The trends on user association are somewhat different which indicates a lack of robustness of the results and the need for a careful validation of UA models.
- 1 January 2019
- Published by Elsevier in Systems & Control Letters
- Vol. 123, 47-54
Resilient distributed optimal generation dispatch for lossy AC microgrids
- 1 January 2019
- Published by Elsevier in Systems & Control Letters
- Vol. 123, 47-54
Resilient distributed optimal generation dispatch for lossy AC microgrids
- 4 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 6 (2) , 763-774
Utilization of Water Supply Networks for Harvesting Renewable Energy
Renewable surplus power is increasing due to the increasing penetration of these intermittent resources. In practice, electric grid operators either curtail the surplus energy resulting from renewable-based generations or utilize energy storage resources to absorb it. In this paper, we propose a framework for utilizing water pumps and tanks in water supply networks to absorb the surplus electrical energy resulting from renewable-based electricity generation resources in the electrical grid. We model water supply networks analytically, and propose a two-step procedure that utilizes the water tanks in the water supply network to harvest the surplus energy from an electrical grid. In each step, the water network operator needs to solve an optimization problem that is non-convex. To compute optimal pump schedules and water flows, we develop a second-order cone relaxation and an approximation technique that enable us to transform the proposed problems into mixed-integer second-order cone programs. We then provide the conditions under which the proposed relaxation is exact, and present an algorithm for constructing an exact solution to the original problem from a solution to the relaxe
- 4 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 6 (2) , 763-774
Utilization of Water Supply Networks for Harvesting Renewable Energy
Renewable surplus power is increasing due to the increasing penetration of these intermittent resources. In practice, electric grid operators either curtail the surplus energy resulting from renewable-based generations or utilize energy storage resources to absorb it. In this paper, we propose a framework for utilizing water pumps and tanks in water supply networks to absorb the surplus electrical energy resulting from renewable-based electricity generation resources in the electrical grid. We model water supply networks analytically, and propose a two-step procedure that utilizes the water tanks in the water supply network to harvest the surplus energy from an electrical grid. In each step, the water network operator needs to solve an optimization problem that is non-convex. To compute optimal pump schedules and water flows, we develop a second-order cone relaxation and an approximation technique that enable us to transform the proposed problems into mixed-integer second-order cone programs. We then provide the conditions under which the proposed relaxation is exact, and present an algorithm for constructing an exact solution to the original problem from a solution to the relaxe
- 31 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 33 (6) , 7305-7308
Offer Strategies for Wholesale Energy and Regulation Markets
Following FERC Order 755 in October 2011, wholesale markets in the US adopted a two-part compensation structure in their regulation markets, paying for regulation capacity made available as well as the quantity of regulation actually provided. In this letter, we first present a mathematical model for PJM's market clearing process for their energy and regulation markets. We then compute the optimal offer of a single energy resource offering its services into such an energy and regulation market. Finally, we empirically illustrate our offer strategy through case studies.
- 31 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 33 (6) , 7305-7308
Offer Strategies for Wholesale Energy and Regulation Markets
Following FERC Order 755 in October 2011, wholesale markets in the US adopted a two-part compensation structure in their regulation markets, paying for regulation capacity made available as well as the quantity of regulation actually provided. In this letter, we first present a mathematical model for PJM's market clearing process for their energy and regulation markets. We then compute the optimal offer of a single energy resource offering its services into such an energy and regulation market. Finally, we empirically illustrate our offer strategy through case studies.
- 13 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 5 (4) , 1875-1886
Control of Networked Distributed Energy Resources in Grid-Connected AC Microgrids
This paper focuses on the optimal utilization of grid-connected microgrids for providing frequency regulation services to the bulk system they are connected to. We consider microgrids comprised of several distributed energy resources (DER) interconnected via an electrical network. We then formulate a joint DER scheduling and power flow optimization problem in order to determine the DER set-points so that the cost of failing to follow some regulation signal is minimized in each regulation contract; this problem is non-convex. We propose a convex relaxation for this problem, and propose a family of continuous-time control laws, the trajectories of which can be computed in a distributed way. We prove that these converge to an optimal solution of the relaxed problem, and that they result in feasible power flows for the system at each time instant. The proposed continuous-time control laws have to be implemented in a discrete-time fashion over some communication network. We propose a discrete-time approximation of our control laws, and show that the resulting discrete-time control laws converge to an optimal solution of the relaxed problem.
- 13 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 5 (4) , 1875-1886
Control of Networked Distributed Energy Resources in Grid-Connected AC Microgrids
This paper focuses on the optimal utilization of grid-connected microgrids for providing frequency regulation services to the bulk system they are connected to. We consider microgrids comprised of several distributed energy resources (DER) interconnected via an electrical network. We then formulate a joint DER scheduling and power flow optimization problem in order to determine the DER set-points so that the cost of failing to follow some regulation signal is minimized in each regulation contract; this problem is non-convex. We propose a convex relaxation for this problem, and propose a family of continuous-time control laws, the trajectories of which can be computed in a distributed way. We prove that these converge to an optimal solution of the relaxed problem, and that they result in feasible power flows for the system at each time instant. The proposed continuous-time control laws have to be implemented in a discrete-time fashion over some communication network. We propose a discrete-time approximation of our control laws, and show that the resulting discrete-time control laws converge to an optimal solution of the relaxed problem.
- 16 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 5 (3) , 1310-1321
Secure State Estimation and Control for Cyber Security of the Nonlinear Power Systems
We focus on securely estimating the state of a nonlinear dynamical system from a set of corrupted measurements for two classes of nonlinear systems, and propose a technique that enables us to perform secure state estimation for those systems. We then illustrate how the proposed nonlinear secure state estimation technique can be used to perform estimation in the cyber layer of interconnected power systems under cyber-physical attacks and communication failures. In particular, we focus on an interconnected power system comprised of several synchronous generators, transmission lines, loads, and energy storage units and propose a secure estimator that allows us to securely estimate the dynamic states of the power network. Finally, we numerically demonstrate the effectiveness of the proposed secure estimation algorithm and show that the algorithm enables the cyber layer to accurately reconstruct the attack signals.
- 16 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 5 (3) , 1310-1321
Secure State Estimation and Control for Cyber Security of the Nonlinear Power Systems
We focus on securely estimating the state of a nonlinear dynamical system from a set of corrupted measurements for two classes of nonlinear systems, and propose a technique that enables us to perform secure state estimation for those systems. We then illustrate how the proposed nonlinear secure state estimation technique can be used to perform estimation in the cyber layer of interconnected power systems under cyber-physical attacks and communication failures. In particular, we focus on an interconnected power system comprised of several synchronous generators, transmission lines, loads, and energy storage units and propose a secure estimator that allows us to securely estimate the dynamic states of the power network. Finally, we numerically demonstrate the effectiveness of the proposed secure estimation algorithm and show that the algorithm enables the cyber layer to accurately reconstruct the attack signals.
- 16 February 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 5 (3) , 1016-1026
Energy-Optimal Pump Scheduling and Water Flow
This paper focuses on the optimal operation of water supply networks. We model water supply networks using hydraulic constraints and formulate a joint optimal pump scheduling and water flow problem (OWF) using the hydraulic characteristics of variable speed pumps. OWF is a mixed-integer nonlinear program. This problem is nonconvex, and hence NP-hard. To compute an exact solution of OWF, we first focus on the feasibility region of OWF and propose a mixed-integer second-order cone relaxation for the feasibility region of OWF. We prove that the proposed relaxation is exact for several relevant network topologies. We then focus on the objective function in OWF and show that for some energy metrics, OWF can be transformed into a mixed-integer second-order cone program. Furthermore, we propose an ADMM-based algorithm to compute suboptimal solutions to OWF and lower bounds on the optimal value of the objective in OWF when the objective function is nonconvex. Finally, we consider a real-world water network, and demonstrate the effectiveness of the proposed relaxation in computing the optimal pump schedules and water flows.
- 16 February 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 5 (3) , 1016-1026
Energy-Optimal Pump Scheduling and Water Flow
This paper focuses on the optimal operation of water supply networks. We model water supply networks using hydraulic constraints and formulate a joint optimal pump scheduling and water flow problem (OWF) using the hydraulic characteristics of variable speed pumps. OWF is a mixed-integer nonlinear program. This problem is nonconvex, and hence NP-hard. To compute an exact solution of OWF, we first focus on the feasibility region of OWF and propose a mixed-integer second-order cone relaxation for the feasibility region of OWF. We prove that the proposed relaxation is exact for several relevant network topologies. We then focus on the objective function in OWF and show that for some energy metrics, OWF can be transformed into a mixed-integer second-order cone program. Furthermore, we propose an ADMM-based algorithm to compute suboptimal solutions to OWF and lower bounds on the optimal value of the objective in OWF when the objective function is nonconvex. Finally, we consider a real-world water network, and demonstrate the effectiveness of the proposed relaxation in computing the optimal pump schedules and water flows.