On-line near minimum-time path planning and control of an industrial robot for picking fruits

To be competitive, an industrial robot picking fruits must be able to perform this task in an amount of time which compares to that needed by humans. Because the location of a fruit changes due to the picking of others, the determination of their location has to be performed on-line and also the associated path planning for the robot. This poses two major problems in the development of fruit-picking robots since locating fruits and path planning, in general, are computationally expensive operations. This paper contributes to relaxing the second problem. Using the fact that the motions of the links of an industrial robot are approximately decoupled, this paper proposes a new method for near minimum-time path planning and control in the presence of obstacles. This method is computationally cheap compared to methods that solve the more general problem. Experimental results are presented which indicate the feasibility of this approach to make the robot competitive.

[1]  Eldert J. van Henten,et al.  A new optimization algorithm for singular and non-singular digital time-optimal control of robots , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[2]  El-Ghazali Talbi,et al.  The "Ariadne's clew" algorithm: global planning with local methods , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

[3]  Leon Zlajpah,et al.  On time optimal path control of manipulators with bounded joint velocities and torques , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[4]  L. G. van Willigenburg.  Computation and Implementation of Digital Time-Optimal Feedback Controllers for an Industrial X-Y Robot subjected to Path, Torque, and Velocity Constraints , 1993, Int. J. Robotics Res..

[5]  John J. Craig Zhu,et al.  Introduction to robotics mechanics and control , 1991 .

[6]  Kang G. Shin,et al.  Selection of near-minimum time geometric paths for robotic manipulators , 1986 .

[7]  J. Bobrow,et al.  Time-Optimal Control of Robotic Manipulators Along Specified Paths , 1985 .

[8]  Pierre Bessière,et al.  The Ariadne's Clew Algorithm , 1993, J. Artif. Intell. Res..

[9]  E. J. van Henten,et al.  Field Test of an Autonomous Cucumber Picking Robot , 2003 .

[10]  N Kondo,et al.  Fruit harvesting robots in Japan. , 1996, Advances in space research : the official journal of the Committee on Space Research.

[11]  L. V. Willigenburg,et al.  Computation of time-optimal controls applied to rigid manipulators with friction , 1991 .

[12]  E. J. van Henten,et al.  Collision-free Motion Planning for a Cucumber Picking Robot , 2003 .

[13]  Naoshi Kondo,et al.  Cucumber Harvesting Robot and Plant Training System , 1999, J. Robotics Mechatronics.

[14]  J. Bontsema,et al.  An Autonomous Robot for Harvesting Cucumbers in Greenhouses , 2002, Auton. Robots.

[15]  Kang G. Shin,et al.  Minimum-time control of robotic manipulators with geometric path constraints , 1985 .

[16]  Lino Guzzella,et al.  Time-optimal motions of robots in assembly tasks , 1985, 1985 24th IEEE Conference on Decision and Control.

[17]  Arthur E. Ryson,et al.  Efficient Algorithm for Time-Optimal Control of a Two-Link Manipulator , 1990 .