Yunmin Zhu

Yunmin Zhu

Auto-generated profile, based on publicly available information

Yunmin Zhu

Sichuan University

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 December 2008 in Sensors
Verified
Journal Article
Open access
PDF file
YLYingting Luo
Yingting Luo
YZYunmin Zhu
Yunmin Zhu
DLDandan Luo
Dandan Luo
JZJie Zhou
Jie Zhou
ESEnbin Song
Enbin Song
DWDonghua Wang
Donghua Wang
This paper proposes a new distributed Kalman filtering fusion with random state transition and measurement matrices, i.e., random parameter matrices Kalman filtering. It is proved that under a mild condition the fused state estimate is equivalent to the centralized Kalman filtering using all sensor measurements; therefore, it achieves the best performance. More importantly, this result can be applied to Kalman filtering with uncertain observations including the measurement with a false alarm probability as a special case, as well as, randomly variant dynamic systems with multiple models. Numerical examples are given which support our analysis and show significant performance loss of ignoring the randomness of the parameter matrices.

4 March 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
WZWang Zhiguo
Wang Zhiguo
XSXiaojing Shen
Xiaojing Shen
YZYunmin Zhu
Yunmin Zhu
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

18 May 2021 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
WZWang Zhiguo
Wang Zhiguo
XSXiaojing Shen
Xiaojing Shen
HLHaiqi Liu
Haiqi Liu
FMFanqin Meng
Fanqin Meng
YZYunmin Zhu
Yunmin Zhu
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.

13 March 2019 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
LZLinxia Zhang
Linxia Zhang
DNDunbiao Niu
Dunbiao Niu
ESEnbin Song
Enbin Song
JZJie Zhou
Jie Zhou
QSQingjiang Shi
Qingjiang Shi
YZYunmin Zhu
Yunmin Zhu

25 April 2025 in Aerospace Science and Technology
Verified
Journal Article
Closed access
FYFengqi Yang
Fengqi Yang
JZJinshan Zhong
Jinshan Zhong
YLYingting Luo
Yingting Luo
YZYing Zhang
Ying Zhang
XSXiaojing Shen
Xiaojing Shen
YZYunmin Zhu
Yunmin Zhu

5 April 2018 in Sensors
Verified
Journal Article
Open access
PDF file
WZWang Zhiguo
Wang Zhiguo
XSXiaojing Shen
Xiaojing Shen
PWPing Wang
Ping Wang
YZYunmin Zhu
Yunmin Zhu
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.