By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)

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

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:7 ,  Issue: 1 )