Kunrui Ze
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kunrui Ze has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Wei Wang
Beihang University
4 shared publications - Guibin Sun
School of Automation Science and Electrical Engineering, Beihang University, Beijing, China
3 shared publications - Jinhu Lü
Beihang University
3 shared publications - Kexin Liu
Beihang University
3 shared publications - Shuoyu Yue
Cavendish Laboratory, University of Cambridge, Cambridge, U.K.
2 shared publications - Huazi Cao
Zhejiang University
1 shared publication
Latest Publications
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 73 (10) , 15073-15084
Inducing Dilemma via Deception Under Incomplete Maximum Speed Information in Reach-Avoid Games
In this article, we consider a zero-sum reach-avoid game where two attackers try to enter the target region while one defender seeks to protect the target by intercepting as many as attackers as possible. Unlike existing reach-avoid games that assume complete information, this article introduces information asymmetry where the attackers’ maximum speed is publicly known to fall within a specified continuous interval but remains concealed from the defender. To investigate whether the attackers can leverage their information advantages through deception to compensate for performance and positional disadvantages, a novel critical speed analysis framework is developed to address the challenge posed by the attackers’ infinite speed possibilities. This framework identifies the specific initial states where the defender faces an unavoidable dilemma and must make risky guesses. Specifically, it is demonstrated that by implementation of a slow-speed, information-limiting strategy, the attackers can mislead the defender into executing suboptimal strategy, consequently achieving superior outcomes compared with those attainable through maximum capability strategy under complete information conditions. The indoor real-time experiments are conducted to further validate the proposed critical speed framework.
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 73 (10) , 15073-15084
Inducing Dilemma via Deception Under Incomplete Maximum Speed Information in Reach-Avoid Games
In this article, we consider a zero-sum reach-avoid game where two attackers try to enter the target region while one defender seeks to protect the target by intercepting as many as attackers as possible. Unlike existing reach-avoid games that assume complete information, this article introduces information asymmetry where the attackers’ maximum speed is publicly known to fall within a specified continuous interval but remains concealed from the defender. To investigate whether the attackers can leverage their information advantages through deception to compensate for performance and positional disadvantages, a novel critical speed analysis framework is developed to address the challenge posed by the attackers’ infinite speed possibilities. This framework identifies the specific initial states where the defender faces an unavoidable dilemma and must make risky guesses. Specifically, it is demonstrated that by implementation of a slow-speed, information-limiting strategy, the attackers can mislead the defender into executing suboptimal strategy, consequently achieving superior outcomes compared with those attainable through maximum capability strategy under complete information conditions. The indoor real-time experiments are conducted to further validate the proposed critical speed framework.
- 12 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ASME Transactions on Mechatronics
- Vol. PP (10834435) , 1-12
Relative Pose Estimation for Nonholonomic Robot Formation With UWB-IO Measurements
This article studies the problem of distributed formation control for multiple robots by using onboard ultra wideband (UWB) distance and inertial odometer (IO) measurements. Although this problem has been widely studied, a fundamental limitation of most works is that they require each robot’s pose and sensor measurements are expressed in a common reference frame. However, it is inapplicable for nonholonomic robot formations due to the practical difficulty of aligning IO measurements of individual robot in a common frame. To address this problem, first, a concurrent-learning-based estimator is first proposed to achieve relative localization between neighboring robots in a local frame. Different from most relative localization methods in a global frame, both relative position and orientation in a local frame are estimated with only UWB ranging and IO measurements. Second, to deal with information loss caused by directed communication topology, a cooperative localization algorithm is introduced to estimate the relative pose to the leader robot. Third, based on the theoretical results on relative pose estimation, a distributed formation tracking controller is proposed for nonholonomic robots. Both 2-D and 3-D real-world experiments conducted on aerial robots and grounded robots are provided to demonstrate the effectiveness of the proposed method.
- 12 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ASME Transactions on Mechatronics
- Vol. PP (10834435) , 1-12
Relative Pose Estimation for Nonholonomic Robot Formation With UWB-IO Measurements
This article studies the problem of distributed formation control for multiple robots by using onboard ultra wideband (UWB) distance and inertial odometer (IO) measurements. Although this problem has been widely studied, a fundamental limitation of most works is that they require each robot’s pose and sensor measurements are expressed in a common reference frame. However, it is inapplicable for nonholonomic robot formations due to the practical difficulty of aligning IO measurements of individual robot in a common frame. To address this problem, first, a concurrent-learning-based estimator is first proposed to achieve relative localization between neighboring robots in a local frame. Different from most relative localization methods in a global frame, both relative position and orientation in a local frame are estimated with only UWB ranging and IO measurements. Second, to deal with information loss caused by directed communication topology, a cooperative localization algorithm is introduced to estimate the relative pose to the leader robot. Third, based on the theoretical results on relative pose estimation, a distributed formation tracking controller is proposed for nonholonomic robots. Both 2-D and 3-D real-world experiments conducted on aerial robots and grounded robots are provided to demonstrate the effectiveness of the proposed method.
- 9 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (4) , 5262-5269
Memory-Efficient 2D/3D Shape Assembly of Robot Swarms
Mean-shift-based approaches have recently emerged as a representative class of methods for robot swarm shape assembly. They rely on image-based target-shape representations to compute local density gradients and perform mean-shift exploration, which constitute their core mechanism. However, such representations incur substantial memory overhead, especially for high-resolution or 3D shapes. To address this limitation, we propose a memory-efficient tree representation that hierarchically encodes user-specified shapes in both 2D and 3D. Based on this representation, we design a behavior-based distributed controller for assignment-free shape assembly. Comparative 2D and 3D simulations against a state-of-the-art mean-shift algorithm show one to two orders of magnitude lower memory usage and two to four times faster shape entry. Physical experiments with 6 to 7 UAVs further validate real-world practicality.
- 9 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 11 (4) , 5262-5269
Memory-Efficient 2D/3D Shape Assembly of Robot Swarms
Mean-shift-based approaches have recently emerged as a representative class of methods for robot swarm shape assembly. They rely on image-based target-shape representations to compute local density gradients and perform mean-shift exploration, which constitute their core mechanism. However, such representations incur substantial memory overhead, especially for high-resolution or 3D shapes. To address this limitation, we propose a memory-efficient tree representation that hierarchically encodes user-specified shapes in both 2D and 3D. Based on this representation, we design a behavior-based distributed controller for assignment-free shape assembly. Comparative 2D and 3D simulations against a state-of-the-art mean-shift algorithm show one to two orders of magnitude lower memory usage and two to four times faster shape entry. Physical experiments with 6 to 7 UAVs further validate real-world practicality.
- 23 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 11188-11204
Concurrent-Learning Based Relative Localization in Shape Formation of Robot Swarms
In this article, we address the shape formation problem for massive robot swarms in environments where external localization systems are unavailable. Achieving this task effectively with solely onboard measurements is still scarcely explored and faces some practical challenges. To solve this challenging problem, we propose the following novel results. Firstly, to estimate the relative positions among neighboring robots, a concurrent-learning based estimator is proposed. It relaxes the persistent excitation condition required in the classical ones such as the least-square estimator. Secondly, we introduce a finite-time agreement protocol to determine the shape location. This is achieved by estimating the relative position between each robot and a randomly assigned seed robot. The initial position of the seed one marks the shape location. Thirdly, based on the theoretical results of the relative localization, a novel behavior-based control strategy is devised. This strategy not only enables the adaptive shape formation of large groups of robots but also enhances the observability of inter-robot relative localization. Numerical simulation results are provided to verify the performance of our proposed strategy compared to the state-of-the-art ones. Additionally, outdoor experiments on real robots further demonstrate the practical effectiveness and robustness of our methods.
- 23 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 11188-11204
Concurrent-Learning Based Relative Localization in Shape Formation of Robot Swarms
In this article, we address the shape formation problem for massive robot swarms in environments where external localization systems are unavailable. Achieving this task effectively with solely onboard measurements is still scarcely explored and faces some practical challenges. To solve this challenging problem, we propose the following novel results. Firstly, to estimate the relative positions among neighboring robots, a concurrent-learning based estimator is proposed. It relaxes the persistent excitation condition required in the classical ones such as the least-square estimator. Secondly, we introduce a finite-time agreement protocol to determine the shape location. This is achieved by estimating the relative position between each robot and a randomly assigned seed robot. The initial position of the seed one marks the shape location. Thirdly, based on the theoretical results of the relative localization, a novel behavior-based control strategy is devised. This strategy not only enables the adaptive shape formation of large groups of robots but also enhances the observability of inter-robot relative localization. Numerical simulation results are provided to verify the performance of our proposed strategy compared to the state-of-the-art ones. Additionally, outdoor experiments on real robots further demonstrate the practical effectiveness and robustness of our methods.
- 8 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 71 (9) , 11305-11315
Time-Varying Formation Planning and Distributed Control for Multiple UAVs in Clutter Environment
In this article, we present a novel method to achieve optimization based obstacle avoidance and distributed regular polygon time-varying formation control for multiple unmanned aerial vehicle systems (UAVs) in clutter environment. Under a leader-following structure, directed communication graph is considered. The formation size is time-varying and the trajectory of the leader UAV is planned in real time. Different from most of the existing trajectory planning algorithms for single UAV, an optimization-based safe trajectory and formation size online planning algorithm are proposed. To deal with information loss caused by directed communication topology, distributed smooth adaptive filters are designed for each UAV to asymptotically estimate the safe trajectory and formation size. Besides, a geometric tracking controller is adopted to track the desired trajectory for each UAV. Experimental results are provided to demonstrate the effectiveness of the proposed method.
- 8 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 71 (9) , 11305-11315
Time-Varying Formation Planning and Distributed Control for Multiple UAVs in Clutter Environment
In this article, we present a novel method to achieve optimization based obstacle avoidance and distributed regular polygon time-varying formation control for multiple unmanned aerial vehicle systems (UAVs) in clutter environment. Under a leader-following structure, directed communication graph is considered. The formation size is time-varying and the trajectory of the leader UAV is planned in real time. Different from most of the existing trajectory planning algorithms for single UAV, an optimization-based safe trajectory and formation size online planning algorithm are proposed. To deal with information loss caused by directed communication topology, distributed smooth adaptive filters are designed for each UAV to asymptotically estimate the safe trajectory and formation size. Besides, a geometric tracking controller is adopted to track the desired trajectory for each UAV. Experimental results are provided to demonstrate the effectiveness of the proposed method.