Abstract
Path planning for picking safflowers is a key component in ensuring the efficient operation of robotic safflower-picking systems. However, existing single-arm picking devices have become a bottleneck due to their limited operating range, and a breakthrough in multi-arm cooperative picking is urgently needed. To address the issue of inadequate adaptability in current path planning strategies for dual-arm systems, this paper proposes a novel path planning method for dual-arm picking (LTSACO). The technique centers on a dynamic-weight heuristic strategy and achieves optimization through the following steps: first, the K-means clustering algorithm divides the target area; second, the heuristic mechanism of the Ant Colony Optimization (ACO) algorithm is improved by dynamically adjusting the weight factor of the state transition probability, thereby enhancing the diversity of path selection; third, a 2-OPT local search strategy eliminates path crossings through neighborhood search; finally, a cubic Bézier curve heuristically smooths and optimizes the picking trajectory, ensuring the continuity of the trajectory's curvature. Experimental results show that the length of the parallelogram trajectory, after smoothing with the Bézier curve, is reduced by 20.52% compared to the gantry trajectory. In terms of average picking time, the LTSACO algorithm reduces the time by 2.00%, 2.60%, and 5.60% compared to DCACO, IACO, and the traditional ACO algorithm, respectively. In conclusion, the LTSACO algorithm demonstrates high efficiency and strong robustness, providing an effective optimization solution for multi-arm cooperative picking and significantly contributing to the advancement of multi-arm robotic picking systems.