Zeming Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zeming Wu has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Huaicheng Yan
East China University of Science and Technology
3 shared publications - Hao Zhang
Tongji University
2 shared publications - Yunkai Lv
East China University of Science and Technology
2 shared publications - Zhuping Wang
National Key Laboratory of Autonomous Intelligent Unmanned Systems, Tongji University, Shanghai, China
2 shared publications Chengcheng Fu
City University of Hong Kong
1 shared publication- Kai Rao
Key Laboratory of Smart Manufacturing in Energy Chemical Process of the Ministry of Education, East China University of Science and Technology, Shanghai, China
1 shared publication
Latest Publications
- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. PP (21682267) , 1-12
Decentralized Pursuit of an Evader With Probabilistic Collision-Free for Differential Drive Robots
This article addresses the pursuit-evasion problem among differential drive robots in an obstacle environment with perception uncertainty. To calculate probabilistic collision-free trajectories during the pursuit process, this article introduces the chance-constraint pursuit Voronoi cell (CCPVC), which consists of separation hyperplanes between robots and separation hyperplanes between robots and obstacles. The optimization problems are formulated to compute the separation hyperplanes, and the solution methods are provided. By incorporating two buffer terms, CCPVC exhibits favorable probabilistic collision avoidance properties. Furthermore, a nearest point finding algorithm specifically designed for pursuit scenarios, along with a distributed pursuit control policy tailored for differential drive robots are proposed based on CCPVC. Rigorous proofs for the probabilistic collision avoidance guarantees of CCPVC and the control law during the pursuit process are provided, respectively. Finally, the effectiveness of the proposed methods is validated through simulations and experiments.
- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. PP (21682267) , 1-12
Decentralized Pursuit of an Evader With Probabilistic Collision-Free for Differential Drive Robots
This article addresses the pursuit-evasion problem among differential drive robots in an obstacle environment with perception uncertainty. To calculate probabilistic collision-free trajectories during the pursuit process, this article introduces the chance-constraint pursuit Voronoi cell (CCPVC), which consists of separation hyperplanes between robots and separation hyperplanes between robots and obstacles. The optimization problems are formulated to compute the separation hyperplanes, and the solution methods are provided. By incorporating two buffer terms, CCPVC exhibits favorable probabilistic collision avoidance properties. Furthermore, a nearest point finding algorithm specifically designed for pursuit scenarios, along with a distributed pursuit control policy tailored for differential drive robots are proposed based on CCPVC. Rigorous proofs for the probabilistic collision avoidance guarantees of CCPVC and the control law during the pursuit process are provided, respectively. Finally, the effectiveness of the proposed methods is validated through simulations and experiments.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 42, 4140-4160
Cooperative Geometry-Aware Collision Avoidance for Heterogeneous Robots via Negotiation on Separating Hyperplanes
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics
- Vol. 42, 4140-4160
Cooperative Geometry-Aware Collision Avoidance for Heterogeneous Robots via Negotiation on Separating Hyperplanes
- 3 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 9 (6) , 5783-5790
Quaternion-Based Optimal Interpolation of Similarity Transformations for Multi-Agent Formation
This letter addresses the challenge of optimal motion interpolation in multi-agent formation control. The primary goal is to generate trajectories of similarity transformations that minimize various metrics, such as distance traveled, kinetic energy consumption, and overall smoothness. The quaternion-based representation is introduced for similarity transformations, providing an innovative solution to bypass the intricate mapping between Lie group elements and Lie algebra elements. The quaternion-based approach enables the calculation of time derivatives of agents through finite algebraic operations. This feature is pivotal for efficient motion interpolation. This simplification significantly enhances the efficiency and effectiveness of the interpolation process, making it a valuable tool for multi-agent formation control. To address the optimal motion interpolation problem, we formulate it as a variational problem and derive necessary conditions for both two-point and multiple-point optimal interpolations. To further improve computational efficiency while preserving the optimal solution's structure, we propose a polynomial approximation method. Finally, we illustrate the effectiveness of the proposed method through examples of ellipsoid formation. Comparative analyses demonstrate the optimality of our approach.
- 3 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 9 (6) , 5783-5790
Quaternion-Based Optimal Interpolation of Similarity Transformations for Multi-Agent Formation
This letter addresses the challenge of optimal motion interpolation in multi-agent formation control. The primary goal is to generate trajectories of similarity transformations that minimize various metrics, such as distance traveled, kinetic energy consumption, and overall smoothness. The quaternion-based representation is introduced for similarity transformations, providing an innovative solution to bypass the intricate mapping between Lie group elements and Lie algebra elements. The quaternion-based approach enables the calculation of time derivatives of agents through finite algebraic operations. This feature is pivotal for efficient motion interpolation. This simplification significantly enhances the efficiency and effectiveness of the interpolation process, making it a valuable tool for multi-agent formation control. To address the optimal motion interpolation problem, we formulate it as a variational problem and derive necessary conditions for both two-point and multiple-point optimal interpolations. To further improve computational efficiency while preserving the optimal solution's structure, we propose a polynomial approximation method. Finally, we illustrate the effectiveness of the proposed method through examples of ellipsoid formation. Comparative analyses demonstrate the optimality of our approach.
- 18 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (7) , 9518-9526
Local-Bearing-Based Prescribed-Time Distributed Localization of Multiagent Systems With Noisy Measurement
This work investigates stability and localizability of local-bearing-based multiagent systems without common orientation in the presence of measurement noise, which are more general but also more challenging to deal with than global-bearing-based multiagent systems under ideal environment. Based on local-bearing unbiased estimator constructed from the historical information and a newly designed time-varying gain, a robust prescribed-time orientation estimation algorithm is proposed to ensure that the local reference frame of the follower agent is aligned with the global one. The local bearing information is more easily obtained than global one. Therefore, the new orientation estimation result is expected to be more widely applicable. The robust orientation estimation algorithm is then applied to the problem of localization estimation, and a prescribed-time distributed localization estimation algorithm is developed. The distinctive advantage of this work is that only the local bearing information is used, the fast and controllable localization estimation is achieved. The global convergence is derived based on the cascade system. Some simulation and experiment results are provided to prove the effectiveness of the proposed estimation algorithms.
- 18 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (7) , 9518-9526
Local-Bearing-Based Prescribed-Time Distributed Localization of Multiagent Systems With Noisy Measurement
This work investigates stability and localizability of local-bearing-based multiagent systems without common orientation in the presence of measurement noise, which are more general but also more challenging to deal with than global-bearing-based multiagent systems under ideal environment. Based on local-bearing unbiased estimator constructed from the historical information and a newly designed time-varying gain, a robust prescribed-time orientation estimation algorithm is proposed to ensure that the local reference frame of the follower agent is aligned with the global one. The local bearing information is more easily obtained than global one. Therefore, the new orientation estimation result is expected to be more widely applicable. The robust orientation estimation algorithm is then applied to the problem of localization estimation, and a prescribed-time distributed localization estimation algorithm is developed. The distinctive advantage of this work is that only the local bearing information is used, the fast and controllable localization estimation is achieved. The global convergence is derived based on the cascade system. Some simulation and experiment results are provided to prove the effectiveness of the proposed estimation algorithms.