Panpan Zhu
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
Panpan Zhu has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Lei Shi
Henan University
11 shared publications - Xuhui Bu
Henan Polytechnic University
10 shared publications - Shangtai Jin
Beijing Jiaotong University
6 shared publications - Shuaiming Yan
Henan University
6 shared publications - Yi Zhou
Henan University
6 shared publications - Zhongsheng Hou
Qingdao University
6 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.
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (10) , 9606-9617
Resilient Formation Containment for Multi-UAV Systems With Hybrid Safety Constraints and Prescribed-Time Recovery
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (10) , 9606-9617
Resilient Formation Containment for Multi-UAV Systems With Hybrid Safety Constraints and Prescribed-Time Recovery
- 29 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 9880-9894
Multi-Agent Path Planning in Complex Multi-Obstacle Environment: A Reinforcement Learning-Based Formation Containment Method
This paper addresses the multi-agent path planning (MAPP) problem for heterogeneous systems where only a subset of agents, termed leaders, can perceive obstacles. A novel hierarchical framework is proposed, which decouples high-level path planning from low-level path execution. At the high level, a Multi-Agent Soft Actor-Critic (MASAC) algorithm trains the leaders to collectively navigate and dynamically shape an obstacle-free “safe mobile corridor”. At the low level, a distributed consensus-based controller guides the sensor-less followers to remain within this moving corridor, effectively tracking the path planned by the leaders. This architecture significantly enhances sample efficiency and scalability while naturally supporting low-cost, heterogeneous agents. The efficacy of the proposed method is validated through numerical simulations and experiments on a physical multi-UAV platform.
- 29 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 9880-9894
Multi-Agent Path Planning in Complex Multi-Obstacle Environment: A Reinforcement Learning-Based Formation Containment Method
This paper addresses the multi-agent path planning (MAPP) problem for heterogeneous systems where only a subset of agents, termed leaders, can perceive obstacles. A novel hierarchical framework is proposed, which decouples high-level path planning from low-level path execution. At the high level, a Multi-Agent Soft Actor-Critic (MASAC) algorithm trains the leaders to collectively navigate and dynamically shape an obstacle-free “safe mobile corridor”. At the low level, a distributed consensus-based controller guides the sensor-less followers to remain within this moving corridor, effectively tracking the path planned by the leaders. This architecture significantly enhances sample efficiency and scalability while naturally supporting low-cost, heterogeneous agents. The efficacy of the proposed method is validated through numerical simulations and experiments on a physical multi-UAV 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
- 2 September 2025
- Published by Elsevier in Neurocomputing
- Vol. 655
Multi-dimensional opinion dynamics for social networks with asynchronous updates
- 2 September 2025
- Published by Elsevier in Neurocomputing
- Vol. 655
Multi-dimensional opinion dynamics for social networks with asynchronous updates