Zhiwei Ai
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
Zhiwei Ai has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Chenliang Li
School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541004, China
3 shared publications Mufan Zhang
School of Artificial Intelligence, Guilin University of Aerospace Technology, China
1 shared publication- Peiqi Li
School of Artificial Intelligence, Guilin University of Aerospace Technology, China
1 shared publication
Latest Publications
- Open Access
Block Subgradient Greedy Kaczmarz Methods for Robotic Grasping Problems
The robotic grasping problem is firstly cast as a linear complementarity problem and reformulated into nonsmooth equations. We propose two block Kaczmarz methods to solve the equations. The K-means clustering algorithm is utilized to partition the nonsmooth equations. Based on the resulting block information, the subgradient greedy randomized Kaczmarz method and the subgradient multi-step greedy Kaczmarz method are constructed. Asymptotic convergence of the proposed block subgradient Kaczmarz methods is given. Numerical results confirm the superior computational accuracy of the new methods.
Open AccessBlock Subgradient Greedy Kaczmarz Methods for Robotic Grasping Problems
The robotic grasping problem is firstly cast as a linear complementarity problem and reformulated into nonsmooth equations. We propose two block Kaczmarz methods to solve the equations. The K-means clustering algorithm is utilized to partition the nonsmooth equations. Based on the resulting block information, the subgradient greedy randomized Kaczmarz method and the subgradient multi-step greedy Kaczmarz method are constructed. Asymptotic convergence of the proposed block subgradient Kaczmarz methods is given. Numerical results confirm the superior computational accuracy of the new methods.
- Open Access
Accelerated Computation of Linear Complementarity Problem in Dexterous Robotic Grasping via Newton-Subgradient Non-Smooth Multi-Step Greedy Kaczmarz Method
Real-time computational capability for simultaneous grasping force and displacement determination constitutes a critical enabler for stable and reliable grasping performance in dexterous robotic grasping. To accelerate the computational efficiency of LCP in the dexterous grasping problem, as well as to ensure the stability and reproducibility of the algorithm’s output, the NSNMGK method, which incorporates sequential projection iterations across all greedy-selected active constraint rows within each NSNGRK framework iteration cycle, is developed. In each NSNMGK iteration, sequential projection operations are systematically applied to all active constraint rows, satisfying the greedy criterion. This processing strategy ensures the full utilization of qualifying constraints within the greedy subset through a same generalized Jacobian evaluation per iteration cycle. The methodology effectively mitigates inherent limitations of conventional randomized row selection, including unpredictable iteration counts and computational overhead from repeated Jacobian updates, while maintaining deterministic convergence behavior. The method’s convergence theory is rigorously established, with benchmark analyses demonstrating marked improvements in computational efficiency over the NSNGRK framework. Experimental validation in dexterous robotic grasping scenarios further confirms enhanced convergence rates through reduced iteration counts and shortened computational durations relative to existing approaches.
Open AccessAccelerated Computation of Linear Complementarity Problem in Dexterous Robotic Grasping via Newton-Subgradient Non-Smooth Multi-Step Greedy Kaczmarz Method
Real-time computational capability for simultaneous grasping force and displacement determination constitutes a critical enabler for stable and reliable grasping performance in dexterous robotic grasping. To accelerate the computational efficiency of LCP in the dexterous grasping problem, as well as to ensure the stability and reproducibility of the algorithm’s output, the NSNMGK method, which incorporates sequential projection iterations across all greedy-selected active constraint rows within each NSNGRK framework iteration cycle, is developed. In each NSNMGK iteration, sequential projection operations are systematically applied to all active constraint rows, satisfying the greedy criterion. This processing strategy ensures the full utilization of qualifying constraints within the greedy subset through a same generalized Jacobian evaluation per iteration cycle. The methodology effectively mitigates inherent limitations of conventional randomized row selection, including unpredictable iteration counts and computational overhead from repeated Jacobian updates, while maintaining deterministic convergence behavior. The method’s convergence theory is rigorously established, with benchmark analyses demonstrating marked improvements in computational efficiency over the NSNGRK framework. Experimental validation in dexterous robotic grasping scenarios further confirms enhanced convergence rates through reduced iteration counts and shortened computational durations relative to existing approaches.
- Open Access
- 21 April 2025
- Published by SAGE Publications in Advances in Mechanical Engineering
- Vol. 17 (4)
Optimized actuator design for flapping-wing robots: A multi-objective approach to mimic natural flapping dynamics
An optimized actuator for a flapping-wing robot was developed using detailed geometric and physical models to more closely mimic natural flapping dynamics. The robot’s actuator was reconfigured into a linked mechanism and analyzed through geometric equations. The pseudo-rigid-body model was employed to derive mechanical equations. Dual objectives were set for actuator optimization: minimizing both the maximum transmission angle and the potential energy of the flapping motion, subject to geometric and physical constraints. The optimization utilized the NSGA-II algorithm. Additionally, a virtual prototype with rigid-flexible coupling was created for simulation assessments pre- and post-optimization. Multi-objective optimization led to significant performance gains, including a 35.8% reduction in minimum potential energy, a 45.7% decrease in the standard deviation of the angular velocity, and a 10.0% improvement in the actuator angle’s range of angular variation at a flutter frequency of 4.5 Hz, all compared to a geometry-only baseline. These results suggest that the design provides enhanced stability and better replicates the natural dynamics of flapping flight.
- 21 April 2025
- Published by SAGE Publications in Advances in Mechanical Engineering
- Vol. 17 (4)
Open AccessOptimized actuator design for flapping-wing robots: A multi-objective approach to mimic natural flapping dynamics
An optimized actuator for a flapping-wing robot was developed using detailed geometric and physical models to more closely mimic natural flapping dynamics. The robot’s actuator was reconfigured into a linked mechanism and analyzed through geometric equations. The pseudo-rigid-body model was employed to derive mechanical equations. Dual objectives were set for actuator optimization: minimizing both the maximum transmission angle and the potential energy of the flapping motion, subject to geometric and physical constraints. The optimization utilized the NSGA-II algorithm. Additionally, a virtual prototype with rigid-flexible coupling was created for simulation assessments pre- and post-optimization. Multi-objective optimization led to significant performance gains, including a 35.8% reduction in minimum potential energy, a 45.7% decrease in the standard deviation of the angular velocity, and a 10.0% improvement in the actuator angle’s range of angular variation at a flutter frequency of 4.5 Hz, all compared to a geometry-only baseline. These results suggest that the design provides enhanced stability and better replicates the natural dynamics of flapping flight.
- Open Access
Calculation of Robot Multi-Fingered Grasping Force and Displacement Based on the Newton–Subgradient Non-Smooth Greedy Randomized Kaczmarz Method for Solving Linear Complementarity Problem
The calculation of grasping force and displacement is important for multi-fingered stable grasping and research on slipping damage. By linearizing the friction cone, the robot multi-fingered grasping problem can be represented as a linear complementarity problem (LCP) with a saddle-point coefficient matrix. Because the solution methods for LCP proposed in the field of numerical computation cannot be applied to this problem and the Pivot method can only be used for solving specific grasping problems, the LCP is converted into a non-smooth system of equations for solving it. By combining the Newton method with the subgradient and Kaczmarz methods, a Newton–subgradient non-smooth greedy randomized Kaczmarz (NSNGRK) method is proposed to solve this non-smooth system of equations. The convergence of the proposed method is established. Our numerical experiments indicate its feasibility and effectiveness in solving the grasping force and displacement problems of multi-fingered grasping.
Open AccessCalculation of Robot Multi-Fingered Grasping Force and Displacement Based on the Newton–Subgradient Non-Smooth Greedy Randomized Kaczmarz Method for Solving Linear Complementarity Problem
The calculation of grasping force and displacement is important for multi-fingered stable grasping and research on slipping damage. By linearizing the friction cone, the robot multi-fingered grasping problem can be represented as a linear complementarity problem (LCP) with a saddle-point coefficient matrix. Because the solution methods for LCP proposed in the field of numerical computation cannot be applied to this problem and the Pivot method can only be used for solving specific grasping problems, the LCP is converted into a non-smooth system of equations for solving it. By combining the Newton method with the subgradient and Kaczmarz methods, a Newton–subgradient non-smooth greedy randomized Kaczmarz (NSNGRK) method is proposed to solve this non-smooth system of equations. The convergence of the proposed method is established. Our numerical experiments indicate its feasibility and effectiveness in solving the grasping force and displacement problems of multi-fingered grasping.
- Open Access
- 8 April 2022
- Published by Atlantis Press SARL
- p. 186-193
The Incompatibility between Art and Morality
- 8 April 2022
- Published by Atlantis Press SARL
- p. 186-193
Open AccessThe Incompatibility between Art and Morality