Experimental validation and comparative analysis of optimal time-jerk algorithms for trajectory planning
In this paper, two minimum time-jerk trajectory planning algorithms for robotic manipulators have been considered, evaluated and experimentally validated. These algorithms consider both the execution time and the integral of the squared jerk along the whole trajectory, so as to take into account the...
Uloženo v:
| Vydáno v: | Robotics and computer-integrated manufacturing Ročník 28; číslo 2; s. 164 - 181 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
01.04.2012
|
| Témata: | |
| ISSN: | 0736-5845, 1879-2537 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | In this paper, two minimum time-jerk trajectory planning algorithms for robotic manipulators have been considered, evaluated and experimentally validated. These algorithms consider both the execution time and the integral of the squared jerk along the whole trajectory, so as to take into account the need for fast execution and the need for a smooth trajectory, by adjusting the values of two weights. A comparative analysis of these algorithms with two different trajectory planning techniques taken from the literature has been carried out, by means of experimental tests performed on a real robotic manipulator. The results prove the experimental effectiveness of the proposed techniques.
► Experimental validation of two minimum time-jerk trajectory planning algorithms. ► Theoretical and experimental comparative analysis with other optimum algorithms. ► Trajectories planned and run on a Cartesian robot with a piezoelectric accelerometer. ► Effectiveness of the minimum time-jerk planning algorithms has been proven. |
|---|---|
| Bibliografie: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0736-5845 1879-2537 |
| DOI: | 10.1016/j.rcim.2011.08.003 |