Shuaiming Yan
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
Shuaiming Yan has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Lei Shi
Henan University
13 shared publications - Yi Zhou
Henan University
7 shared publications - Panpan Zhu
Henan University
6 shared publications - Zhuangzhuang Ma
Henan University
4 shared publications - Xuhui Bu
Henan Polytechnic University
3 shared publications - Weihao Li
University of Electronic Science and Technology of China
2 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (4) , 8239-8251
Data-Driven Safety-Critical Flocking Control for Multi-Agent Systems With Unknown Dynamics Under Uncertain Environments
The rapid development of consumer electronics, including consumer drones, smart home robots, and Internet of Things (IoT) sensor networks, has spurred the deployment of multi-agent systems (MASs) in increasingly complex and uncertain real-world environments. A critical challenge in these applications is to ensure safe and coordinated operation when the system dynamics are unavailable and the environmental conditions are unknown a priori. This paper proposes a data-driven learning control barrier function (DDLCBF) framework to address the safety-critical flocking control problem for MASs with unknown nonlinear dynamics operating in uncertain environments. First, a distributed flocking controller is constructed using pseudo partial derivatives (PPD) that relies exclusively on input-output (I/O) data, eliminating the requirement of an explicit system model. The controller is further extended to cooperative-competitive networks on signed directed graphs, where bipartite flocking convergence is guaranteed under a structural balance condition via gauge transformation. Second, a Gaussian process (GP) regression-based learning scheme is developed to approximate stochastic control barrier functions (CBFs) from real-time sensor measurements, thereby enabling probabilistic safety guarantees without prior environmental knowledge. Third, the DDLCBF scheme is formulated by integrating the PPD-based data model into the CBF constraints, yielding a quadratic programming (QP) controller that simultaneously ensures safety and low environmental uncertainty. Rigorous theoretical analyses are provided, including convergence guarantees for the PPD estimator and probabilistic safety bounds. The effectiveness and practicality of the proposed approach are validated through numerical simulations and physical experiments on an indoor multi-unmanned aerial vehicle (UAV) platform equipped with a motion capture system.
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 72 (4) , 8239-8251
Data-Driven Safety-Critical Flocking Control for Multi-Agent Systems With Unknown Dynamics Under Uncertain Environments
The rapid development of consumer electronics, including consumer drones, smart home robots, and Internet of Things (IoT) sensor networks, has spurred the deployment of multi-agent systems (MASs) in increasingly complex and uncertain real-world environments. A critical challenge in these applications is to ensure safe and coordinated operation when the system dynamics are unavailable and the environmental conditions are unknown a priori. This paper proposes a data-driven learning control barrier function (DDLCBF) framework to address the safety-critical flocking control problem for MASs with unknown nonlinear dynamics operating in uncertain environments. First, a distributed flocking controller is constructed using pseudo partial derivatives (PPD) that relies exclusively on input-output (I/O) data, eliminating the requirement of an explicit system model. The controller is further extended to cooperative-competitive networks on signed directed graphs, where bipartite flocking convergence is guaranteed under a structural balance condition via gauge transformation. Second, a Gaussian process (GP) regression-based learning scheme is developed to approximate stochastic control barrier functions (CBFs) from real-time sensor measurements, thereby enabling probabilistic safety guarantees without prior environmental knowledge. Third, the DDLCBF scheme is formulated by integrating the PPD-based data model into the CBF constraints, yielding a quadratic programming (QP) controller that simultaneously ensures safety and low environmental uncertainty. Rigorous theoretical analyses are provided, including convergence guarantees for the PPD estimator and probabilistic safety bounds. The effectiveness and practicality of the proposed approach are validated through numerical simulations and physical experiments on an indoor multi-unmanned aerial vehicle (UAV) platform equipped with a motion capture system.
- 20 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 10002-10013
Flocking Behavior for Multi-Agent Systems With Cooperation-Competition Evolution
In numerous applications of multi-agent systems (MASs), e.g., social networks and biological networks, the relationship between agents may shift from competition to cooperation or vice versa. With that in mind, this paper investigates flocking behavior of MASs with evolving cooperation-competition relationships. The relationship between neighboring agents is characterized by a state-dependent nonlinear function: competition is triggered when the state discrepancy between agents exceeds a predefined threshold, whereas cooperation is maintained otherwise. A complete analysis is conducted on flocking behavior using the infinite products of substochastic matrices. As algebraic conditions regarding agent states and cooperative ranges are established to ensure the emergence of flocking behavior, and a lower bound for the convergence rate of flocking behavior is established. Finally, the theoretical results are validated through numerical simulations and an indoor multi-UAV system platform.
- 20 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 10002-10013
Flocking Behavior for Multi-Agent Systems With Cooperation-Competition Evolution
In numerous applications of multi-agent systems (MASs), e.g., social networks and biological networks, the relationship between agents may shift from competition to cooperation or vice versa. With that in mind, this paper investigates flocking behavior of MASs with evolving cooperation-competition relationships. The relationship between neighboring agents is characterized by a state-dependent nonlinear function: competition is triggered when the state discrepancy between agents exceeds a predefined threshold, whereas cooperation is maintained otherwise. A complete analysis is conducted on flocking behavior using the infinite products of substochastic matrices. As algebraic conditions regarding agent states and cooperative ranges are established to ensure the emergence of flocking behavior, and a lower bound for the convergence rate of flocking behavior is established. Finally, the theoretical results are validated through numerical simulations and an indoor multi-UAV system platform.
- 5 January 2026
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 363 (2)
Multi-agent flocking with asynchronous cooperative-competitive interactions
- 5 January 2026
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 363 (2)
Multi-agent flocking with asynchronous cooperative-competitive interactions
- 30 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (24) , 53367-53377
Distributed Iterative Localization for Wireless Sensor Networks: A Barycentric Coordinates Approach With Angle Measurements
This article investigates the distributed localization problem in wireless sensor networks by adopting the barycentric coordinate method based on angle measurement. First, all sensor nodes are divided into two categories: anchor nodes with known locations and non-anchor nodes with unknown locations. On this basis, each non-anchor node calculates its barycentric coordinates relative to its neighbor nodes through angle measurement technology and constructs an iterative equation for location estimation based on the local information exchange mechanism. Subsequently, corresponding localization algorithms are designed for two typical network deployment scenarios: non-anchor nodes are distributed inside the convex hull of anchor nodes and randomly distributed outside the convex hull. By introducing the convergence analysis method of substochastic matrix multiplication, it is theoretically proved that the proposed distributed iterative localization algorithm can achieve progressive and precise localization of non-anchor nodes in both of the above two network deployment scenarios. Finally, the effectiveness of the proposed method is verified by numerical simulation experiments. The results show that the method can achieve high localization accuracy in both of the above two types of sensor network structures.
- 30 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (24) , 53367-53377
Distributed Iterative Localization for Wireless Sensor Networks: A Barycentric Coordinates Approach With Angle Measurements
This article investigates the distributed localization problem in wireless sensor networks by adopting the barycentric coordinate method based on angle measurement. First, all sensor nodes are divided into two categories: anchor nodes with known locations and non-anchor nodes with unknown locations. On this basis, each non-anchor node calculates its barycentric coordinates relative to its neighbor nodes through angle measurement technology and constructs an iterative equation for location estimation based on the local information exchange mechanism. Subsequently, corresponding localization algorithms are designed for two typical network deployment scenarios: non-anchor nodes are distributed inside the convex hull of anchor nodes and randomly distributed outside the convex hull. By introducing the convergence analysis method of substochastic matrix multiplication, it is theoretically proved that the proposed distributed iterative localization algorithm can achieve progressive and precise localization of non-anchor nodes in both of the above two network deployment scenarios. Finally, the effectiveness of the proposed method is verified by numerical simulation experiments. The results show that the method can achieve high localization accuracy in both of the above two types of sensor network structures.
- 22 September 2025
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 151
Data-driven flocking behavior of multi-agent systems under uncertain environments
- 22 September 2025
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 151
Data-driven flocking behavior of multi-agent systems under uncertain environments
- Top Cited Papers
- 15 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 55 (9) , 4347-4360
Multiagent Consensus Tracking Control Over Asynchronous Cooperation–Competition Networks
In nature, populations of organisms (e.g., wolves) exhibit a remarkable ability to coordinate their group actions, such as hunting prey or evading predators, despite the coexistence of cooperative and competitive interactions among individuals. Motivated by this intriguing phenomenon, this article investigates the cooperative consensus tracking control problem of multiagent systems (MASs) over cooperation–competition networks with asynchronous communications. That is, all followers can simultaneously achieve trajectory tracking of the leader agent, even if there exist competitive interactions between the followers and the leader. To portray the cooperation and competition level among agents, a new distance-based weight function is designed, which is more flexible than the fixed weight values in existing research works. Theoretically, the sufficient conditions for achieving consensus tracking control are obtained based on the convergence analysis method of infinite products of super-stochastic matrices. Finally, some numerical simulations are given to verify the effectiveness of the proposed consensus tracking control scheme.
- 15 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 55 (9) , 4347-4360
Top Cited PapersMultiagent Consensus Tracking Control Over Asynchronous Cooperation–Competition Networks
In nature, populations of organisms (e.g., wolves) exhibit a remarkable ability to coordinate their group actions, such as hunting prey or evading predators, despite the coexistence of cooperative and competitive interactions among individuals. Motivated by this intriguing phenomenon, this article investigates the cooperative consensus tracking control problem of multiagent systems (MASs) over cooperation–competition networks with asynchronous communications. That is, all followers can simultaneously achieve trajectory tracking of the leader agent, even if there exist competitive interactions between the followers and the leader. To portray the cooperation and competition level among agents, a new distance-based weight function is designed, which is more flexible than the fixed weight values in existing research works. Theoretically, the sufficient conditions for achieving consensus tracking control are obtained based on the convergence analysis method of infinite products of super-stochastic matrices. Finally, some numerical simulations are given to verify the effectiveness of the proposed consensus tracking control scheme.
- Top Cited Papers
- 22 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (7) , 4752-4761
Consensus and Products of Substochastic Matrices: Convergence Rate With Communication Delays
This study analyzes the convergence rate of leader-follower multiagent consensus under communication delays by developing a measure standard utilizing products of substochastic matrices. Through the construction of augmented auxiliary digraphs, which combine the binary relations composition, a comprehensive analysis of the leader-follower consensus dynamics is conducted. A mathematical representation of the least convergence rate of the system is established, which is closely related to the network structure, the upper bound of weight factors as well as the size of time delays. Moreover, an upper bound on the finite convergence time of the system with special topological structures, such as chain graph, star graph, and tree graph is given. At last, simulated examples are presented to confirm the theoretical findings.
- 22 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (7) , 4752-4761
Top Cited PapersConsensus and Products of Substochastic Matrices: Convergence Rate With Communication Delays
This study analyzes the convergence rate of leader-follower multiagent consensus under communication delays by developing a measure standard utilizing products of substochastic matrices. Through the construction of augmented auxiliary digraphs, which combine the binary relations composition, a comprehensive analysis of the leader-follower consensus dynamics is conducted. A mathematical representation of the least convergence rate of the system is established, which is closely related to the network structure, the upper bound of weight factors as well as the size of time delays. Moreover, an upper bound on the finite convergence time of the system with special topological structures, such as chain graph, star graph, and tree graph is given. At last, simulated examples are presented to confirm the theoretical findings.