Yunmin Zhu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yunmin Zhu has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Xiaojing Shen
Sichuan University
14 shared publications - Zhiguo Wang
Department of Mathematics, Sichuan University, Chengdu, Sichuan, China
9 shared publications Enbin Song
Sichuan University
4 shared publications- Enbin Song
College of Mathematics, Sichuan University, Chengdu, China
4 shared publications Jie Zhou
Department of Mathematics, Sichuan University, Chengdu, Sichuan, 610064, P. R. China
3 shared publications- Dandan Luo
Department of Mathematics Sichuan University Chengdu 610064 Sichuan China
2 shared publications
Latest Publications
- 18 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 67 (5) , 2405-2418
Dual Set Membership Filter With Minimizing Nonlinear Transformation of Ellipsoid
In this article, we propose a dual set membership filter for nonlinear dynamic systems with additive unknown but bounded noises, and it has three distinct advantages. First, the nonlinear system is translated into the linear system by leveraging a semi-infinite programming, rather than linearizing the nonlinear function. The semi-infinite programming is to find an ellipsoid bounding the nonlinear transformation of an ellipsoid, which aims to compute a tight ellipsoid to cover the state. Second, the duality result of the semi-infinite programming is derived by rigorous analysis; then, a first-order Frank–Wolfe method is developed to efficiently solve it with a lower computation complexity. Third, the proposed filter enjoys stability for some special nonlinear dynamic systems and succeeds the advantages of the classic linear set membership filter. Finally, two illustrative examples in the simulations reveal the effectiveness of the dual set membership filter.
- 18 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 67 (5) , 2405-2418
Dual Set Membership Filter With Minimizing Nonlinear Transformation of Ellipsoid
In this article, we propose a dual set membership filter for nonlinear dynamic systems with additive unknown but bounded noises, and it has three distinct advantages. First, the nonlinear system is translated into the linear system by leveraging a semi-infinite programming, rather than linearizing the nonlinear function. The semi-infinite programming is to find an ellipsoid bounding the nonlinear transformation of an ellipsoid, which aims to compute a tight ellipsoid to cover the state. Second, the duality result of the semi-infinite programming is derived by rigorous analysis; then, a first-order Frank–Wolfe method is developed to efficiently solve it with a lower computation complexity. Third, the proposed filter enjoys stability for some special nonlinear dynamic systems and succeeds the advantages of the classic linear set membership filter. Finally, two illustrative examples in the simulations reveal the effectiveness of the dual set membership filter.
- 14 December 2019
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 32 (6) , 1526-1543
Posterior Cramér-Rao Bounds for Nonlinear Dynamic System with Colored Noises
- 14 December 2019
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 32 (6) , 1526-1543
Posterior Cramér-Rao Bounds for Nonlinear Dynamic System with Colored Noises
- Open Access
Multiple-Source Ellipsoidal Localization Using Acoustic Energy Measurements
In this paper, the multiple-source ellipsoidal localization problem based on acoustic energy measurements is investigated via set-membership estimation theory. When the probability density function of measurement noise is unknown-but-bounded, multiple-source localization is a difficult problem since not only the acoustic energy measurements are complicated nonlinear functions of multiple sources, but also the multiple sources bring about a high-dimensional state estimation problem. First, when the energy parameter and the position of the source are bounded in an interval and a ball respectively, the nonlinear remainder bound of the Taylor series expansion is obtained analytically on-line. Next, based on the separability of the nonlinear measurement function, an efficient estimation procedure is developed. It solves the multiple-source localization problem by using an alternating optimization iterative algorithm, in which the remainder bound needs to be known on-line. For this reason, we first derive the remainder bound analytically. When the energy decay factor is unknown but bounded, an efficient estimation procedure is developed based on interval mathematics. Finally, numerical examples demonstrate the effectiveness of the ellipsoidal localization algorithms for multiple-source localization. In particular, our results show that when the noise is non-Gaussian, the set-membership localization algorithm performs better than the EM localization algorithm.
Open AccessMultiple-Source Ellipsoidal Localization Using Acoustic Energy Measurements
In this paper, the multiple-source ellipsoidal localization problem based on acoustic energy measurements is investigated via set-membership estimation theory. When the probability density function of measurement noise is unknown-but-bounded, multiple-source localization is a difficult problem since not only the acoustic energy measurements are complicated nonlinear functions of multiple sources, but also the multiple sources bring about a high-dimensional state estimation problem. First, when the energy parameter and the position of the source are bounded in an interval and a ball respectively, the nonlinear remainder bound of the Taylor series expansion is obtained analytically on-line. Next, based on the separability of the nonlinear measurement function, an efficient estimation procedure is developed. It solves the multiple-source localization problem by using an alternating optimization iterative algorithm, in which the remainder bound needs to be known on-line. For this reason, we first derive the remainder bound analytically. When the energy decay factor is unknown but bounded, an efficient estimation procedure is developed based on interval mathematics. Finally, numerical examples demonstrate the effectiveness of the ellipsoidal localization algorithms for multiple-source localization. In particular, our results show that when the noise is non-Gaussian, the set-membership localization algorithm performs better than the EM localization algorithm.
- 13 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 67 (9) , 2453-2468
Joint Optimization of Dimension Assignment and Compression in Distributed Estimation Fusion
- 13 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 67 (9) , 2453-2468
Joint Optimization of Dimension Assignment and Compression in Distributed Estimation Fusion
- 4 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 64 (11) , 4725-4732
Ellipsoidal Fusion Estimation for Multisensor Dynamic Systems With Bounded Noises
This paper considers the set membership fusion estimation problem for the general multisensor dynamic systems with unknown but bounded noises. In order to achieve the ellipsoidal fusion formulae, we divide the set membership filter problem into two steps: the prediction step and the fusion update step. The proposed method has the following nice properties. Firstly, each step can be converted into a semidefinite programming problem which can be efficiently computed. Secondly, partanalytical formulae of the shape matrix and the center of the bounding ellipsoid can be derived by using a decoupled technique, which can significantly reduce the computational complexity. Moreover, the relationship between the fusion center and local sensors can be clearly revealed based on the ellipsoidal fusion formula. Finally, it is interesting that the ellipsoidal fusion formula is similar in form to the classic mean squared error filter fusion, although they are of the different optimization frameworks. However, the fusion weights of the information matrix provided by the different sensors are different and the optimal fusion weights can be calculated by solving a convex optimization problem. A typical numerical example in target tracking demonstrates the effectiveness of the proposed centralized and distributed fusion formula
- 4 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 64 (11) , 4725-4732
Ellipsoidal Fusion Estimation for Multisensor Dynamic Systems With Bounded Noises
This paper considers the set membership fusion estimation problem for the general multisensor dynamic systems with unknown but bounded noises. In order to achieve the ellipsoidal fusion formulae, we divide the set membership filter problem into two steps: the prediction step and the fusion update step. The proposed method has the following nice properties. Firstly, each step can be converted into a semidefinite programming problem which can be efficiently computed. Secondly, partanalytical formulae of the shape matrix and the center of the bounding ellipsoid can be derived by using a decoupled technique, which can significantly reduce the computational complexity. Moreover, the relationship between the fusion center and local sensors can be clearly revealed based on the ellipsoidal fusion formula. Finally, it is interesting that the ellipsoidal fusion formula is similar in form to the classic mean squared error filter fusion, although they are of the different optimization frameworks. However, the fusion weights of the information matrix provided by the different sensors are different and the optimal fusion weights can be calculated by solving a convex optimization problem. A typical numerical example in target tracking demonstrates the effectiveness of the proposed centralized and distributed fusion formula
- Open Access
Globally Optimal Distributed Kalman Filtering for Multisensor Systems with Unknown Inputs
In this paper, the state estimation for dynamic system with unknown inputs modeled as an autoregressive AR (1) process is considered. We propose an optimal algorithm in mean square error sense by using difference method to eliminate the unknown inputs. Moreover, we consider the state estimation for multisensor dynamic systems with unknown inputs. It is proved that the distributed fused state estimate is equivalent to the centralized Kalman filtering using all sensor measurement; therefore, it achieves the best performance. The computation complexity of the traditional augmented state algorithm increases with the augmented state dimension. While, the new algorithm shows good performance with much less computations compared to that of the traditional augmented state algorithms. Moreover, numerical examples show that the performances of the traditional algorithms greatly depend on the initial value of the unknown inputs, if the estimation of initial value of the unknown input is largely biased, the performances of the traditional algorithms become quite worse. However, the new algorithm still works well because it is independent of the initial value of the unknown input.
Open AccessGlobally Optimal Distributed Kalman Filtering for Multisensor Systems with Unknown Inputs
In this paper, the state estimation for dynamic system with unknown inputs modeled as an autoregressive AR (1) process is considered. We propose an optimal algorithm in mean square error sense by using difference method to eliminate the unknown inputs. Moreover, we consider the state estimation for multisensor dynamic systems with unknown inputs. It is proved that the distributed fused state estimate is equivalent to the centralized Kalman filtering using all sensor measurement; therefore, it achieves the best performance. The computation complexity of the traditional augmented state algorithm increases with the augmented state dimension. While, the new algorithm shows good performance with much less computations compared to that of the traditional augmented state algorithms. Moreover, numerical examples show that the performances of the traditional algorithms greatly depend on the initial value of the unknown inputs, if the estimation of initial value of the unknown input is largely biased, the performances of the traditional algorithms become quite worse. However, the new algorithm still works well because it is independent of the initial value of the unknown input.
- Open Access
- 18 July 2018
- Published by IntechOpen
Monte Carlo Set-Membership Filtering for Nonlinear Dynamic Systems
This chapter considers the nonlinear filtering problem involving noises that are unknown and bounded. We propose a new filtering method via set-membership theory and boundary sampling technique to determine a state estimation ellipsoid. In order to guarantee the online usage, the nonlinear dynamics are linearized about the current estimate, and the remainder term is then bounded by an optimization ellipsoid, which can be described as the solution of a semi-infinite optimization problem. It is an analytically intractable problem for general nonlinear dynamic systems. Nevertheless, for a typical nonlinear dynamic system in target tracking, some certain regular properties for the remainder are analytically derived; then, we use a randomized method to approximate the semi-infinite optimization problem efficiently. Moreover, for some quadratic nonlinear dynamic systems, the semi-infinite optimization problem is equivalent to solving a semi-definite program problem. Finally, the set-membership prediction and measurement update are derived based on the recent optimization method and the online bounding ellipsoid of the remainder other than a priori bound. Numerical example shows that the proposed method performs better than the extended set-membership filter, especially in the situation of the larger noise.
- 18 July 2018
- Published by IntechOpen
Open AccessMonte Carlo Set-Membership Filtering for Nonlinear Dynamic Systems
This chapter considers the nonlinear filtering problem involving noises that are unknown and bounded. We propose a new filtering method via set-membership theory and boundary sampling technique to determine a state estimation ellipsoid. In order to guarantee the online usage, the nonlinear dynamics are linearized about the current estimate, and the remainder term is then bounded by an optimization ellipsoid, which can be described as the solution of a semi-infinite optimization problem. It is an analytically intractable problem for general nonlinear dynamic systems. Nevertheless, for a typical nonlinear dynamic system in target tracking, some certain regular properties for the remainder are analytically derived; then, we use a randomized method to approximate the semi-infinite optimization problem efficiently. Moreover, for some quadratic nonlinear dynamic systems, the semi-infinite optimization problem is equivalent to solving a semi-definite program problem. Finally, the set-membership prediction and measurement update are derived based on the recent optimization method and the online bounding ellipsoid of the remainder other than a priori bound. Numerical example shows that the proposed method performs better than the extended set-membership filter, especially in the situation of the larger noise.
- 4 June 2018
- Published by Springer Nature in Science China Mathematics
- Vol. 61 (10) , 1851-1880
Robust hypothesis testing for asymmetric nominal densities under a relative entropy tolerance
- 4 June 2018
- Published by Springer Nature in Science China Mathematics
- Vol. 61 (10) , 1851-1880
Robust hypothesis testing for asymmetric nominal densities under a relative entropy tolerance
- Open Access
The Cramér–Rao Bounds and Sensor Selection for Nonlinear Systems with Uncertain Observations
This paper considers the problems of the posterior Cramér–Rao bound and sensor selection for multi-sensor nonlinear systems with uncertain observations. In order to effectively overcome the difficulties caused by uncertainty, we investigate two methods to derive the posterior Cramér–Rao bound. The first method is based on the recursive formula of the Cramér–Rao bound and the Gaussian mixture model. Nevertheless, it needs to compute a complex integral based on the joint probability density function of the sensor measurements and the target state. The computation burden of this method is relatively high, especially in large sensor networks. Inspired by the idea of the expectation maximization algorithm, the second method is to introduce some 0–1 latent variables to deal with the Gaussian mixture model. Since the regular condition of the posterior Cramér–Rao bound is unsatisfied for the discrete uncertain system, we use some continuous variables to approximate the discrete latent variables. Then, a new Cramér–Rao bound can be achieved by a limiting process of the Cramér–Rao bound of the continuous system. It avoids the complex integral, which can reduce the computation burden. Based on the new posterior Cramér–Rao bound, the optimal solution of the sensor selection problem can be derived analytically. Thus, it can be used to deal with the sensor selection of a large-scale sensor networks. Two typical numerical examples verify the effectiveness of the proposed methods.
Open AccessThe Cramér–Rao Bounds and Sensor Selection for Nonlinear Systems with Uncertain Observations
This paper considers the problems of the posterior Cramér–Rao bound and sensor selection for multi-sensor nonlinear systems with uncertain observations. In order to effectively overcome the difficulties caused by uncertainty, we investigate two methods to derive the posterior Cramér–Rao bound. The first method is based on the recursive formula of the Cramér–Rao bound and the Gaussian mixture model. Nevertheless, it needs to compute a complex integral based on the joint probability density function of the sensor measurements and the target state. The computation burden of this method is relatively high, especially in large sensor networks. Inspired by the idea of the expectation maximization algorithm, the second method is to introduce some 0–1 latent variables to deal with the Gaussian mixture model. Since the regular condition of the posterior Cramér–Rao bound is unsatisfied for the discrete uncertain system, we use some continuous variables to approximate the discrete latent variables. Then, a new Cramér–Rao bound can be achieved by a limiting process of the Cramér–Rao bound of the continuous system. It avoids the complex integral, which can reduce the computation burden. Based on the new posterior Cramér–Rao bound, the optimal solution of the sensor selection problem can be derived analytically. Thus, it can be used to deal with the sensor selection of a large-scale sensor networks. Two typical numerical examples verify the effectiveness of the proposed methods.