Siyu Xie
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
Siyu Xie has a total of 52 co-authors. Here are the top co-authors by number of shared publications:
- Die Gan
College of Artificial Intelligence, Nankai University, Tianjin, China
7 shared publications - Le Yi Wang
Department of Electrical and Computer Engineering, Wayne State University, Detroit, MI, USA
7 shared publications - Masoud Honarvar Nazari
Department of Electrical and Computer Engineering Wayne State University Detroit Michigan
5 shared publications - George Yin
Department of Mathematics, University of Connecticut, Storrs, CT 06269 USA
4 shared publications - Zhixin Liu
State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China
4 shared publications - Lei Guo
Chinese Academy of Sciences
3 shared publications
Latest Publications
- Open Access
- 12 October 2026
- Published by Elsevier in SSRN Electronic Journal
RT-LIVO: Semantic and Motion-Aware LiDAR-Inertial-Visual Odometry for Robust Mapping in Dynamic Environments
Moving objects introduce observations that conflict with the static-scene model used by LiDAR-inertial-visual odometry (LIVO), affecting both pose estimation and map construction. Semantic detections help identify these observations, but object category alone does not establish motion, and image-plane overlap does not establish camera–LiDAR correspondence. This paper presents RT-LIVO, which links semantic-motion classification, depth-aware measurement selection, and visual weighting within a tightly coupled LIVO framework. Category priors and optical-flow verification assign candidate states, with temporal smoothing and adaptive expansion accounting for intermittent detections and image-plane displacement. The resulting mask controls new visual map-point admission. LiDAR measurements are rejected using image-plane and depth agreement when candidate depth is available, with a two-dimensional fallback otherwise. An empirical reliability score, combining recent valid-feature availability with moving and uncertain candidate ratios, adjusts the photometric covariance in the sequential error-state iterated Kalman filter. On M3DGR, RT-LIVO achieves absolute trajectory error (ATE) and relative pose error (RPE) comparable to the LiDAR-based baselines, while the displayed maps contain fewer dynamic ghost structures. On three self-collected sequences without full-trajectory ground truth, the average endpoint-to-startpoint drift ratio decreases from 4.0257% for FAST-LIVO2 to 0.0793%, indicating improved terminal closure consistency. The average processing time is 25.10 ms per frame on the reported platform. The results support measurement selection and visual weighting for limiting dynamic-scene interference.
- 12 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessRT-LIVO: Semantic and Motion-Aware LiDAR-Inertial-Visual Odometry for Robust Mapping in Dynamic Environments
Moving objects introduce observations that conflict with the static-scene model used by LiDAR-inertial-visual odometry (LIVO), affecting both pose estimation and map construction. Semantic detections help identify these observations, but object category alone does not establish motion, and image-plane overlap does not establish camera–LiDAR correspondence. This paper presents RT-LIVO, which links semantic-motion classification, depth-aware measurement selection, and visual weighting within a tightly coupled LIVO framework. Category priors and optical-flow verification assign candidate states, with temporal smoothing and adaptive expansion accounting for intermittent detections and image-plane displacement. The resulting mask controls new visual map-point admission. LiDAR measurements are rejected using image-plane and depth agreement when candidate depth is available, with a two-dimensional fallback otherwise. An empirical reliability score, combining recent valid-feature availability with moving and uncertain candidate ratios, adjusts the photometric covariance in the sequential error-state iterated Kalman filter. On M3DGR, RT-LIVO achieves absolute trajectory error (ATE) and relative pose error (RPE) comparable to the LiDAR-based baselines, while the displayed maps contain fewer dynamic ghost structures. On three self-collected sequences without full-trajectory ground truth, the average endpoint-to-startpoint drift ratio decreases from 4.0257% for FAST-LIVO2 to 0.0793%, indicating improved terminal closure consistency. The average processing time is 25.10 ms per frame on the reported platform. The results support measurement selection and visual weighting for limiting dynamic-scene interference.
- 1 September 2026
- Published by American Society of Civil Engineers (ASCE) in Journal of Aerospace Engineering
- Vol. 39 (5)
Precision Control of UAVs under Small-Scale Coaxial Rotor Aerodynamic Interference Using TTV-UDE
- 1 September 2026
- Published by American Society of Civil Engineers (ASCE) in Journal of Aerospace Engineering
- Vol. 39 (5)
Precision Control of UAVs under Small-Scale Coaxial Rotor Aerodynamic Interference Using TTV-UDE
- 17 July 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 64 (4) , 2641-2670
Distributed Sparse Identification in Multivariate Stochastic Regression Model under Colored Noise
This paper investigates the distributed sparse identification problem in multivariate stochastic regression models under colored noise. A novel distributed extended least squares algorithm is proposed based on the [Formula: see text]-regularization, enhanced by a two-stage estimation scheme to promote sparsity. In the first stage, initial estimates of the sparse parameter matrix are obtained by locally applying an extended least squares method with information exchange among neighboring agents. In the second stage, these estimates are refined by minimizing a local cost function that combines cumulative estimation errors with an adaptively weighted [Formula: see text]-regularization term. Under the weakest possible cooperative nonpersistent excitation condition, the proposed algorithm establishes the set convergence of zero elements with a finite number of observations and the almost sure convergence of nonzero elements. Moreover, the prediction accuracy is characterized by analyzing the upper bound of the accumulated regret without any excitation conditions. These theoretical results effectively address the challenge of distributed sparse parameter identification under nonindependent and nonstationary observation sequences and enable the application of the proposed method to stochastic systems with feedback loops.
- 17 July 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 64 (4) , 2641-2670
Distributed Sparse Identification in Multivariate Stochastic Regression Model under Colored Noise
This paper investigates the distributed sparse identification problem in multivariate stochastic regression models under colored noise. A novel distributed extended least squares algorithm is proposed based on the [Formula: see text]-regularization, enhanced by a two-stage estimation scheme to promote sparsity. In the first stage, initial estimates of the sparse parameter matrix are obtained by locally applying an extended least squares method with information exchange among neighboring agents. In the second stage, these estimates are refined by minimizing a local cost function that combines cumulative estimation errors with an adaptively weighted [Formula: see text]-regularization term. Under the weakest possible cooperative nonpersistent excitation condition, the proposed algorithm establishes the set convergence of zero elements with a finite number of observations and the almost sure convergence of nonzero elements. Moreover, the prediction accuracy is characterized by analyzing the upper bound of the accumulated regret without any excitation conditions. These theoretical results effectively address the challenge of distributed sparse parameter identification under nonindependent and nonstationary observation sequences and enable the application of the proposed method to stochastic systems with feedback loops.
- 16 November 2025
- Published by Springer Nature
- p. 602-622
Precision Control of UAVs Under Small-Scale Coaxial Rotor Aerodynamic Interference
- 16 November 2025
- Published by Springer Nature
- p. 602-622
Precision Control of UAVs Under Small-Scale Coaxial Rotor Aerodynamic Interference
- Open Access
- 12 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 6, 6666-6681
Collaborative Spectrum Sensing Based on Distributed Adaptive Filtering
Spectrum sharing technology can reduce the problem of limited spectrum resources failing to meet the demands of multiple users, and it is one of the important topics in effectively integrating existing communication technologies with the sixth-generation mobile communication (6G). Spectrum sensing is generally a crucial prerequisite for achieving spectrum sharing, and designing stable and effective spectrum sensing algorithms is a necessary condition for enabling efficient spectrum sharing among multiple users. However, most existing spectrum sensing methods were designed for stationary signal scenarios, which are clearly unsuitable for non-stationary signal situations that arise in some practical 6G applications. Therefore, we transform the spectrum sensing problem into a distributed filtering problem and propose an adaptive collaborative spectrum sensing algorithm based on the distributed normalized least mean squares (NLMS) algorithm under the assumption of non-stationary signals. Secondary users (SUs) are treated as independent agents, and the communication network is modeled as an undirected graph. Each SU receives the primary user (PU)’s signal and information from neighboring nodes, using a collaborative algorithm to estimate the PU’s signal in order to determine whether the target spectrum can be shared. The main innovation of this paper is to propose a diffusion adaptive cooperative spectrum sensing algorithm based on NLMS (DNLMS-CSS), which can track signals under the assumption of non-stationary signals. The stability of the algorithm is derived, and an upper bound for its estimation error is established. Furthermore, the simulation results indicate that the sensing performance of this algorithm is superior to several other commonly used spectrum sensing methods.
- 12 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 6, 6666-6681
Open AccessCollaborative Spectrum Sensing Based on Distributed Adaptive Filtering
Spectrum sharing technology can reduce the problem of limited spectrum resources failing to meet the demands of multiple users, and it is one of the important topics in effectively integrating existing communication technologies with the sixth-generation mobile communication (6G). Spectrum sensing is generally a crucial prerequisite for achieving spectrum sharing, and designing stable and effective spectrum sensing algorithms is a necessary condition for enabling efficient spectrum sharing among multiple users. However, most existing spectrum sensing methods were designed for stationary signal scenarios, which are clearly unsuitable for non-stationary signal situations that arise in some practical 6G applications. Therefore, we transform the spectrum sensing problem into a distributed filtering problem and propose an adaptive collaborative spectrum sensing algorithm based on the distributed normalized least mean squares (NLMS) algorithm under the assumption of non-stationary signals. Secondary users (SUs) are treated as independent agents, and the communication network is modeled as an undirected graph. Each SU receives the primary user (PU)’s signal and information from neighboring nodes, using a collaborative algorithm to estimate the PU’s signal in order to determine whether the target spectrum can be shared. The main innovation of this paper is to propose a diffusion adaptive cooperative spectrum sensing algorithm based on NLMS (DNLMS-CSS), which can track signals under the assumption of non-stationary signals. The stability of the algorithm is derived, and an upper bound for its estimation error is established. Furthermore, the simulation results indicate that the sensing performance of this algorithm is superior to several other commonly used spectrum sensing methods.
- 22 April 2025
- Published by Springer Nature in Control Theory and Technology
- Vol. 23 (2) , 161-175
Stability analysis of distributed Kalman filtering algorithm for stochastic regression model
- 22 April 2025
- Published by Springer Nature in Control Theory and Technology
- Vol. 23 (2) , 161-175
Stability analysis of distributed Kalman filtering algorithm for stochastic regression model
- 17 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 55 (3) , 1372-1384
Analysis of the Compressed Distributed Kalman Filter Over Markovian Switching Topology
This article investigates the distributed estimation problem of an unknown high-dimensional sparse state vector for a stochastic dynamic system. The communication topology randomly switches, and the switching law is governed by a time-homogeneous Markovian chain. By means of the compressed sensing (CS) theory and a diffusion strategy, we propose a compressed distributed Kalman filter (CDKF). That is, each sensor first compresses the original high-dimensional regression data. Then, the covariance intersection fusion rule is utilized to obtain a distributed Kalman filter (DKF) estimate in the compressed low-dimensional space. Afterward, the original high-dimensional sparse state vector can be well recovered by a reconstruction technique. In terms of stability analysis, one of the main difficulties lies in analyzing the product of nonindependent and nonstationary random matrices in the context of time-varying communication topologies. Relying on the stochastic stability theory, the Markov chain theory, and the CS theory, we establish the upper bound for the estimation error under the compressed cooperative excitation condition, which is much weaker than the traditional uncompressed collective observability conditions used in the existing literature. Finally, we provide a simulation example to illustrate the performance of the proposed algorithm.
- 17 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 55 (3) , 1372-1384
Analysis of the Compressed Distributed Kalman Filter Over Markovian Switching Topology
This article investigates the distributed estimation problem of an unknown high-dimensional sparse state vector for a stochastic dynamic system. The communication topology randomly switches, and the switching law is governed by a time-homogeneous Markovian chain. By means of the compressed sensing (CS) theory and a diffusion strategy, we propose a compressed distributed Kalman filter (CDKF). That is, each sensor first compresses the original high-dimensional regression data. Then, the covariance intersection fusion rule is utilized to obtain a distributed Kalman filter (DKF) estimate in the compressed low-dimensional space. Afterward, the original high-dimensional sparse state vector can be well recovered by a reconstruction technique. In terms of stability analysis, one of the main difficulties lies in analyzing the product of nonindependent and nonstationary random matrices in the context of time-varying communication topologies. Relying on the stochastic stability theory, the Markov chain theory, and the CS theory, we establish the upper bound for the estimation error under the compressed cooperative excitation condition, which is much weaker than the traditional uncompressed collective observability conditions used in the existing literature. Finally, we provide a simulation example to illustrate the performance of the proposed algorithm.
- 22 November 2024
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 362 (1)
Event-triggered consensus adaptive filters for target localization
- 22 November 2024
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 362 (1)
Event-triggered consensus adaptive filters for target localization
- Open Access
Stability analysis of distributed Kalman filtering algorithm for stochastic regression model
In this paper, a distributed Kalman filtering (DKF) algorithm is proposed based on a diffusion strategy, which is used to track an unknown signal process in sensor networks cooperatively. Unlike the centralized algorithms, no fusion center is need here, which implies that the DKF algorithm is more robust and scalable. Moreover, the stability of the DKF algorithm is established under non-independent and non-stationary signal conditions. The cooperative information condition used in the paper shows that even if any sensor cannot track the unknown signal individually, the DKF algorithm can be utilized to fulfill the estimation task in a cooperative way. Finally, we illustrate the cooperative property of the DKF algorithm by using a simulation example.
Open AccessStability analysis of distributed Kalman filtering algorithm for stochastic regression model
In this paper, a distributed Kalman filtering (DKF) algorithm is proposed based on a diffusion strategy, which is used to track an unknown signal process in sensor networks cooperatively. Unlike the centralized algorithms, no fusion center is need here, which implies that the DKF algorithm is more robust and scalable. Moreover, the stability of the DKF algorithm is established under non-independent and non-stationary signal conditions. The cooperative information condition used in the paper shows that even if any sensor cannot track the unknown signal individually, the DKF algorithm can be utilized to fulfill the estimation task in a cooperative way. Finally, we illustrate the cooperative property of the DKF algorithm by using a simulation example.