In this letter, 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 letter, 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 A.;Mengacci R.;Angelini F.;Caporale D.;Pallottino L.;Garabini M.
2020-01-01
Abstract
In this letter, 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 letter, 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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.