Near-minimum-time task planning for fruit-picking robots

摘要

A near-minimum-time task-planning algorithm for fruit-harvesting robots having to pick fruits at N given locations is presented. For the given kinematic and inertial parameters of the manipulator, the algorithm determines the near-optimal sequence of fruit locations through which the arm should pass and finds the near-minimum-time path between these points. The sequence of motions was obtained by solving the traveling salesman problem (TSP) using the distance along the geodesics in the manipulator's inertia space, between every two fruit locations, as the cost to be minimized. The proposed algorithm was applied to define the motions of a citrus-picking robot and was tested for a cylindrical robot on fruit position data collected from 20 trees. Significant reduction in the required computing time was achieved by dividing the volume containing the fruits into subvolumes and estimating the geodesic distance rather than calculating it.