נגישות
menu      
חיפוש מתקדם
תחביר
חפש...
הספר "אוצר וולקני"
אודות
תנאי שימוש
ניהול
קהילה:
אסיף מאגר המחקר החקלאי
פותח על ידי קלירמאש פתרונות בע"מ -
Minimum Time Kinematic Motions of a Cartesian Mobile Manipulator for a Fruit Harvesting Robot
Year:
2014
Authors :
ציון, בועז
;
.
Volume :
136
Co-Authors:

Moshe P. Mann - Faculty of Civil and Environmental Engineering, Technion-Israel Institute of Technology, Haifa 32000, Israel

Boaz Zion - Institute of Agricultural Engineering,Agricultural Research Organization, The Volcani Center , Bet Dagan 50250 ,  Israel


Dror Rubinstein - Faculty of Civil and Environmental Engineering, Technion-Israel Institute of Technology , Haifa 32000,  Israel


Raphael Linker - Faculty of Civil and Environmental Engineering, Technion-Israel Institute of Technology, Haifa 32000, Israel


Itzhak Shmulevich - Faculty of Civil and Environmental Engineering, Technion-Israel Institute of Technology, Haifa 32000,  Israel


 

Facilitators :
From page:
0
To page:
0
(
Total pages:
1
)
Abstract:

This paper describes an analytical procedure to calculate the time-optimal 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 drop-off 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.

Note:
Related Files :
Harvesting robots
mobile manipulator
nonsmooth optimization
Orienteering
Time optimal control
עוד תגיות
תוכן קשור
More details
DOI :
10.1115/1.4027088
Article number:
0
Affiliations:
Database:
Publication Type:
מאמר
;
.
Language:
אנגלית
Editors' remarks:
ID:
49936
Last updated date:
02/03/2022 17:27
Creation date:
13/09/2020 22:04
Scientific Publication
Minimum Time Kinematic Motions of a Cartesian Mobile Manipulator for a Fruit Harvesting Robot
136

Moshe P. Mann - Faculty of Civil and Environmental Engineering, Technion-Israel Institute of Technology, Haifa 32000, Israel

Boaz Zion - Institute of Agricultural Engineering,Agricultural Research Organization, The Volcani Center , Bet Dagan 50250 ,  Israel


Dror Rubinstein - Faculty of Civil and Environmental Engineering, Technion-Israel Institute of Technology , Haifa 32000,  Israel


Raphael Linker - Faculty of Civil and Environmental Engineering, Technion-Israel Institute of Technology, Haifa 32000, Israel


Itzhak Shmulevich - Faculty of Civil and Environmental Engineering, Technion-Israel Institute of Technology, Haifa 32000,  Israel


 

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

This paper describes an analytical procedure to calculate the time-optimal 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 drop-off 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.

Scientific Publication
You may also be interested in