This paper introduces an enhanced Whale Optimization Algorithm, named the Multi-Swarm Improved Spiral Whale Optimization Algorithm (MISWOA), designed to address the shortcomings of the traditional Whale Optimization Algorithm (WOA) in terms of global search capability and convergence velocity. The MISWOA combines an adaptive nonlinear convergence factor with a variable gain compensation mechanism, adaptive weights, and an advanced spiral convergence strategy, resulting in a significant enhancement in the algorithm’s global search capability, convergence velocity, and precision. Moreover, MISWOA incorporates a multi-population mechanism, further bolstering the algorithm’s efficiency and robustness. Ultimately, an extensive validation of MISWOA through “simulation + experimentation” approaches has been conducted, demonstrating that MISWOA surpasses other algorithms and the Whale Optimization Algorithm (WOA) and its variants in terms of convergence accuracy and algorithmic efficiency. This validates the effectiveness of the improvement method and the exceptional performance of MISWOA, while also highlighting its substantial potential for application in practical engineering scenarios. This study not only presents an improved optimization algorithm but also constructs a systematic framework for analysis and research, offering novel insights for the comprehension and refinement of swarm intelligence algorithms.

In this paper, an Enhanced Greylag Goose Optimization Algorithm (EGGO) based on evolutionary game theory is presented to address the limitations of the traditional Greylag Goose Optimization Algorithm (GGO) in global search ability and convergence speed. By incorporating dynamic strategy adjustment from evolutionary game theory, EGGO improves global search efficiency and convergence speed. Furthermore, EGGO employs dynamic grouping, random mutation, and local search enhancement to boost efficiency and robustness. Experimental comparisons on standard test functions and the CEC 2022 benchmark suite show that EGGO outperforms other classic algorithms and variants in convergence precision and speed. Its effectiveness in practical optimization problems is also demonstrated through applications in engineering design, such as the design of tension/compression springs, gear trains, and three-bar trusses. EGGO offers a novel solution for optimization problems and provides a new theoretical foundation and research framework for swarm intelligence algorithms.

This paper proposes an adaptive residual extended Kalman filter method optimized by a multi-strategy improved parrot optimization algorithm (MIPO-ARKEKF) to improve the kinematic parameter calibration accuracy and efficiency of robotic polishing systems. To address the limitations of the standard extended Kalman filter (EKF), such as truncation-error accumulation during repeated linearization and sensitivity to manually selected noise parameters, an integrated improvement framework is developed. Specifically, a gradient stabilizer based on state-estimation increments is introduced to alleviate estimation degradation caused by accumulated truncation errors, while the proposed MIPO algorithm is employed to adaptively optimize the process and measurement noise covariance matrices, thereby improving the robustness of parameter identification under practical measurement uncertainty. The calibration process is established on the basis of high-precision external measurement data obtained from the robotic polishing system. In benchmark-function tests, MIPO demonstrates superior convergence performance. In physical experiments based on a KUKA KR210 R2700 robot, the proposed MIPO-ARKEKF method reduces the root mean square positioning error from 0.8927 mm to 0.4858 mm, corresponding to a 45.58% improvement in accuracy. Compared with representative hybrid calibration methods, the proposed method achieves comparable compensation accuracy while reducing computation time by 34.88% to 65.08%. Practical polishing experiments on ultra-low-expansion glass lenses further verify that the proposed method effectively improves end-effector trajectory tracking accuracy and polishing quality, providing an efficient solution for high-precision robotic polishing.

Automated Guided Vehicles (AGVs) play a crucial role in intelligent warehousing; however, effective path planning remains challenging because of obstacles, safety constraints, and the risk of suboptimal routes. This study proposes an improved Harris Hawks Optimization algorithm for AGV path planning, introducing strategies to enhance initial solution quality, balance global and local search, and avoid local optima. The proposed algorithm generates shorter, smoother, and safer paths, as demonstrated through benchmark tests, multi-scale grid-map simulations, and real-world AGV experiments. In terms of path length and computational efficiency, the enhanced algorithm significantly outperforms the original HHO, reducing average path length by 10.81% and average travel time by 11.94%. These results demonstrate that the proposed method provides a practical and reliable solution for autonomous warehouse navigation and significantly improves AGV path-planning performance.