Shuai Zhang
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
Shuai Zhang has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
Yunke Huang
7 shared publicationsXiaokang Lei
College of Information and Control Engineering, Xi’an University of Architecture and Technology, Xi’an, China
6 shared publications- Jia Pan
The University of Hong Kong
4 shared publications Mingyong Liu
School of Marine Science and Technology, Northwestern Polytechnical University, Xi’an, People’s Republic of China
4 shared publications- Yunke Huang
Department of Building Environment and Energy Engineering, The Hong Kong Polytechnic University 2 , Hong Kong
4 shared publications - Xiaokang Lei
College of Information and Control Engineering, Xi’an University of Architecture and Technology, Xi’an 710311, China
3 shared publications
Latest Publications
- 13 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 10 (8) , 7851-7858
Swarm Navigation Based on Smoothed Particle Hydrodynamics in Complex Obstacle Environments
In this letter, we propose a method for the navigation of swarm unmanned aerial vehicles (UAVs) in complex environments with obstacles. We propose an algorithmic framework based on Smoothed Particle Hydrodynamics (SPH). In this framework, each UAV is considered a particle, computing its motion information through local interactions with surrounding particles. Based on SPH, the UAV swarm can interactively adjust itself, allowing the entire cluster to advance in the flow pattern of an incompressible fluid. We introduce the Euclidean Signed Distance Field (ESDF) as a representation of the environment. The ESDF is constructed based on the obstacle information in the environment, enabling the swarm to deform and avoid obstacles within the environment. Simultaneously, we propose a swarm navigation function based on B-splines, rapidly obtaining executable trajectories by solving an unconstrained gradient optimization problem. Compared with existing methods, our algorithm exhibits significant improvements in success rate, stability, and scalability. Extensive simulations and physical experiments in both 2D and 3D environments have demonstrated the effectiveness of the proposed method. More elements can be referenced on our GitHub:https://github.com/SmartGroupSystems/SPH-planning.
- 13 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 10 (8) , 7851-7858
Swarm Navigation Based on Smoothed Particle Hydrodynamics in Complex Obstacle Environments
In this letter, we propose a method for the navigation of swarm unmanned aerial vehicles (UAVs) in complex environments with obstacles. We propose an algorithmic framework based on Smoothed Particle Hydrodynamics (SPH). In this framework, each UAV is considered a particle, computing its motion information through local interactions with surrounding particles. Based on SPH, the UAV swarm can interactively adjust itself, allowing the entire cluster to advance in the flow pattern of an incompressible fluid. We introduce the Euclidean Signed Distance Field (ESDF) as a representation of the environment. The ESDF is constructed based on the obstacle information in the environment, enabling the swarm to deform and avoid obstacles within the environment. Simultaneously, we propose a swarm navigation function based on B-splines, rapidly obtaining executable trajectories by solving an unconstrained gradient optimization problem. Compared with existing methods, our algorithm exhibits significant improvements in success rate, stability, and scalability. Extensive simulations and physical experiments in both 2D and 3D environments have demonstrated the effectiveness of the proposed method. More elements can be referenced on our GitHub:https://github.com/SmartGroupSystems/SPH-planning.
- 8 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 10596-10608
Swarm Robotic Flocking With Aggregation Ability Privacy
We address the challenge of achieving flocking behavior in swarm robotic systems without compromising the privacy of individual robots’ aggregation capabilities. Traditional flocking algorithms are susceptible to privacy breaches, as adversaries can deduce the identity and aggregation abilities of robots by observing their movements. We introduce a novel control mechanism for privacy-preserving flocking, leveraging the Laplace mechanism within the framework of differential privacy. Our method mitigates privacy breaches by introducing a controlled level of noise, thus obscuring sensitive information. We explore the trade-off between privacy and utility by varying the differential privacy parameter $\epsilon$ . Our quantitative analysis reveals that $\epsilon \leq 0.13$ represents a lower threshold where private information is almost completely protected, whereas $\epsilon \geq 0.85$ marks an upper threshold where private information cannot be protected at all. Empirical results validate that our approach effectively maintains privacy of the robots’ aggregation abilities throughout the flocking process. Note to Practitioners —This paper was motivated by the problem of preserving privacy of individual robots in a swarm robotic system. Existing approaches to address this issue generally consider that accomplishing complex tasks requiring explicit information sharing between robots, while explicit communication in public channel carries the risk of information leakage. It is not always like this in real adversarial environments, and this assumption restricts the investigation of privacy in autonomous systems. This paper suggests that an individual robot can use its sensors onboard to perceive states of other neighbors in a distributed way without explicit communication. Despite avoiding information leakage during explicit information sharing between robots, the configuration of swarm can still reveal sensitive information about the ability of each robot. In this paper, we propose a privacy-preserving approach for flocking control using the Laplace mechanism based on the concept of differential privacy. The solution prevents an adversary with full knowledge of the swarm’s configuration from learning the sensitive information of individual robots, thus ensuring the security of swarm robots in terms of sensitive information during ongoing missions.
- 8 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 10596-10608
Swarm Robotic Flocking With Aggregation Ability Privacy
We address the challenge of achieving flocking behavior in swarm robotic systems without compromising the privacy of individual robots’ aggregation capabilities. Traditional flocking algorithms are susceptible to privacy breaches, as adversaries can deduce the identity and aggregation abilities of robots by observing their movements. We introduce a novel control mechanism for privacy-preserving flocking, leveraging the Laplace mechanism within the framework of differential privacy. Our method mitigates privacy breaches by introducing a controlled level of noise, thus obscuring sensitive information. We explore the trade-off between privacy and utility by varying the differential privacy parameter $\epsilon$ . Our quantitative analysis reveals that $\epsilon \leq 0.13$ represents a lower threshold where private information is almost completely protected, whereas $\epsilon \geq 0.85$ marks an upper threshold where private information cannot be protected at all. Empirical results validate that our approach effectively maintains privacy of the robots’ aggregation abilities throughout the flocking process. Note to Practitioners —This paper was motivated by the problem of preserving privacy of individual robots in a swarm robotic system. Existing approaches to address this issue generally consider that accomplishing complex tasks requiring explicit information sharing between robots, while explicit communication in public channel carries the risk of information leakage. It is not always like this in real adversarial environments, and this assumption restricts the investigation of privacy in autonomous systems. This paper suggests that an individual robot can use its sensors onboard to perceive states of other neighbors in a distributed way without explicit communication. Despite avoiding information leakage during explicit information sharing between robots, the configuration of swarm can still reveal sensitive information about the ability of each robot. In this paper, we propose a privacy-preserving approach for flocking control using the Laplace mechanism based on the concept of differential privacy. The solution prevents an adversary with full knowledge of the swarm’s configuration from learning the sensitive information of individual robots, thus ensuring the security of swarm robots in terms of sensitive information during ongoing missions.
- 22 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 40 (15523098) , 2729-2748
Heterogeneous Targets Trapping With Swarm Robots by Using Adaptive Density-Based Interaction
Homogeneous swarm robots are of significant research interest due to their robustness, flexibility, and scalability in completing complex tasks across various applications. This paper focuses on trapping heterogeneous targets using swarm robots, with emphasis on their different strengths. These targets consist of weak, strong, and group-moving individuals, where stronger targets exhibit larger body size, higher physical strength, and stronger resistance ability. Our goal is to develop an adaptive controller that enables swarm robots to self-organize and distribute themselves to trap targets, while adjusting encirclement thickness and robot group size based on target strength. We leverage local implicit information generated from density-based interaction to improve inter-robot and robot-target interactions through adaptive allocation and transformation mechanisms. The feasibility of our approach is validated through numerical simulations and experiments involving up to 50 physical robots and one human-controlled transformer.
- 22 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 40 (15523098) , 2729-2748
Heterogeneous Targets Trapping With Swarm Robots by Using Adaptive Density-Based Interaction
Homogeneous swarm robots are of significant research interest due to their robustness, flexibility, and scalability in completing complex tasks across various applications. This paper focuses on trapping heterogeneous targets using swarm robots, with emphasis on their different strengths. These targets consist of weak, strong, and group-moving individuals, where stronger targets exhibit larger body size, higher physical strength, and stronger resistance ability. Our goal is to develop an adaptive controller that enables swarm robots to self-organize and distribute themselves to trap targets, while adjusting encirclement thickness and robot group size based on target strength. We leverage local implicit information generated from density-based interaction to improve inter-robot and robot-target interactions through adaptive allocation and transformation mechanisms. The feasibility of our approach is validated through numerical simulations and experiments involving up to 50 physical robots and one human-controlled transformer.
- 20 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 9 (5) , 4313-4320
Cooperative Object Transport by Two Robots Connected With a Ball-String-Ball Structure
One hot-researched application of multi-robot systems is cooperative object transport, a task in which multiple robots collaboratively move an object that is too larger, bulky or heavy for a single robot. In this letter, we address this problem using the combination of ball-string-ball structure and multi-robot systems, which contributes insight into potential benefits of multi-robot systems working with tools. Compared with state-of-the-art multi-robot object transport approaches, the novelty of our method lies on that the object to be transported is moved by the passive movement of the ball-string-ball structure, rather than mobile robots. We conducted theoretical analysis about the boundary conditions of the transport system and demonstrated the performance of our method by simulations. The results show that our method is scalable with respect to the shapes and sizes of objects, as well as the group size of object cluster.
- 20 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 9 (5) , 4313-4320
Cooperative Object Transport by Two Robots Connected With a Ball-String-Ball Structure
One hot-researched application of multi-robot systems is cooperative object transport, a task in which multiple robots collaboratively move an object that is too larger, bulky or heavy for a single robot. In this letter, we address this problem using the combination of ball-string-ball structure and multi-robot systems, which contributes insight into potential benefits of multi-robot systems working with tools. Compared with state-of-the-art multi-robot object transport approaches, the novelty of our method lies on that the object to be transported is moved by the passive movement of the ball-string-ball structure, rather than mobile robots. We conducted theoretical analysis about the boundary conditions of the transport system and demonstrated the performance of our method by simulations. The results show that our method is scalable with respect to the shapes and sizes of objects, as well as the group size of object cluster.
- 29 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 40 (15523098) , 1706-1723
A Distributed Outmost Push Approach for Multirobot Herding
This article presents a distributed control strategy for herding groups of evaders towards a predefined goal region using a team of robotic herders. In herding problems, evaders tend to move away from each other to increase their coverage regions. This makes it challenging to develop control solutions since the wandering evaders need to be collected while driving the herd. To address this, we propose the distributed outmost push strategy, where each robotic herder pushes the evader that is farthest from the goal region. The intuition behind this strategy is that robotic herders should focus on evaders that are further from the goal region as they are more likely to be missed during the herding process. The outmost evaders are selected from the local field of view, and the robotic herders make decisions in a decentralized manner. We also analyze the convergence of the designed dynamics and the minimum sensing range required for herders. The proposal's effectiveness and generality are validated through numerical simulations and real robotic experiments.
- 29 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 40 (15523098) , 1706-1723
A Distributed Outmost Push Approach for Multirobot Herding
This article presents a distributed control strategy for herding groups of evaders towards a predefined goal region using a team of robotic herders. In herding problems, evaders tend to move away from each other to increase their coverage regions. This makes it challenging to develop control solutions since the wandering evaders need to be collected while driving the herd. To address this, we propose the distributed outmost push strategy, where each robotic herder pushes the evader that is farthest from the goal region. The intuition behind this strategy is that robotic herders should focus on evaders that are further from the goal region as they are more likely to be missed during the herding process. The outmost evaders are selected from the local field of view, and the robotic herders make decisions in a decentralized manner. We also analyze the convergence of the designed dynamics and the minimum sensing range required for herders. The proposal's effectiveness and generality are validated through numerical simulations and real robotic experiments.
- Open Access
- 8 March 2023
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 9 (5) , 5135-5155
Self-organized multi-target trapping of swarm robots with density-based interaction
The task of multi-target trapping in swarm robots can often be solved by global shape planning and target assignment, but it still remains a challenge to achieve fully self-organized multi-target trapping behavior based on local information. In this paper, inspired by the concept of spatial density in physics and biology, we proposed a novel density-based method to enable the swarm robots to entrap multiple targets with either single-ring, multi-ring or multi-subgroup formation in a distributed and self-organized way while neither communication among robots nor encirclement function is required. Each robot’s local spatial density is considered as the main clue for the individual’s motion decision-making and the enclosed configurations emerge from such individual-level interactions rather than being explicitly designed. Numerical simulations and real robotic experiments are conducted to validate the effectiveness of the proposed method. The results show that the proposed self-organized trapping method allows a swarm of robots to entrap multiple moving targets in a stable, flexible, noise-tolerate and size-scalable fashion.
- 8 March 2023
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 9 (5) , 5135-5155
Open AccessSelf-organized multi-target trapping of swarm robots with density-based interaction
The task of multi-target trapping in swarm robots can often be solved by global shape planning and target assignment, but it still remains a challenge to achieve fully self-organized multi-target trapping behavior based on local information. In this paper, inspired by the concept of spatial density in physics and biology, we proposed a novel density-based method to enable the swarm robots to entrap multiple targets with either single-ring, multi-ring or multi-subgroup formation in a distributed and self-organized way while neither communication among robots nor encirclement function is required. Each robot’s local spatial density is considered as the main clue for the individual’s motion decision-making and the enclosed configurations emerge from such individual-level interactions rather than being explicitly designed. Numerical simulations and real robotic experiments are conducted to validate the effectiveness of the proposed method. The results show that the proposed self-organized trapping method allows a swarm of robots to entrap multiple moving targets in a stable, flexible, noise-tolerate and size-scalable fashion.
- 15 June 2022
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 603
Collective fission behavior in swarming systems with density-based interaction
- 15 June 2022
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 603
Collective fission behavior in swarming systems with density-based interaction
- 26 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 7 (3) , 6974-6981
Collecting a Flock With Multiple Sub-Groups by Using Multi-Robot System
In this letter, we present a distributed approach to automatically collect a flock with a group of robots. This collecting problem is challenging due to the fact that the flock size is usually much greater than that of robots, meanwhile the local sensing range of robots may not ensure a globally successful collecting. Existing literature for collecting flocks assume that the flocks are coherent, however, this limits the practicality of these approaches especially in the case where there are multiple sub-groups. To address these issues, we relax the assumption and propose a density-based strategy, which can drive the robots to move towards the edge of the flock in an edge-following behavior and ultimately encircle the flock. Once encircled, a shrink mechanism is used for squeezing the flock into a tight cluster. Collecting a single cluster and collecting a flock with multiple sub-groups can be achieved by using such edge-following behavior in combination with shrink mechanism. The lower bound on the minimum number of robots required for successfully collecting a given flock size is also theoretically investigated. We validate the performance of our approach via numerical simulations and the number of robots required for a successful collecting operation is validated by using statistical simulation results for a range of flock sizes.
- 26 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 7 (3) , 6974-6981
Collecting a Flock With Multiple Sub-Groups by Using Multi-Robot System
In this letter, we present a distributed approach to automatically collect a flock with a group of robots. This collecting problem is challenging due to the fact that the flock size is usually much greater than that of robots, meanwhile the local sensing range of robots may not ensure a globally successful collecting. Existing literature for collecting flocks assume that the flocks are coherent, however, this limits the practicality of these approaches especially in the case where there are multiple sub-groups. To address these issues, we relax the assumption and propose a density-based strategy, which can drive the robots to move towards the edge of the flock in an edge-following behavior and ultimately encircle the flock. Once encircled, a shrink mechanism is used for squeezing the flock into a tight cluster. Collecting a single cluster and collecting a flock with multiple sub-groups can be achieved by using such edge-following behavior in combination with shrink mechanism. The lower bound on the minimum number of robots required for successfully collecting a given flock size is also theoretically investigated. We validate the performance of our approach via numerical simulations and the number of robots required for a successful collecting operation is validated by using statistical simulation results for a range of flock sizes.
- 1 October 2020
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 382
Frequency-dependent strategy selection in a hunting game with a finite population
- 1 October 2020
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 382
Frequency-dependent strategy selection in a hunting game with a finite population
- 15 September 2020
- Published by Springer Nature in Autonomous Robots
- Vol. 45 (1) , 15-30
Synchronous intercept strategies for a robotic defense-intrusion game with two defenders
- 15 September 2020
- Published by Springer Nature in Autonomous Robots
- Vol. 45 (1) , 15-30
Synchronous intercept strategies for a robotic defense-intrusion game with two defenders