Jiayu Zou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jiayu Zou has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Hai-Tao Zhang
Huazhong University of Science and Technology
8 shared publications - Ran Shi
Huazhong University of Science and Technology
3 shared publications - Xingjian Liu
School of Artificial Intelligence and Automation, the MOE Engineering Research Center of Autonomous Intelligent Unmanned Systems, the Guangdong Engineering Technology Research Center of Fully Autonomous unmanned Surface Vehicles, and the State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan, China
3 shared publications - Bin Liu
Dongguan University of Technology
2 shared publications - Jialuo Li
Huazhong University of Science and Technology
2 shared publications - Ning Xing
School of Artificial Intelligence and Automation, Institute of Artificial Intelligence, Engineering Research Center of Autonomous Intelligent Unmanned Systems, and State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan, China
2 shared publications
Latest Publications
- Open Access
- 14 May 2026
- Published by World Scientific Pub Co Pte Ltd in Guidance, Navigation and Control
- p. 1-9
Adaptive Prescribed-Time Trajectory Tracking Control for Manipulator Systems
This paper investigates the prescribed-time trajectory tracking control problem for manipulator systems subject to actuator saturation. To tackle this issue, a bounded time-varying gain function is designed. With its assistance, an adaptive sliding mode control (SMC) strategy is proposed to ensure that the tracking error converges to zero within the prescribed time. Furthermore, a saturation compensation mechanism is developed to handle the actuator saturation. To ensure the feasibility of the present method, sufficient conditions are derived through theoretical analysis to guarantee the prescribed time stability (PTS) of the manipulator system. Finally, numerical simulations are conducted to verify the effectiveness and and superiority of the present control method.
- 14 May 2026
- Published by World Scientific Pub Co Pte Ltd in Guidance, Navigation and Control
- p. 1-9
Open AccessAdaptive Prescribed-Time Trajectory Tracking Control for Manipulator Systems
This paper investigates the prescribed-time trajectory tracking control problem for manipulator systems subject to actuator saturation. To tackle this issue, a bounded time-varying gain function is designed. With its assistance, an adaptive sliding mode control (SMC) strategy is proposed to ensure that the tracking error converges to zero within the prescribed time. Furthermore, a saturation compensation mechanism is developed to handle the actuator saturation. To ensure the feasibility of the present method, sufficient conditions are derived through theoretical analysis to guarantee the prescribed time stability (PTS) of the manipulator system. Finally, numerical simulations are conducted to verify the effectiveness and and superiority of the present control method.
- 2 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 73 (6) , 8804-8814
LiDAR-Inertial SLAM With Voxel-Information Filter for Autonomous Surface Vehicles
Due to the high cost and limited onboard computational capabilities, real-time simultaneous localization and mapping (SLAM) for autonomous surface vehicles (ASVs) in complex water environments has long been a technology challenge. To address this issue, a tightly coupled voxel-informed gradient Anderson light detection and ranging (LiDAR)-inertial odometry is designed to facilitate high efficient ASV SLAM. Therein, a manifold-constrained iterative information filtering optimization scheme is devised with adaptive outlier rejection design. To enhance ASV SLAM efficiency, a voxel-based acceleration mechanism featuring voxel search pruning and Anderson extrapolation is proposed. Finally, extensive experiments are conducted on a self-established ASV platform to verify the effectiveness of our SLAM scheme.
- 2 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 73 (6) , 8804-8814
LiDAR-Inertial SLAM With Voxel-Information Filter for Autonomous Surface Vehicles
Due to the high cost and limited onboard computational capabilities, real-time simultaneous localization and mapping (SLAM) for autonomous surface vehicles (ASVs) in complex water environments has long been a technology challenge. To address this issue, a tightly coupled voxel-informed gradient Anderson light detection and ranging (LiDAR)-inertial odometry is designed to facilitate high efficient ASV SLAM. Therein, a manifold-constrained iterative information filtering optimization scheme is devised with adaptive outlier rejection design. To enhance ASV SLAM efficiency, a voxel-based acceleration mechanism featuring voxel search pruning and Anderson extrapolation is proposed. Finally, extensive experiments are conducted on a self-established ASV platform to verify the effectiveness of our SLAM scheme.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (10) , 1-11
Adaptive Prescribed-Time ASV Tracking Control
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (10) , 1-11
Adaptive Prescribed-Time ASV Tracking Control
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (3) , 2402-2411
Nash-Minmax Capturing Strategy for Multiagent Pursuit-Evasion Differential Games Under Directed Graphs
In this article, a heterogeneous multiagent pursuit-evasion (MPE) differential gaming problem is addressed. Therein, the pursuers aim to cooperatively capture the sole escaping evader. The theoretical analytical challenge lies in designing the Nash-minmax gaming strategy for such MPE games under directed graphs with external disturbances. Intra-alliance cooperation (pursuers and their peer neighbors) is regarded as a nonzero-sum game, while interalliance confrontation (multiple pursuers versus one evader) is treated as another zero-sum game. To tackle this issue, a hierarchical gaming framework is established to solve the associated coupled Hamilton-Jacobi-Isaacs (HJI) equation and accordingly derive the associated distributed gaming protocol. Finally, both numerical simulations and lake-based multi-autonomous surface vehicle (ASV) gaming experiments are conducted to verify the effectiveness of the present MPE gaming strategy.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (3) , 2402-2411
Nash-Minmax Capturing Strategy for Multiagent Pursuit-Evasion Differential Games Under Directed Graphs
In this article, a heterogeneous multiagent pursuit-evasion (MPE) differential gaming problem is addressed. Therein, the pursuers aim to cooperatively capture the sole escaping evader. The theoretical analytical challenge lies in designing the Nash-minmax gaming strategy for such MPE games under directed graphs with external disturbances. Intra-alliance cooperation (pursuers and their peer neighbors) is regarded as a nonzero-sum game, while interalliance confrontation (multiple pursuers versus one evader) is treated as another zero-sum game. To tackle this issue, a hierarchical gaming framework is established to solve the associated coupled Hamilton-Jacobi-Isaacs (HJI) equation and accordingly derive the associated distributed gaming protocol. Finally, both numerical simulations and lake-based multi-autonomous surface vehicle (ASV) gaming experiments are conducted to verify the effectiveness of the present MPE gaming strategy.
- 29 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 13 (1) , 545-553
Hearing Network Sizes
In this paper, a distributed algorithm is proposed to identify the sizes of abundant networked systems. Significantly, the present distributed method works merely via exchanging scalar information by pairwise interactions. By generating a sinusoidal signal with a randomized frequency at each node, the network size can be individually calculated by each node merely according to the frequency decomposition of the locally accessible time series. Accordingly, a prescribed-time distributed average tracking (PT-DAT) protocol is developed for information aggregation and Fast Fourier Transform (FFT) is introduced for each node's frequency extraction. The virtue of the present design lies in eliminating the leader-follower structures required by most of the existing literatures. Moreover, it works for dynamic networks with arbitrary initial conditions. Sufficient conditions are derived for the present PT-DAT protocol to theoretically guarantee the prescribed-time convergence of the present algorithm. Finally, numerical simulations are conducted to substantiate the effectiveness of the present algorithm.
- 29 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 13 (1) , 545-553
Hearing Network Sizes
In this paper, a distributed algorithm is proposed to identify the sizes of abundant networked systems. Significantly, the present distributed method works merely via exchanging scalar information by pairwise interactions. By generating a sinusoidal signal with a randomized frequency at each node, the network size can be individually calculated by each node merely according to the frequency decomposition of the locally accessible time series. Accordingly, a prescribed-time distributed average tracking (PT-DAT) protocol is developed for information aggregation and Fast Fourier Transform (FFT) is introduced for each node's frequency extraction. The virtue of the present design lies in eliminating the leader-follower structures required by most of the existing literatures. Moreover, it works for dynamic networks with arbitrary initial conditions. Sufficient conditions are derived for the present PT-DAT protocol to theoretically guarantee the prescribed-time convergence of the present algorithm. Finally, numerical simulations are conducted to substantiate the effectiveness of the present algorithm.
- 7 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (2) , 1531-1539
Distributed Identification for Node and Edge Numbers of Time-Varying Anonymous Networks
In this paper, a distributed algorithm is proposed to identify the node and edge numbers of anonymous leader-follower networks. The present distributed method works merely by exchanging scalar information by local intercommunication. The merit of the algorithm lies in identifying the required network parameters in time-varying topological networks without special initialization. Sufficient conditions are derived for cascading systems to theoretically guarantee the exponential convergence of the individual estimation to the total number of nodes or edges merely by local information exchanging. Finally, numerical simulations are conducted to substantiate the effectiveness of the present identification algorithm.
- 7 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (2) , 1531-1539
Distributed Identification for Node and Edge Numbers of Time-Varying Anonymous Networks
In this paper, a distributed algorithm is proposed to identify the node and edge numbers of anonymous leader-follower networks. The present distributed method works merely by exchanging scalar information by local intercommunication. The merit of the algorithm lies in identifying the required network parameters in time-varying topological networks without special initialization. Sufficient conditions are derived for cascading systems to theoretically guarantee the exponential convergence of the individual estimation to the total number of nodes or edges merely by local information exchanging. Finally, numerical simulations are conducted to substantiate the effectiveness of the present identification algorithm.
- 6 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (2) , 1512-1520
Cooperative Hierarchical Coverage Control of Multiagent Systems With Nonholonomic Constraints in Poriferous Environments
It has long posed a challenging task to optimally deploy multi-agent systems (MASs) to cooperatively coverage poriferous environments in real cooperative detection applications. In response to this challenge, this paper proposes a hierarchical coverage control (HCC) protocol for MASs to perform sector-based coverage operations. First, a distributed Voronoi partition-based sweep-and-assign protocol, combined with a sectorial partition method, is developed, enabling the segmentation of a whole poriferous region into multiple sectorial sub-subregions. Following this procedure, an extreme search scheme is developed to determine the optimal amount of agents for each subregion. After this allocation, a distributed controller is proposed to deploy the agents, considering non-holonomic constraints, into designated niche positions. Additionally, sufficient conditions are derived to guarantee the asymptotical stability of the present HCC. The analytical challenge of the present study stems from the non-convex characteristics inherent in the loss function induced by porous environments. This non-convexity renders the task of globally optimizing the assignment of MASs intractable. Finally, numerical simulations are conducted to validate the effectiveness of the present coverage control approach.
- 6 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (2) , 1512-1520
Cooperative Hierarchical Coverage Control of Multiagent Systems With Nonholonomic Constraints in Poriferous Environments
It has long posed a challenging task to optimally deploy multi-agent systems (MASs) to cooperatively coverage poriferous environments in real cooperative detection applications. In response to this challenge, this paper proposes a hierarchical coverage control (HCC) protocol for MASs to perform sector-based coverage operations. First, a distributed Voronoi partition-based sweep-and-assign protocol, combined with a sectorial partition method, is developed, enabling the segmentation of a whole poriferous region into multiple sectorial sub-subregions. Following this procedure, an extreme search scheme is developed to determine the optimal amount of agents for each subregion. After this allocation, a distributed controller is proposed to deploy the agents, considering non-holonomic constraints, into designated niche positions. Additionally, sufficient conditions are derived to guarantee the asymptotical stability of the present HCC. The analytical challenge of the present study stems from the non-convex characteristics inherent in the loss function induced by porous environments. This non-convexity renders the task of globally optimizing the assignment of MASs intractable. Finally, numerical simulations are conducted to validate the effectiveness of the present coverage control approach.