Neng Wan
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
Neng Wan has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Naira Hovakimyan
Department of Mechanical Science and Engineering, University of Illinois Urbana-Champaign, Urbana, IL, USA
6 shared publications - Dapeng Li
Anker Innovations Shenzhen China
5 shared publications - Aditya Gahlawat
Mechanical Science and Engineering University of Illinois at Urbana-Champaign 61801 Urbana IL
2 shared publications - Evangelos A. Theodorou
Daniel Guggenheim School of Aerospace Engineering, Georgia Institute of Technology, Atlanta, GA, USA
2 shared publications - Hamid Reza Karimi
Department of Mechanical Engineering, Politecnico di Milano, Milan, Italy
2 shared publications - Lin Song
Department of Mechanical Science and Engineering, University of Illinois Urbana-Champaign, Champaign, IL, USA
2 shared publications
Latest Publications
- 19 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (9) , 5926-5940
An Information-Theoretic Analysis of Discrete-Time Control and Filtering Limitations by the I-MMSE Relationships
Fundamental limitations or performance tradeoffs/limits are important properties and constraints of both control and filtering systems. Among various tradeoff metrics, total information rate that characterizes the sensitivity tradeoffs and time-averaged performance of control and filtering systems was conventionally studied by using the differential entropy rate and Kolmogorov–Bode formula. In this article, by extending the famous mutual information-minimum mean-square error (I-MMSE) relationships to the discrete-time additive white Gaussian channels with and without feedback, a new paradigm is introduced to estimate and analyze total information rate as a control and filtering tradeoff metric. Under this framework, we explore the tradeoff properties of total information rate for a variety of the discrete-time control and filtering systems, e.g., linear time-invariant, linear time-varying, and nonlinear, and propose an alternative approach to investigate total information rate via optimal estimation.
- 19 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (9) , 5926-5940
An Information-Theoretic Analysis of Discrete-Time Control and Filtering Limitations by the I-MMSE Relationships
Fundamental limitations or performance tradeoffs/limits are important properties and constraints of both control and filtering systems. Among various tradeoff metrics, total information rate that characterizes the sensitivity tradeoffs and time-averaged performance of control and filtering systems was conventionally studied by using the differential entropy rate and Kolmogorov–Bode formula. In this article, by extending the famous mutual information-minimum mean-square error (I-MMSE) relationships to the discrete-time additive white Gaussian channels with and without feedback, a new paradigm is introduced to estimate and analyze total information rate as a control and filtering tradeoff metric. Under this framework, we explore the tradeoff properties of total information rate for a variety of the discrete-time control and filtering systems, e.g., linear time-invariant, linear time-varying, and nonlinear, and propose an alternative approach to investigate total information rate via optimal estimation.
- 31 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (3) , 1728-1735
Generalization of Filtering Sensitivity Tradeoffs in Continuous- and Discrete-Time Systems: A Simplified Approach
A simplified analysis is performed on the Bode -type filtering sensitivity trade-off integrals, which capture the sensitivity characteristics of the estimate and estimation error with respect to the process input or estimated signal in continuous- and discrete-time linear time-invariant filtering systems. Compared with the previous analyses based on complex analysis and Cauchy's residue theorem, the analysis results derived from the simplified method are more explicit, thorough, and require less restrictive assumptions. For continuous-time filtering systems, our simplified analysis reveals that apart from the non-minimum phase zero sets reported in the previous literature, the value and boundedness of filtering sensitivity integrals are also determined by the leading coefficients, relative degrees, minimum phase zeros, and poles of plants and filters. By invoking the simplified method, a comprehensive analysis of the discrete-time filtering sensitivity integrals is conducted for the first time. Numerical examples are provided to verify the validity and correctness of the simplified analysis.
- 31 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (3) , 1728-1735
Generalization of Filtering Sensitivity Tradeoffs in Continuous- and Discrete-Time Systems: A Simplified Approach
A simplified analysis is performed on the Bode -type filtering sensitivity trade-off integrals, which capture the sensitivity characteristics of the estimate and estimation error with respect to the process input or estimated signal in continuous- and discrete-time linear time-invariant filtering systems. Compared with the previous analyses based on complex analysis and Cauchy's residue theorem, the analysis results derived from the simplified method are more explicit, thorough, and require less restrictive assumptions. For continuous-time filtering systems, our simplified analysis reveals that apart from the non-minimum phase zero sets reported in the previous literature, the value and boundedness of filtering sensitivity integrals are also determined by the leading coefficients, relative degrees, minimum phase zeros, and poles of plants and filters. By invoking the simplified method, a comprehensive analysis of the discrete-time filtering sensitivity integrals is conducted for the first time. Numerical examples are provided to verify the validity and correctness of the simplified analysis.
- 1 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 10 (1) , 491-502
Generalization of Safe Optimal Control Actions on Networked Multiagent Systems
We propose a unified framework to instantly generate a safe optimal control action for a new task from existing controllers on multi-agent systems (MASs). The control action composition is achieved by taking a weighted mixture of the existing controllers according to the contribution of each component task. Instead of sophisticatedly tuning the cost parameters and other hyper-parameters for safe and reliable behavior in the optimal control framework, the safety of each single task solution is guaranteed using the control barrier functions (CBFs) for high relative degree stochastic systems, which constrains the system state within a known safe operation region where it originates from. Linearity of CBF constraints in control ensures the feasibility of safe control action composition. The discussed framework can immediately provide reliable solutions to new tasks by taking a weighted mixture of solved component-task actions and satisfying some CBF constraints, instead of performing an extensive sampling to compute a new controller. Our results are verified and demonstrated on both a single UAV and two cooperative UAV teams in an environment with obstacles.
- 1 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 10 (1) , 491-502
Generalization of Safe Optimal Control Actions on Networked Multiagent Systems
We propose a unified framework to instantly generate a safe optimal control action for a new task from existing controllers on multi-agent systems (MASs). The control action composition is achieved by taking a weighted mixture of the existing controllers according to the contribution of each component task. Instead of sophisticatedly tuning the cost parameters and other hyper-parameters for safe and reliable behavior in the optimal control framework, the safety of each single task solution is guaranteed using the control barrier functions (CBFs) for high relative degree stochastic systems, which constrains the system state within a known safe operation region where it originates from. Linearity of CBF constraints in control ensures the feasibility of safe control action composition. The discussed framework can immediately provide reliable solutions to new tasks by taking a weighted mixture of solved component-task actions and satisfying some CBF constraints, instead of performing an extensive sampling to compute a new controller. Our results are verified and demonstrated on both a single UAV and two cooperative UAV teams in an environment with obstacles.
- 31 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 10 (1) , 430-440
Estimate the States of Multiagent Systems Under Homologous Attacks by Optimization Approaches
This article revisits the problem of secure state estimation of multiagent systems under homologous attacks in [1]. We first characterize the condition on agents dynamics such that agents states can be uniquely solved from the attacked measurements of agents outputs. This condition implies that the conclusion in [1] that the attack signal and agents states can be uniquely reconstructed by adding longer time-windowed measurements is incomplete. Based on this condition, when the communication graph of agents is undirected, we propose two different distributed secure state estimators by reformulating the state reconstruction as optimization problems. The first estimator does not need agents to exchange with others their dynamics information, which is used by the second, but requires updating and exchanging more variables. Both estimators are much simpler and easier to understand than that proposed in [1]. Moreover, when the communication graph is directed and strongly connected, we also proposed two distributed state estimators, adjusted from the estimators for undirected graphs. Both of them require no global information of communication graphs but the network size. At last, we verify all the theoretical results with simulation examples.
- 31 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 10 (1) , 430-440
Estimate the States of Multiagent Systems Under Homologous Attacks by Optimization Approaches
This article revisits the problem of secure state estimation of multiagent systems under homologous attacks in [1]. We first characterize the condition on agents dynamics such that agents states can be uniquely solved from the attacked measurements of agents outputs. This condition implies that the conclusion in [1] that the attack signal and agents states can be uniquely reconstructed by adding longer time-windowed measurements is incomplete. Based on this condition, when the communication graph of agents is undirected, we propose two different distributed secure state estimators by reformulating the state reconstruction as optimization problems. The first estimator does not need agents to exchange with others their dynamics information, which is used by the second, but requires updating and exchanging more variables. Both estimators are much simpler and easier to understand than that proposed in [1]. Moreover, when the communication graph is directed and strongly connected, we also proposed two distributed state estimators, adjusted from the estimators for undirected graphs. Both of them require no global information of communication graphs but the network size. At last, we verify all the theoretical results with simulation examples.
- Open Access
Fundamental Limitations of Control and Filtering in Continuous-Time Systems: An Information-Theoretic Analysis
While information theory has been introduced to investigate and characterize the control and filtering limitations for a few decades, the existing information-theoretic methods are indirect and cumbersome for analyzing the fundamental limitations of continuous-time systems. To answer this challenge, we lift the information-theoretic analysis to continuous function spaces of infinite dimensions by using Duncan's theorem or the I-MMSE relationships. Continuous-time control and filtering systems are modeled as an additive Gaussian channel with or without feedback, and total information rate is identified as a control and filtering trade-off metric and directly computed from the estimation error of channel input. Inequality constraints for the trade-off metric are derived in a general setting and then applied to capture the fundamental limitations of various control and filtering systems subject to linear and nonlinear plants. For the linear systems, we show that total information rate has similar properties as some established trade-offs, e.g., Bode-type integrals and minimum estimation error. For the nonlinear systems, we provide a direct method to compute the total information rate and its lower bound by the Stratonovich-Kushner equation.
Open AccessFundamental Limitations of Control and Filtering in Continuous-Time Systems: An Information-Theoretic Analysis
While information theory has been introduced to investigate and characterize the control and filtering limitations for a few decades, the existing information-theoretic methods are indirect and cumbersome for analyzing the fundamental limitations of continuous-time systems. To answer this challenge, we lift the information-theoretic analysis to continuous function spaces of infinite dimensions by using Duncan's theorem or the I-MMSE relationships. Continuous-time control and filtering systems are modeled as an additive Gaussian channel with or without feedback, and total information rate is identified as a control and filtering trade-off metric and directly computed from the estimation error of channel input. Inequality constraints for the trade-off metric are derived in a general setting and then applied to capture the fundamental limitations of various control and filtering systems subject to linear and nonlinear plants. For the linear systems, we show that total information rate has similar properties as some established trade-offs, e.g., Bode-type integrals and minimum estimation error. For the nonlinear systems, we provide a direct method to compute the total information rate and its lower bound by the Stratonovich-Kushner equation.
- Open Access
f-Divergence Variational Inference
This paper introduces the $f$-divergence variational inference ($f$-VI) that generalizes variational inference to all $f$-divergences. Initiated from minimizing a crafty surrogate $f$-divergence that shares the statistical consistency with the $f$-divergence, the $f$-VI framework not only unifies a number of existing VI methods, e.g. Kullback-Leibler VI, R\'{e}nyi's $\alpha$-VI, and $\chi$-VI, but offers a standardized toolkit for VI subject to arbitrary divergences from $f$-divergence family. A general $f$-variational bound is derived and provides a sandwich estimate of marginal likelihood (or evidence). The development of the $f$-VI unfolds with a stochastic optimization scheme that utilizes the reparameterization trick, importance weighting and Monte Carlo approximation; a mean-field approximation scheme that generalizes the well-known coordinate ascent variational inference (CAVI) is also proposed for $f$-VI. Empirical examples, including variational autoencoders and Bayesian neural networks, are provided to demonstrate the effectiveness and the wide applicability of $f$-VI.
Open Accessf-Divergence Variational Inference
This paper introduces the $f$-divergence variational inference ($f$-VI) that generalizes variational inference to all $f$-divergences. Initiated from minimizing a crafty surrogate $f$-divergence that shares the statistical consistency with the $f$-divergence, the $f$-VI framework not only unifies a number of existing VI methods, e.g. Kullback-Leibler VI, R\'{e}nyi's $\alpha$-VI, and $\chi$-VI, but offers a standardized toolkit for VI subject to arbitrary divergences from $f$-divergence family. A general $f$-variational bound is derived and provides a sandwich estimate of marginal likelihood (or evidence). The development of the $f$-VI unfolds with a stochastic optimization scheme that utilizes the reparameterization trick, importance weighting and Monte Carlo approximation; a mean-field approximation scheme that generalizes the well-known coordinate ascent variational inference (CAVI) is also proposed for $f$-VI. Empirical examples, including variational autoencoders and Bayesian neural networks, are provided to demonstrate the effectiveness and the wide applicability of $f$-VI.
- Open Access
Cooperative Path Integral Control for Stochastic Multi-Agent Systems
A distributed stochastic optimal control solution is presented for cooperative multi-agent systems. The network of agents is partitioned into multiple factorial subsystems, each of which consists of a central agent and neighboring agents. Local control actions that rely only on agents' local observations are designed to optimize the joint cost functions of subsystems. When solving for the local control actions, the joint optimality equation for each subsystem is cast as a linear partial differential equation and solved using the Feynman-Kac formula. The solution and the optimal control action are then formulated as path integrals and approximated by a Monte-Carlo method. Numerical verification is provided through a simulation example consisting of a team of cooperative UAVs.
Open AccessCooperative Path Integral Control for Stochastic Multi-Agent Systems
A distributed stochastic optimal control solution is presented for cooperative multi-agent systems. The network of agents is partitioned into multiple factorial subsystems, each of which consists of a central agent and neighboring agents. Local control actions that rely only on agents' local observations are designed to optimize the joint cost functions of subsystems. When solving for the local control actions, the joint optimality equation for each subsystem is cast as a linear partial differential equation and solved using the Feynman-Kac formula. The solution and the optimal control action are then formulated as path integrals and approximated by a Monte-Carlo method. Numerical verification is provided through a simulation example consisting of a team of cooperative UAVs.
- 9 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 65 (4) , 1697-1703
A Simplified Approach to Analyze Complementary Sensitivity Tradeoffs in Continuous-Time and Discrete-Time Systems
Continuous-time and discrete-time complementary sensitivity Bode integrals (CSBIs) are investigated via a simplified approach in this note. For continuous-time feedback systems with unbounded frequency domain, the CSBI weighted by 1/ω 2 is considered, where this simplified method reveals a more explicit relationship between the value of CSBI and the structure of the open-loop transfer function. With a minor modification of this method, the CSBI of discrete-time system is derived, and illustrative examples are provided. Compared with the existing results on CSBI, neither the Cauchy integral theorem nor the Poisson integral formula is used throughout the analysis, and the analytic constraint on the integrand is removed.
- 9 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 65 (4) , 1697-1703
A Simplified Approach to Analyze Complementary Sensitivity Tradeoffs in Continuous-Time and Discrete-Time Systems
Continuous-time and discrete-time complementary sensitivity Bode integrals (CSBIs) are investigated via a simplified approach in this note. For continuous-time feedback systems with unbounded frequency domain, the CSBI weighted by 1/ω 2 is considered, where this simplified method reveals a more explicit relationship between the value of CSBI and the structure of the open-loop transfer function. With a minor modification of this method, the CSBI of discrete-time system is derived, and illustrative examples are provided. Compared with the existing results on CSBI, neither the Cauchy integral theorem nor the Poisson integral formula is used throughout the analysis, and the analytic constraint on the integrand is removed.
- 1 March 2019
- Published by Elsevier in Aerospace Science and Technology
- Vol. 86, 455-464
An iterative strategy for task assignment and path planning of distributed multiple unmanned aerial vehicles
- 1 March 2019
- Published by Elsevier in Aerospace Science and Technology
- Vol. 86, 455-464
An iterative strategy for task assignment and path planning of distributed multiple unmanned aerial vehicles
- 18 July 2018
- Published by ASME International in Journal of Mechanisms and Robotics
- Vol. 10 (5) , 051013
A Geometric Approach to Obtain the Closed-Form Forward Kinematics of H4 Parallel Robot
To obtain the closed-form forward kinematics of parallel robots, researchers use algebra-based method to transform and simplify the constraint equations. However, this method requires a complicated derivation that leads to high-order univariate variable equations. In fact, some particular mechanisms, such as Delta, or H4 possess many invariant geometric properties during movement. This suggests that one might be able to transform and reduce the problem using geometric approaches. Therefore, a simpler and more efficient solution might be found. Based on this idea, we developed a new geometric approach called geometric forward kinematics (GFK) to obtain the closed-form solutions of H4 forward kinematics in this paper. The result shows that the forward kinematics of H4 yields an eighth degree univariate polynomial, compared with earlier reported 16th degree. Thanks to its clear physical meaning, an intensive discussion about the solutions is presented. Results indicate that a general H4 robot can have up to eight nonrepeated real solutions for its forward kinematics. For a specific configuration of H4, the nonrepeated number of real roots could be restricted to only two, four, or six. Two traveling plate configurations are discussed in this paper as two typical categories of H4. A numerical analysis was also performed for this new method.
- 18 July 2018
- Published by ASME International in Journal of Mechanisms and Robotics
- Vol. 10 (5) , 051013
A Geometric Approach to Obtain the Closed-Form Forward Kinematics of H4 Parallel Robot
To obtain the closed-form forward kinematics of parallel robots, researchers use algebra-based method to transform and simplify the constraint equations. However, this method requires a complicated derivation that leads to high-order univariate variable equations. In fact, some particular mechanisms, such as Delta, or H4 possess many invariant geometric properties during movement. This suggests that one might be able to transform and reduce the problem using geometric approaches. Therefore, a simpler and more efficient solution might be found. Based on this idea, we developed a new geometric approach called geometric forward kinematics (GFK) to obtain the closed-form solutions of H4 forward kinematics in this paper. The result shows that the forward kinematics of H4 yields an eighth degree univariate polynomial, compared with earlier reported 16th degree. Thanks to its clear physical meaning, an intensive discussion about the solutions is presented. Results indicate that a general H4 robot can have up to eight nonrepeated real solutions for its forward kinematics. For a specific configuration of H4, the nonrepeated number of real roots could be restricted to only two, four, or six. Two traveling plate configurations are discussed in this paper as two typical categories of H4. A numerical analysis was also performed for this new method.