关键词: 动态分拣, 直角坐标机器人, 分拣规划, 贪心策略, 物体分拣

Abstract: An improved greedy strategy planning algorithm for continuous robot sorting is proposed for the problem that the efficiency is low when traditional sequential sorting algorithm is applied to sort dynamically materials with Cartesian robot. Kinematic model of the Cartesian robot was established to ensure that materials can be accurately picked up. Time window was designed to divide the continuous flow materials on the conveyor belt into regions one by one, and the greedy strategy was applied to plan the sorting sequence of materials in the same time window. Cost function was designed to improve the greedy strategy considering the risk of missing materials in the sorting, which enhances the practicality of the algorithm. Simulation environment was designed to simulate the algorithm, and the sorting experiment was carried out using the designed robot platform to verify the feasibility and effectiveness of the algorithm. Experiments show that the algorithm can plan an effective sorting path in the actual sorting operation of the robot. The average sorting distance and sorting time are both smaller than the sequence planning algorithm, which improves the efficiency of robot sorting for continuous moving materials in the plane. The algorithm, with good real-time performance and strong practicability, has certain guiding significance for the research on the optimization of the sorting path in the case of dynamic sorting with Cartesian robot.

Key words: dynamic sorting, Cartesian robot, sorting planning, greedy strategy, materials sorting