Minimum Time Kinematic Motions of a Cartesian Mobile Manipulator for a Fruit Harvesting Robot

Abstract

This paper describes an analytical procedure to calculate the timeoptimal trajectory for a mobile Cartesian manipulator to traverse between any two fruits it picks up it. The goal is to minimize the time required from the retrieval of one fruit to that of the next while adhering to velocity, acceleration, location, and endpoint constraints. This is accomplished using a six stage procedure, based on Bellman's Principle of Optimality and nonsmooth optimization that is completely analytical and requires no numerical computations. The procedure sequentially calculates all relevant parameters, from which side of the mobile platform to place the fruit on to the velocity profile and dropoff point, that yield a minimum time trajectory. In addition, it provides a time window under which the mobile manipulator can traverse from any fruit to any other, which can be used for a globally optimal retrieving sequence algorithm.