Research on Path Planning Method for Mobile Platforms Based on Hybrid Swarm Intelligence Algorithms in Multi-Dimensional Environments.

Traditional algorithms such as Dijkstra and APF rely on complete environmental information for path planning, which results in numerous constraints during modeling. This not only increases the complexity of the algorithms but also reduces the efficiency and reliability of the planning. Swarm intelligence algorithms possess strong data processing and search capabilities, enabling them to efficiently solve path planning problems in different environments and generate approximately optimal paths. However, swarm intelligence algorithms suffer from issues like premature convergence and a tendency to fall into local optima during the search process. Thus, an improved Artificial Bee Colony-Beetle Antennae Search (IABCBAS) algorithm is proposed. Firstly, Tent chaos and non-uniform variation are introduced into the bee algorithm to enhance population diversity and spatial searchability. Secondly, the stochastic reverse learning mechanism and greedy strategy are incorporated into the beetle antennae search algorithm to improve direction-finding ability and the capacity to escape local optima, respectively. Finally, the weights of the two algorithms are adaptively adjusted to balance global search and local refinement. Results of experiments using nine benchmark functions and four comparative algorithms show that the improved algorithm exhibits superior path point search performance and high stability in both high- and low-dimensional environments, as well as in unimodal and multimodal environments. Ablation experiment results indicate that the optimization strategies introduced in the algorithm effectively improve convergence accuracy and speed during path planning. Results of the path planning experiments show that compared with the comparison algorithms, the average path planning distance of the improved algorithm is reduced by 23.83% in the 2D multi-obstacle environment, and the average planning time is shortened by 27.97% in the 3D surface environment. The improvement in path planning efficiency makes this algorithm of certain value in engineering applications.