Yirui Cong
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
Yirui Cong has a total of 75 co-authors. Here are the top co-authors by number of shared publications:
- Xiangke Wang
National University of Defense Technology
13 shared publications - Xiangyun Zhou
School of Engineering, The Australian National University, Canberra, Australia
10 shared publications - Jiuxiang Dong
Northeastern University
5 shared publications Lincheng Shen
College of Intelligence Science and Technology, National University of Defense Technology, Changsha, China
3 shared publications- Yu Ding
College of Intelligence Science and Technology, National University of Defense Technology, Changsha, China
3 shared publications - Yudong Li
College of Information Science and Engineering, Northeastern University, Shenyang, China
3 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (11) , 7463-7470
Asymptotic Boundedness of Distributed Set-Membership Filtering
Asymptotic boundedness is a crucial property of Distributed Set-Membership Filtering (DSMFing) that prevents the unbounded growth of the set estimates caused by the wrapping effect. However, this important property remains underinvestigated, compared to its noise-free and stochastic-noise counterparts, i.e., the convergence of Distributed Observers (DOs) and the bounded error covariance of Distributed Kalman Filters (DKFs). This paper studies the asymptotic boundedness of DSMFing for linear discrete-time systems. A novel concept, termed the Distributed Observation-Information Tower (DOIT), is introduced to characterize the fundamental relationship between the structure of graphs and the set estimates, which enables the boundedness analysis. Leveraging the DOIT, an easily verifiable sufficient condition for the asymptotic boundedness of linear DSMFing is established. Surprisingly, the sufficient condition generalizes the well-known collective detectability condition for DOs and DKFs; it links DSMFs to existing distributed estimation methods and reveals the unique characteristic of DSMFs.
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (11) , 7463-7470
Asymptotic Boundedness of Distributed Set-Membership Filtering
Asymptotic boundedness is a crucial property of Distributed Set-Membership Filtering (DSMFing) that prevents the unbounded growth of the set estimates caused by the wrapping effect. However, this important property remains underinvestigated, compared to its noise-free and stochastic-noise counterparts, i.e., the convergence of Distributed Observers (DOs) and the bounded error covariance of Distributed Kalman Filters (DKFs). This paper studies the asymptotic boundedness of DSMFing for linear discrete-time systems. A novel concept, termed the Distributed Observation-Information Tower (DOIT), is introduced to characterize the fundamental relationship between the structure of graphs and the set estimates, which enables the boundedness analysis. Leveraging the DOIT, an easily verifiable sufficient condition for the asymptotic boundedness of linear DSMFing is established. Surprisingly, the sufficient condition generalizes the well-known collective detectability condition for DOs and DKFs; it links DSMFs to existing distributed estimation methods and reveals the unique characteristic of DSMFs.
- 20 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 11236-11248
Distributed Fault Estimation With Noisy Measurements in Formation Control
Accurate fault estimation in multi-agent formations is critical for ensuring overall system reliability, yet it remains particularly challenging in noisy environments where conventional methods often fail. This paper presents a distributed adaptive fault estimation approach and designs an adaptive observer-based estimator, leveraging local and neighboring state information for robust fault signal reconstruction under noise interference. Through rigorous Lyapunov stability analysis, we establish the global uniformly ultimately bounded (UUB) convergence of estimation errors. Our proposed algorithm's performance is further verified via both numerical simulations and Gazebo experiments, demonstrating its capability to accurately estimate fault signals despite environmental noise and formation coupling effects.
- 20 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 11236-11248
Distributed Fault Estimation With Noisy Measurements in Formation Control
Accurate fault estimation in multi-agent formations is critical for ensuring overall system reliability, yet it remains particularly challenging in noisy environments where conventional methods often fail. This paper presents a distributed adaptive fault estimation approach and designs an adaptive observer-based estimator, leveraging local and neighboring state information for robust fault signal reconstruction under noise interference. Through rigorous Lyapunov stability analysis, we establish the global uniformly ultimately bounded (UUB) convergence of estimation errors. Our proposed algorithm's performance is further verified via both numerical simulations and Gazebo experiments, demonstrating its capability to accurately estimate fault signals despite environmental noise and formation coupling effects.
- 11 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 12, 248-259
Set-Membership Estimation Based Distributed Cooperative Localization of Multiple UAVs
This paper investigates the distributed cooperative localization problem for mobile multi-UAV systems using set-membership estimation (SME). Unlike existing SME approaches relying on prior-known anchors or beacons, we consider a fully autonomous scenario where UAVs need to collaboratively derive guaranteed positional sets using only absolute measurements and relative range measurements from neighboring agents. To handle this problem, we first propose a law-of-total-range method to rigorously quantify the estimated sets from relative measurements, which fits the general form of relative measurements between pairwise UAVs. Based on this new method, a novel distributed SME framework is developed, where each UAV can obtain the guaranteed set containing its true state with only local measurements and communications. In addition, a distributed localization algorithm based on extended constrained zonotopes (ECZ) is designed with a proposed framework. Simulation results and field experiments verify that our proposed method efficiently improves the cooperative localization accuracy and outperforms the linearization-based extended SME method.
- 11 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 12, 248-259
Set-Membership Estimation Based Distributed Cooperative Localization of Multiple UAVs
This paper investigates the distributed cooperative localization problem for mobile multi-UAV systems using set-membership estimation (SME). Unlike existing SME approaches relying on prior-known anchors or beacons, we consider a fully autonomous scenario where UAVs need to collaboratively derive guaranteed positional sets using only absolute measurements and relative range measurements from neighboring agents. To handle this problem, we first propose a law-of-total-range method to rigorously quantify the estimated sets from relative measurements, which fits the general form of relative measurements between pairwise UAVs. Based on this new method, a novel distributed SME framework is developed, where each UAV can obtain the guaranteed set containing its true state with only local measurements and communications. In addition, a distributed localization algorithm based on extended constrained zonotopes (ECZ) is designed with a proposed framework. Simulation results and field experiments verify that our proposed method efficiently improves the cooperative localization accuracy and outperforms the linearization-based extended SME method.
- 4 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (5) , 3099-3112
Reliable Formation Under TDMA Mechanism: Control-Communication Codesign
For formation control systems based on wireless communications, the communication interactions and control performance are highly coupled, while traditional methods do not take this coupling into account. To fill this gap, we study the formation control problem of second-order multiagent systems (MASs) with uncertain dynamics (affected by unknown but bounded (UBB) process noises) and commonly used time division multiple access (TDMA) communications. First, we establish the communication topology among agents as a periodically switching topology governed by precise switching mechanisms, which characterizes the effects of the TDMA mechanism, agent dynamics, and the physical layer of communications. Based on the communication model, we propose a control-communication codesign for MASs, where the delay-based formation controller and the distributed transmit power control algorithm are developed, to guarantee the bounded formation stability of control systems and reliable connections of the desired communication links simultaneously. The codesign framework systematically integrates formation control and communication transmission under physical layer constraints and provides a paradigm to better characterize the coupling relationship between communication interactions and control performance. Finally, experiments using realistic communication characteristics are conducted to validate the effectiveness of our codesign method.
- 4 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (5) , 3099-3112
Reliable Formation Under TDMA Mechanism: Control-Communication Codesign
For formation control systems based on wireless communications, the communication interactions and control performance are highly coupled, while traditional methods do not take this coupling into account. To fill this gap, we study the formation control problem of second-order multiagent systems (MASs) with uncertain dynamics (affected by unknown but bounded (UBB) process noises) and commonly used time division multiple access (TDMA) communications. First, we establish the communication topology among agents as a periodically switching topology governed by precise switching mechanisms, which characterizes the effects of the TDMA mechanism, agent dynamics, and the physical layer of communications. Based on the communication model, we propose a control-communication codesign for MASs, where the delay-based formation controller and the distributed transmit power control algorithm are developed, to guarantee the bounded formation stability of control systems and reliable connections of the desired communication links simultaneously. The codesign framework systematically integrates formation control and communication transmission under physical layer constraints and provides a paradigm to better characterize the coupling relationship between communication interactions and control performance. Finally, experiments using realistic communication characteristics are conducted to validate the effectiveness of our codesign method.
- 23 January 2026
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 363 (4)
L 1 adaptive prescribed-time control
- 23 January 2026
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 363 (4)
L 1 adaptive prescribed-time control
- 12 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (5) , 3327-3334
Optimal Set-Membership Smoothing
This article studies the optimal set-membership smoothing (SMSing) problem for the system with bounded noises. By adopting the mathematical concept of uncertain variables, an optimal SMSing framework is established for the first time. This optimal framework reveals the principles of SMSing and the relationship between set-membership filtering and smoothing. Based on the design principles, we put forward two SMSing algorithms: one for linear systems with zonotopic constrained uncertainties, where the solution is given in a closed form, and the other for a class of nonlinear systems. Numerical simulations corroborate the effectiveness of our theoretical results.
- 12 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (5) , 3327-3334
Optimal Set-Membership Smoothing
This article studies the optimal set-membership smoothing (SMSing) problem for the system with bounded noises. By adopting the mathematical concept of uncertain variables, an optimal SMSing framework is established for the first time. This optimal framework reveals the principles of SMSing and the relationship between set-membership filtering and smoothing. Based on the design principles, we put forward two SMSing algorithms: one for linear systems with zonotopic constrained uncertainties, where the solution is given in a closed form, and the other for a class of nonlinear systems. Numerical simulations corroborate the effectiveness of our theoretical results.
- Open Access
Asymptotic Boundedness of Distributed Set-Membership Filtering
Asymptotic boundedness is a crucial property of Distributed Set-Membership Filtering (DSMFing) that prevents the unbounded growth of the set estimates caused by the wrapping effect. However, this important property remains underinvestigated, compared to its noise-free and stochastic-noise counterparts, i.e., the convergence of Distributed Observers (DOs) and the bounded error covariance of Distributed Kalman Filters (DKFs). This paper studies the asymptotic boundedness of DSMFing for linear discrete-time systems. A novel concept, termed the Collective Observation-Information Tower (COIT), is introduced to characterize the fundamental relationship between the structure of graphs and the set estimates, which enables the boundedness analysis. Leveraging the COIT, an easily verifiable sufficient condition for the asymptotic boundedness of linear DSMFing is established. Surprisingly, the sufficient condition generalizes the well-known collective detectability condition for DOs and DKFs; it links DSMFs to existing distributed estimation methods and reveals the unique characteristic of DSMFs.
Open AccessAsymptotic Boundedness of Distributed Set-Membership Filtering
Asymptotic boundedness is a crucial property of Distributed Set-Membership Filtering (DSMFing) that prevents the unbounded growth of the set estimates caused by the wrapping effect. However, this important property remains underinvestigated, compared to its noise-free and stochastic-noise counterparts, i.e., the convergence of Distributed Observers (DOs) and the bounded error covariance of Distributed Kalman Filters (DKFs). This paper studies the asymptotic boundedness of DSMFing for linear discrete-time systems. A novel concept, termed the Collective Observation-Information Tower (COIT), is introduced to characterize the fundamental relationship between the structure of graphs and the set estimates, which enables the boundedness analysis. Leveraging the COIT, an easily verifiable sufficient condition for the asymptotic boundedness of linear DSMFing is established. Surprisingly, the sufficient condition generalizes the well-known collective detectability condition for DOs and DKFs; it links DSMFs to existing distributed estimation methods and reveals the unique characteristic of DSMFs.
- Open Access
A Two-Layer Framework for Cooperative Standoff Tracking of a Ground Moving Target Using Dual UAVs
Standoff tracking of a ground-moving target with a single fixed-wing unmanned aerial vehicle (UAV) is vulnerable to occlusions around the target, such as buildings and terrain, which can obstruct the line of sight (LOS) between the UAV and the target, resulting in tracking failures. To address these challenges, multi-UAV cooperative tracking is often employed, offering multi-angle coverage and mitigating the limitations of a single UAV by maintaining continuous target visibility, even when one UAV’s LOS is obstructed. Building on this idea, we propose a specialized two-layer framework for dual-UAV cooperative target tracking. This framework comprises a decision-making layer and a guidance layer. The decision-making layer employs a state-transition-based distributed role transition algorithm for dual UAVs. Here, the UAVs periodically share state variables based on their target observability. In the guidance layer, we devise a velocity-vector-field-based controller to simplify the complexity of controller design for cooperative tracking. To validate the proposed framework, three numerical simulations and one hardware-in-the-loop (HIL) simulation were conducted. These simulations confirmed that the role transition algorithm functions properly even under occlusion conditions. Additionally, the standoff tracking guidance controller demonstrated superior performance compared to baseline methods in terms of tracking accuracy and stability.
Open AccessA Two-Layer Framework for Cooperative Standoff Tracking of a Ground Moving Target Using Dual UAVs
Standoff tracking of a ground-moving target with a single fixed-wing unmanned aerial vehicle (UAV) is vulnerable to occlusions around the target, such as buildings and terrain, which can obstruct the line of sight (LOS) between the UAV and the target, resulting in tracking failures. To address these challenges, multi-UAV cooperative tracking is often employed, offering multi-angle coverage and mitigating the limitations of a single UAV by maintaining continuous target visibility, even when one UAV’s LOS is obstructed. Building on this idea, we propose a specialized two-layer framework for dual-UAV cooperative target tracking. This framework comprises a decision-making layer and a guidance layer. The decision-making layer employs a state-transition-based distributed role transition algorithm for dual UAVs. Here, the UAVs periodically share state variables based on their target observability. In the guidance layer, we devise a velocity-vector-field-based controller to simplify the complexity of controller design for cooperative tracking. To validate the proposed framework, three numerical simulations and one hardware-in-the-loop (HIL) simulation were conducted. These simulations confirmed that the role transition algorithm functions properly even under occlusion conditions. Additionally, the standoff tracking guidance controller demonstrated superior performance compared to baseline methods in terms of tracking accuracy and stability.
- 24 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (10) , 6767-6782
Formation Under Communication Constraints: Control Performance Meets Channel Capacity
In wireless communication-based formation control systems, the control performance is significantly impacted by the channel capacity of each communication link between agents. This relationship, however, remains underinvestigated in the existing studies. To address this gap, the formation control problem of classical second-order multiagent systems with bounded process noises was considered taking into account the channel capacity. More specifically, the model of communication links between agents is first established, based on a new concept—guaranteed communication region, which characterizes all possible locations for successful message decoding in the presence of control-system uncertainty. Furthermore, we rigorously prove that the guaranteed communication region does not unboundedly increase with the transmission time, which indicates an important tradeoff between the guaranteed communication region and the data rate. The fundamental limits of data rate for any desired accuracy are also obtained. Finally, an integrated design to achieve the desired formation accuracy is proposed, where an estimation-based controller and transmit power control strategy are developed.
- 24 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (10) , 6767-6782
Formation Under Communication Constraints: Control Performance Meets Channel Capacity
In wireless communication-based formation control systems, the control performance is significantly impacted by the channel capacity of each communication link between agents. This relationship, however, remains underinvestigated in the existing studies. To address this gap, the formation control problem of classical second-order multiagent systems with bounded process noises was considered taking into account the channel capacity. More specifically, the model of communication links between agents is first established, based on a new concept—guaranteed communication region, which characterizes all possible locations for successful message decoding in the presence of control-system uncertainty. Furthermore, we rigorously prove that the guaranteed communication region does not unboundedly increase with the transmission time, which indicates an important tradeoff between the guaranteed communication region and the data rate. The fundamental limits of data rate for any desired accuracy are also obtained. Finally, an integrated design to achieve the desired formation accuracy is proposed, where an estimation-based controller and transmit power control strategy are developed.
- 9 February 2025
- Published by Springer Nature in The Visual Computer
- Vol. 41 (10) , 7109-7121
Epipolar constraint-guided differentiable keypoint detection and description
- 9 February 2025
- Published by Springer Nature in The Visual Computer
- Vol. 41 (10) , 7109-7121
Epipolar constraint-guided differentiable keypoint detection and description