In this paper, a new approach is proposed to optimally plan the motion along a parametrized path for flexible joint robots, i.e., robots whose structure is purposefully provided with compliant elements. State-of-the-art methods efficiently solve the problem in case of torque-controlled rigid robots via a translation of the optimal control problem into a convex optimization problem. Recently, we showed that, for jerk-controlled rigid robots, the problem could be recast into a non-convex optimization problem. The non-convexity is given by bilinear constraints that can be efficiently handled through McCormick relaxations and spatial Branch-and-Bound techniques. In this paper, we show that, even in case of robots with flexible joints, the time-optimal trajectory planning problem can be recast into a non-convex problem in which the non-convexity is still given by bilinear constraints. We performed experimental tests on a planar 2R elastic manipulator to validate the benefits of the proposed approach. The scalability of the method for robots with multiple degrees of freedom is also discussed.

Time-Optimal Trajectory Planning for Flexible Joint Robots / Palleschi, Alessandro; Mengacci, Riccardo; Angelini, Franco; Caporale, Danilo; Pallottino, Lucia; De Luca, Alessandro; Garabini, Manolo. - In: IEEE ROBOTICS AND AUTOMATION LETTERS. - ISSN 2377-3766. - 5:2(2020), pp. 938-945. [10.1109/LRA.2020.2965861]

Time-Optimal Trajectory Planning for Flexible Joint Robots

De Luca, Alessandro
;
2020

Abstract

In this paper, a new approach is proposed to optimally plan the motion along a parametrized path for flexible joint robots, i.e., robots whose structure is purposefully provided with compliant elements. State-of-the-art methods efficiently solve the problem in case of torque-controlled rigid robots via a translation of the optimal control problem into a convex optimization problem. Recently, we showed that, for jerk-controlled rigid robots, the problem could be recast into a non-convex optimization problem. The non-convexity is given by bilinear constraints that can be efficiently handled through McCormick relaxations and spatial Branch-and-Bound techniques. In this paper, we show that, even in case of robots with flexible joints, the time-optimal trajectory planning problem can be recast into a non-convex problem in which the non-convexity is still given by bilinear constraints. We performed experimental tests on a planar 2R elastic manipulator to validate the benefits of the proposed approach. The scalability of the method for robots with multiple degrees of freedom is also discussed.
2020
time-optimal motion; flexible joint robots; trajectory planning; parametrized path; non-convex problems
01 Pubblicazione su rivista::01a Articolo in rivista
Time-Optimal Trajectory Planning for Flexible Joint Robots / Palleschi, Alessandro; Mengacci, Riccardo; Angelini, Franco; Caporale, Danilo; Pallottino, Lucia; De Luca, Alessandro; Garabini, Manolo. - In: IEEE ROBOTICS AND AUTOMATION LETTERS. - ISSN 2377-3766. - 5:2(2020), pp. 938-945. [10.1109/LRA.2020.2965861]
File allegati a questo prodotto
File Dimensione Formato  
Palleschi_Postprint_Time-Optimal_2020.pdf

accesso aperto

Note: https://ieeexplore.ieee.org/document/8957077
Tipologia: Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 2.13 MB
Formato Adobe PDF
2.13 MB Adobe PDF
Palleschi_Time-Optimal_2020.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 1.57 MB
Formato Adobe PDF
1.57 MB Adobe PDF   Contatta l'autore

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1356788
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 24
  • ???jsp.display-item.citation.isi??? 22
social impact