Lili Wang
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
Lili Wang has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- A. Stephen Morse
Yale University
4 shared publications - Zhiyun Lin
Southern University of Science and Technology
2 shared publications - Brian David Outram Anderson
School of Engineering Australian National University
1 shared publication D. Fullmer
Yale Univ, Dept Elect Engn, New Haven, CT 06520 USA
1 shared publication- Daniel Fullmer
Department of Electrical Engineering, Yale University, New Haven, CT, USA
1 shared publication - Daniel Fullmer
Department of Electrical Engineering 06520 New Haven CT USA
1 shared publication
Latest Publications
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (10) , 11190-11195
Kalman-UNet: Video Regression as Latent State Estimation With Neural Prediction-Correction
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (10) , 11190-11195
Kalman-UNet: Video Regression as Latent State Estimation With Neural Prediction-Correction
- 27 January 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 337
Byzantine-robust decentralized federated learning based on feature extraction layer measuring and delayed aggregation
- 27 January 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 337
Byzantine-robust decentralized federated learning based on feature extraction layer measuring and delayed aggregation
- 22 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (12) , 7164-7178
Distributed Feedback Control of Multichannel Linear Systems
In this paper it is established that any jointly controllable, jointly observable, multi-channel, discrete or continuous time linear system with a strongly connected neighbor communication graph can be exponentially stabilized with any pre-specified convergence rate using a time-invariant distributed linear control. As an illustration of how this finding can be used to deal with certain distributed tracking problems, a solution is given to a distributed set-point control problem for a continuous-time, multi-channel linear system in which each and every agent with access to the system is able to independently adjust its scalar-valued, controlled output to any desired set-point value. To better understand the constraints on controller design, the distributed control problem is recast as a classical decentralized control problem. Armed with the tools of decentralized control, including the notion of a “fixed spectrum”, it is possible to show quite surprisingly that if the only information each agent is allowed to share with its neighbors is its measured output, then distributed stabilization in some cases is impossible. Using well-known decentralized control concepts, lower bounds are derived on the dimensions of the shared sub-states of local controllers which, if satisfied, guarantee that there will be no fixed closed-loop system eigenvalues to contend with. The decentralized control perspective also enables one to assert definitively that without imposing a partitioning constraint, the closed-loop spectrum of any jointly controllable, jointly observable multi-channel linear system with a strongly connected neighbor graph, can be freely assigned with distributed feedback control. The paper then turns to the important and often overlooked design problem of dealing with the effects of transmission delays across a network. It is explained why in the face of finite delays, exponential stabilization at any prescribed convergence rate can still be achieved with distributed control, at least for discrete-time multi-channel linear systems.
- 22 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (12) , 7164-7178
Distributed Feedback Control of Multichannel Linear Systems
In this paper it is established that any jointly controllable, jointly observable, multi-channel, discrete or continuous time linear system with a strongly connected neighbor communication graph can be exponentially stabilized with any pre-specified convergence rate using a time-invariant distributed linear control. As an illustration of how this finding can be used to deal with certain distributed tracking problems, a solution is given to a distributed set-point control problem for a continuous-time, multi-channel linear system in which each and every agent with access to the system is able to independently adjust its scalar-valued, controlled output to any desired set-point value. To better understand the constraints on controller design, the distributed control problem is recast as a classical decentralized control problem. Armed with the tools of decentralized control, including the notion of a “fixed spectrum”, it is possible to show quite surprisingly that if the only information each agent is allowed to share with its neighbors is its measured output, then distributed stabilization in some cases is impossible. Using well-known decentralized control concepts, lower bounds are derived on the dimensions of the shared sub-states of local controllers which, if satisfied, guarantee that there will be no fixed closed-loop system eigenvalues to contend with. The decentralized control perspective also enables one to assert definitively that without imposing a partitioning constraint, the closed-loop spectrum of any jointly controllable, jointly observable multi-channel linear system with a strongly connected neighbor graph, can be freely assigned with distributed feedback control. The paper then turns to the important and often overlooked design problem of dealing with the effects of transmission delays across a network. It is explained why in the face of finite delays, exponential stabilization at any prescribed convergence rate can still be achieved with distributed control, at least for discrete-time multi-channel linear systems.
- 24 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 65 (11) , 4679-4694
Consensus and Disagreement of Heterogeneous Belief Systems in Influence Networks
Recently, an opinion dynamics model has been proposed to describe a network of individuals discussing a set of logically interdependent topics. For each individual, the set of topics and the logical interdependencies between the topics (captured by a logic matrix) form a belief system. We investigate the role the logic matrix and its structure plays in determining the final opinions, including existence of the limiting opinions, of a strongly connected network of individuals. We provide a set of results that, given a set of individuals' belief systems, allow a systematic determination of which topics will reach a consensus, and which topics will disagreement in arise. For irreducible logic matrices, each topic reaches a consensus. For reducible logic matrices, which indicates a cascade interdependence relationship, conditions are given on whether a topic will reach a consensus or not. It turns out that heterogeneity among the individuals' logic matrices, and a cascade interdependence relationship, are necessary conditions for disagreement. This paper thus attributes, for the first time, a strong diversity of limiting opinions to heterogeneity of belief systems in influence networks, in addition to the more typical explanation that strong diversity arises from individual stubbornness.
- 24 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 65 (11) , 4679-4694
Consensus and Disagreement of Heterogeneous Belief Systems in Influence Networks
Recently, an opinion dynamics model has been proposed to describe a network of individuals discussing a set of logically interdependent topics. For each individual, the set of topics and the logical interdependencies between the topics (captured by a logic matrix) form a belief system. We investigate the role the logic matrix and its structure plays in determining the final opinions, including existence of the limiting opinions, of a strongly connected network of individuals. We provide a set of results that, given a set of individuals' belief systems, allow a systematic determination of which topics will reach a consensus, and which topics will disagreement in arise. For irreducible logic matrices, each topic reaches a consensus. For reducible logic matrices, which indicates a cascade interdependence relationship, conditions are given on whether a topic will reach a consensus or not. It turns out that heterogeneity among the individuals' logic matrices, and a cascade interdependence relationship, are necessary conditions for disagreement. This paper thus attributes, for the first time, a strong diversity of limiting opinions to heterogeneity of belief systems in influence networks, in addition to the more typical explanation that strong diversity arises from individual stubbornness.
- Top Cited Papers
- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 63 (7) , 2123-2130
A Distributed Observer for a Time-Invariant Linear System
A time-invariant, linear, distributed observer is described for estimating the state of an $m>0$ channel, $n$-dimensional continuous-time linear system of the form $\dot{x} = Ax,\;y_i = C_ix,\;i\in\{1,2,\ldots, m\}$. The state $x$ is simultaneously estimated by $m$ agents assuming each agent $i$ senses $y_i$ and receives the state $z_j$ of each of its neighbors' estimators. Neighbor relations are characterized by a constant directed graph $\mathbb{N}$ whose vertices correspond to agents and whose arcs depict neighbor relations. For the case when the neighbor graph is strongly connected, the overall distributed observer consists of $m$ linear estimators, one for each agent; $m-1$ of the estimators are of dimension $n$ and one estimator is of dimension $n+m-1$. Using results from classical decentralized control theory, it is shown that subject to the assumptions that (i) none of the $C_i$ are zero, (ii) the neighbor graph $\mathbb{N}$ is strongly connected, (iii) the system whose state to be estimated is jointly observable, and nothing more, it is possible to freely assign the spectrum of the overall distributed observer. For the more general case when $\mathbb{N}$ has $q>1$ strongly connected components, it is explained how to construct a family of $q$ distributed observers, one for each component, which can estimate $x$ at a preassigned convergence rate.- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 63 (7) , 2123-2130
Top Cited PapersA Distributed Observer for a Time-Invariant Linear System
A time-invariant, linear, distributed observer is described for estimating the state of an $m>0$ channel, $n$-dimensional continuous-time linear system of the form $\dot{x} = Ax,\;y_i = C_ix,\;i\in\{1,2,\ldots, m\}$. The state $x$ is simultaneously estimated by $m$ agents assuming each agent $i$ senses $y_i$ and receives the state $z_j$ of each of its neighbors' estimators. Neighbor relations are characterized by a constant directed graph $\mathbb{N}$ whose vertices correspond to agents and whose arcs depict neighbor relations. For the case when the neighbor graph is strongly connected, the overall distributed observer consists of $m$ linear estimators, one for each agent; $m-1$ of the estimators are of dimension $n$ and one estimator is of dimension $n+m-1$. Using results from classical decentralized control theory, it is shown that subject to the assumptions that (i) none of the $C_i$ are zero, (ii) the neighbor graph $\mathbb{N}$ is strongly connected, (iii) the system whose state to be estimated is jointly observable, and nothing more, it is possible to freely assign the spectrum of the overall distributed observer. For the more general case when $\mathbb{N}$ has $q>1$ strongly connected components, it is explained how to construct a family of $q$ distributed observers, one for each component, which can estimate $x$ at a preassigned convergence rate. - 1 September 2016
- Published by Elsevier in Systems & Control Letters
- Vol. 95, 46-52
Reprint of “A distributed algorithm for efficiently solving linear equations and its applications (Special Issue JCW)”
- 1 September 2016
- Published by Elsevier in Systems & Control Letters
- Vol. 95, 46-52
Reprint of “A distributed algorithm for efficiently solving linear equations and its applications (Special Issue JCW)”
- Open Access
A Distributed Algorithm for Computing a Common Fixed Point of a Family of Paracontractions
A distributed algorithm is described for finding a common fixed point of a family of $m>1$ nonlinear maps $M_i : \mathbb{R}^n \rightarrow \mathbb{R}^n$ assuming that each map is a paracontraction and that such a common fixed point exists. The common fixed point is simultaneously computed by $m$ agents assuming each agent $i$ knows only $M_i$, the current estimates of the fixed point generated by its neighbors, and nothing more. Each agent recursively updates its estimate of the fixed point by utilizing the current estimates generated by each of its neighbors. Neighbor relations are characterized by a time-dependent directed graph $\mathbb{N}(t)$ whose vertices correspond to agents and whose arcs depict neighbor relations. It is shown that for any family of paracontractions $M_i, i \in \{1,2,\ldots,m\}$ which has at least one common fixed point, and any sequence of strongly connected neighbor graphs $\mathbb{N}(t)$, $t=1,2,\ldots$, the algorithm causes all agent estimates to converge to a common fixed point.Open AccessA Distributed Algorithm for Computing a Common Fixed Point of a Family of Paracontractions
A distributed algorithm is described for finding a common fixed point of a family of $m>1$ nonlinear maps $M_i : \mathbb{R}^n \rightarrow \mathbb{R}^n$ assuming that each map is a paracontraction and that such a common fixed point exists. The common fixed point is simultaneously computed by $m$ agents assuming each agent $i$ knows only $M_i$, the current estimates of the fixed point generated by its neighbors, and nothing more. Each agent recursively updates its estimate of the fixed point by utilizing the current estimates generated by each of its neighbors. Neighbor relations are characterized by a time-dependent directed graph $\mathbb{N}(t)$ whose vertices correspond to agents and whose arcs depict neighbor relations. It is shown that for any family of paracontractions $M_i, i \in \{1,2,\ldots,m\}$ which has at least one common fixed point, and any sequence of strongly connected neighbor graphs $\mathbb{N}(t)$, $t=1,2,\ldots$, the algorithm causes all agent estimates to converge to a common fixed point.