Nicola Elia
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
Research Subjects
Nicola Elia has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Chong Li
Dept. of Electrical and Computer Engineering Iowa State University 50011 Ames IA
4 shared publications - Munther A. Dahleh
Laboratory for Information and Decision Systems, M.I.T., 35‐402, Cambridge, MA 2139, U.S.A.
4 shared publications Jing Wang
Cummins Inc
3 shared publications- Petros Voulgaris
Mechanical Engineering Department, University of Nevada, Reno, NV, USA
3 shared publications - Chong Li2 shared publications
Hullas Sehgal
Electrical Engineering Department, University of Minnesota, Minneapolis, MI, USA
2 shared publications
Latest Publications
- 23 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (11) , 7725-7731
Decentralized and Selfish Optimality in Mean-Field Problems With Nonuniform Agents
In this article, we take an input–output approach to expand the study of cooperative multiagent optimization problems that admit decentralized and selfish solutions. We extend the results of our previous work on problems with identical agents to nonidentical agents and demonstrate that for the ${\mathcal H}_\infty$ and ${\mathcal H}_{2}$ norm minimization, the optimal controller is decentralized and selfish as the number of agents $n$ grows to infinity, provided a uniform boundedness condition on the open loop of the collective is satisfied.
- 23 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (11) , 7725-7731
Decentralized and Selfish Optimality in Mean-Field Problems With Nonuniform Agents
In this article, we take an input–output approach to expand the study of cooperative multiagent optimization problems that admit decentralized and selfish solutions. We extend the results of our previous work on problems with identical agents to nonidentical agents and demonstrate that for the ${\mathcal H}_\infty$ and ${\mathcal H}_{2}$ norm minimization, the optimal controller is decentralized and selfish as the number of agents $n$ grows to infinity, provided a uniform boundedness condition on the open loop of the collective is satisfied.
- 18 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (10) , 6652-6667
A Youla Operator State-Space Framework for Stably Implementable Distributed Control
This paper deals with the problem of distributed control synthesis. We seek to find structured controllers that are stably implementable over the underlying network. We address the problem using an operator form of discrete-time linear systems. This allows for uniform treatment of various classes of linear systems, e.g., Linear Time Invariant (LTI), Linear Time Varying (LTV), or linear switched systems. We combine this operator representation for linear systems with the classical Youla parametrization to characterize the set of controllers that are implementable over the given network. Using this Youla Operator State-Space (YOSS) framework, we show that a certain separation principle holds for the distributed control of a general class of linear systems. In that, the distributed state-estimation can be carried out independently and then used together with “state-like” controllers to obtain the set of all output feedback stabilizing controllers with structure. The stability and performance problems can be formulated as convex (but infinite dimensional) optimization. We provide converging families of finite dimensional convex optimizations in order to upper/lower approximate the original infinite dimensional problem.
- 18 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (10) , 6652-6667
A Youla Operator State-Space Framework for Stably Implementable Distributed Control
This paper deals with the problem of distributed control synthesis. We seek to find structured controllers that are stably implementable over the underlying network. We address the problem using an operator form of discrete-time linear systems. This allows for uniform treatment of various classes of linear systems, e.g., Linear Time Invariant (LTI), Linear Time Varying (LTV), or linear switched systems. We combine this operator representation for linear systems with the classical Youla parametrization to characterize the set of controllers that are implementable over the given network. Using this Youla Operator State-Space (YOSS) framework, we show that a certain separation principle holds for the distributed control of a general class of linear systems. In that, the distributed state-estimation can be carried out independently and then used together with “state-like” controllers to obtain the set of all output feedback stabilizing controllers with structure. The stability and performance problems can be formulated as convex (but infinite dimensional) optimization. We provide converging families of finite dimensional convex optimizations in order to upper/lower approximate the original infinite dimensional problem.
- 19 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 67 (5) , 2359-2372
When Selfish is Socially Optimal
In this paper, we consider cooperative multi-agent systems, where independent agents need to minimize a collective social cost. Given the coupling in the cost, the optimal strategy requires interaction and communications among all the agents in general. In this paper, we unveil important classes of social costs which are optimized by decentralized and selfish solutions, hence eliminating the need for an inter-agent communication network. In particular, we focus on a set of n independent agents coupled only through an overall cost that penalizes the divergence of each agent from the average collective behavior. Adopting input-output methods, we show that optimal decentralized and selfish solutions are possible in a variety of standard input-output cost criteria. These include the cases of l_1, l_2, l_infty induced, and H2 norms for any finite n. Moreover, if the cost includes nondeviation from average variables, the above results hold true as well for l_1, l_2, l_infty induced norms and any n, while they hold true for the normalized, per-agent square H2 norm, cost as n ! 1. The results of the paper demonstrate that selfish behavior can be socially optimal in nontr
- 19 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 67 (5) , 2359-2372
When Selfish is Socially Optimal
In this paper, we consider cooperative multi-agent systems, where independent agents need to minimize a collective social cost. Given the coupling in the cost, the optimal strategy requires interaction and communications among all the agents in general. In this paper, we unveil important classes of social costs which are optimized by decentralized and selfish solutions, hence eliminating the need for an inter-agent communication network. In particular, we focus on a set of n independent agents coupled only through an overall cost that penalizes the divergence of each agent from the average collective behavior. Adopting input-output methods, we show that optimal decentralized and selfish solutions are possible in a variety of standard input-output cost criteria. These include the cases of l_1, l_2, l_infty induced, and H2 norms for any finite n. Moreover, if the cost includes nondeviation from average variables, the above results hold true as well for l_1, l_2, l_infty induced norms and any n, while they hold true for the normalized, per-agent square H2 norm, cost as n ! 1. The results of the paper demonstrate that selfish behavior can be socially optimal in nontr
- 1 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 69, 2611-2624
Distributed Convex Optimization With State-Dependent (Social) Interactions and Time-Varying Topologies
- 1 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 69, 2611-2624
Distributed Convex Optimization With State-Dependent (Social) Interactions and Time-Varying Topologies
- 20 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 66 (5) , 2399-2406
A Distributed Algorithm for Solving Linear Algebraic Equations Over Random Networks
This paper considers the problem of solving linear algebraic equations of the form Ax=b among multi agents which seek a solution by using local information in presence of random communication topologies. The equation is solved by m agents where each agent only knows a subset of rows of the partitioned matrix [A,b]. The problem is formulated such that this formulation does not need the distribution of random interconnection graphs. Therefore, this framework includes asynchronous updates or unreliable communication protocols. The random Krasnoselskii-Mann iterative algorithm is applied that converges almost surely and in mean square to a solution of the problem for any matrices A and b and any initial conditions of agents' states. The algorithm is a totally asynchronous algorithm without requiring a priori B-connectivity and distribution dependency assumptions. The algorithm is able to solve the problem even if the weighted matrix of the graph is periodic and irreducible for synchronous protocol. It is demonstrated that the limit point to which the agents' states converge is determined by the unique solution of a convex optimization problem regardless of the distribution of random co
- 20 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 66 (5) , 2399-2406
A Distributed Algorithm for Solving Linear Algebraic Equations Over Random Networks
This paper considers the problem of solving linear algebraic equations of the form Ax=b among multi agents which seek a solution by using local information in presence of random communication topologies. The equation is solved by m agents where each agent only knows a subset of rows of the partitioned matrix [A,b]. The problem is formulated such that this formulation does not need the distribution of random interconnection graphs. Therefore, this framework includes asynchronous updates or unreliable communication protocols. The random Krasnoselskii-Mann iterative algorithm is applied that converges almost surely and in mean square to a solution of the problem for any matrices A and b and any initial conditions of agents' states. The algorithm is a totally asynchronous algorithm without requiring a priori B-connectivity and distribution dependency assumptions. The algorithm is able to solve the problem even if the weighted matrix of the graph is periodic and irreducible for synchronous protocol. It is demonstrated that the limit point to which the agents' states converge is determined by the unique solution of a convex optimization problem regardless of the distribution of random co
- 7 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 6 (2) , 642-652
Optimization Dynamics: A Bus-Level Distributed Approach for Optimal Power Flows
We propose a continuous-time optimization dynamics approach in this paper to solve the non-convex optimal power flow (OPF) problem. The proposed approach naturally uses the distributed power flow structure for computation. Specifically, each bus in the power network plays as an individual computing agent, which only uses local information to update its own voltage variables as well as Lagrange multipliers. Therefore, the proposed approach is completely distributed at the bus level. Under mild conditions, we first prove the local existence of a unique, continuous solution (with respect to the initial condition) to our optimization dynamics. Next, we show that every trajectory starting from a local neighborhood converges to a pair of primal and dual optima (saddle-point) for the associated OPF problem. Simulations based on the IEEE benchmark systems are provided to verify the effectiveness of the proposed approach.
- 7 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 6 (2) , 642-652
Optimization Dynamics: A Bus-Level Distributed Approach for Optimal Power Flows
We propose a continuous-time optimization dynamics approach in this paper to solve the non-convex optimal power flow (OPF) problem. The proposed approach naturally uses the distributed power flow structure for computation. Specifically, each bus in the power network plays as an individual computing agent, which only uses local information to update its own voltage variables as well as Lagrange multipliers. Therefore, the proposed approach is completely distributed at the bus level. Under mild conditions, we first prove the local existence of a unique, continuous solution (with respect to the initial condition) to our optimization dynamics. Next, we show that every trajectory starting from a local neighborhood converges to a pair of primal and dual optima (saddle-point) for the associated OPF problem. Simulations based on the IEEE benchmark systems are provided to verify the effectiveness of the proposed approach.
- Open Access
Youla Coding and Computation of Gaussian Feedback Capacity
In this paper, we propose an approach to numerically compute the feedback capacity of stationary finite dimensional Gaussian channels and construct (arbitrarily close to) capacity-achieving feedback codes. In particular, we first extend the interpretation of feedback communication over stationary finite dimensional Gaussian channels as feedback control systems by showing that, the problem of finding stabilizing feedback controllers with maximal reliable transmission rate over Youla parameters coincides with the problem of finding strictly causal filters to achieve feedback capacity derived in [2]. This extended interpretation provides an approach to construct deterministic feedback coding schemes with double exponential decaying error probability. We next propose asymptotic capacity-achieving upper bounds, which can be numerically evaluated by solving finite dimensional convex optimizations. From the filters that achieve the upper bounds, we apply the Youla-based interpretation to construct feasible filters, i.e., feedback codes, leading to a sequence of lower bounds. We prove the sequence of lower bounds is asymptotically capacity-achieving.
Open AccessYoula Coding and Computation of Gaussian Feedback Capacity
In this paper, we propose an approach to numerically compute the feedback capacity of stationary finite dimensional Gaussian channels and construct (arbitrarily close to) capacity-achieving feedback codes. In particular, we first extend the interpretation of feedback communication over stationary finite dimensional Gaussian channels as feedback control systems by showing that, the problem of finding stabilizing feedback controllers with maximal reliable transmission rate over Youla parameters coincides with the problem of finding strictly causal filters to achieve feedback capacity derived in [2]. This extended interpretation provides an approach to construct deterministic feedback coding schemes with double exponential decaying error probability. We next propose asymptotic capacity-achieving upper bounds, which can be numerically evaluated by solving finite dimensional convex optimizations. From the filters that achieve the upper bounds, we apply the Youla-based interpretation to construct feasible filters, i.e., feedback codes, leading to a sequence of lower bounds. We prove the sequence of lower bounds is asymptotically capacity-achieving.
- Open Access
Limitations for nonlinear stabilization over uncertain channels
We study the problem of mean-square exponential incremental stabilization of nonlinear systems over uncertain communication channels. We show the ability to stabilize a system over such channels is fundamentally limited and the channel uncertainty must provide a minimal Quality of Service (QoS) to support stabilization. The smallest QoS necessary for stabilization is shown as a function of the positive Lyapunov exponents of uncontrolled nonlinear systems. The positive Lyapunov exponent is a measure of dynamical complexity and captures the rate of exponential divergence of nearby system trajectories. One of the main highlights of our results is the role played by nonequilibrium dynamics to determine the limitation for incremental stabilization over networks with uncertainty.
Open AccessLimitations for nonlinear stabilization over uncertain channels
We study the problem of mean-square exponential incremental stabilization of nonlinear systems over uncertain communication channels. We show the ability to stabilize a system over such channels is fundamentally limited and the channel uncertainty must provide a minimal Quality of Service (QoS) to support stabilization. The smallest QoS necessary for stabilization is shown as a function of the positive Lyapunov exponents of uncontrolled nonlinear systems. The positive Lyapunov exponent is a measure of dynamical complexity and captures the rate of exponential divergence of nearby system trajectories. One of the main highlights of our results is the role played by nonequilibrium dynamics to determine the limitation for incremental stabilization over networks with uncertainty.
- Open Access
Control approach to computing the feedback capacity for stationary finite dimensional Gaussian channels
We firstly extend the interpretation of feedback communication over stationary finite dimensional Gaussian channels as feedback control systems by showing that, the problem of finding stabilizing feedback controllers with maximal reliable transmission rate over Youla parameters coincides with the problem of finding strictly causal filters to achieve feedback capacity recently derived in [1]. The aforementioned interpretation provides an approach to construct deterministic feedback coding schemes (with double exponential decaying error probability). We next propose an asymptotic capacity-achieving upper bounds, which can be numerically evaluated by solving finite dimensional dual optimizations. From the filters that achieve upper bounds, we derive feasible filters which lead to a sequence of lower bounds. Thus, from the lower bound filters we obtain communication systems that achieve the lower bound rate. Extensive examples show the sequence of lower bounds is asymptotic capacity-achieving as well.
Open AccessControl approach to computing the feedback capacity for stationary finite dimensional Gaussian channels
We firstly extend the interpretation of feedback communication over stationary finite dimensional Gaussian channels as feedback control systems by showing that, the problem of finding stabilizing feedback controllers with maximal reliable transmission rate over Youla parameters coincides with the problem of finding strictly causal filters to achieve feedback capacity recently derived in [1]. The aforementioned interpretation provides an approach to construct deterministic feedback coding schemes (with double exponential decaying error probability). We next propose an asymptotic capacity-achieving upper bounds, which can be numerically evaluated by solving finite dimensional dual optimizations. From the filters that achieve upper bounds, we derive feasible filters which lead to a sequence of lower bounds. Thus, from the lower bound filters we obtain communication systems that achieve the lower bound rate. Extensive examples show the sequence of lower bounds is asymptotic capacity-achieving as well.
- Open Access
Stochastic Sensor Scheduling via Distributed Convex Optimization
In this paper, we propose a stochastic scheduling strategy for estimating the states of N discrete-time linear time invariant (DTLTI) dynamic systems, where only one system can be observed by the sensor at each time instant due to practical resource constraints. The idea of our stochastic strategy is that a system is randomly selected for observation at each time instant according to a pre-assigned probability distribution. We aim to find the optimal pre-assigned probability in order to minimize the maximal estimate error covariance among dynamic systems. We first show that under mild conditions, the stochastic scheduling problem gives an upper bound on the performance of the optimal sensor selection problem, notoriously difficult to solve. We next relax the stochastic scheduling problem into a tractable suboptimal quasi-convex form. We then show that the new problem can be decomposed into coupled small convex optimization problems, and it can be solved in a distributed fashion. Finally, for scheduling implementation, we propose centralized and distributed deterministic scheduling strategies based on the optimal stochastic solution and provide simulation examples.
Open AccessStochastic Sensor Scheduling via Distributed Convex Optimization
In this paper, we propose a stochastic scheduling strategy for estimating the states of N discrete-time linear time invariant (DTLTI) dynamic systems, where only one system can be observed by the sensor at each time instant due to practical resource constraints. The idea of our stochastic strategy is that a system is randomly selected for observation at each time instant according to a pre-assigned probability distribution. We aim to find the optimal pre-assigned probability in order to minimize the maximal estimate error covariance among dynamic systems. We first show that under mild conditions, the stochastic scheduling problem gives an upper bound on the performance of the optimal sensor selection problem, notoriously difficult to solve. We next relax the stochastic scheduling problem into a tractable suboptimal quasi-convex form. We then show that the new problem can be decomposed into coupled small convex optimization problems, and it can be solved in a distributed fashion. Finally, for scheduling implementation, we propose centralized and distributed deterministic scheduling strategies based on the optimal stochastic solution and provide simulation examples.