Skip to main content

SINTESIS DE MOVIMIENTOS ROBOTICOS OPTIMAMENTE AGILES Y GRACILES

PID2020-117509GB-I00

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2020
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre AGENCIA ESTATAL CONSEJO SUPERIOR DE INVESTIGACIONES CIENTIFICAS (CSIC)

Resultados relacionados

Resultados totales (Incluyendo duplicados): 30
Encontrada(s) 1 página(s)

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Approximating displacements in R^3 by rotations in R^4 and its application to pointcloud registration

  • Sarabandi, Soheil
  • Thomas, Federico
No proper norm exists to measure the distance between two object poses essentially because a general pose is defined by a rotation and a translation, and thus it involves magnitudes with different units. As a means to solve this dimensional-inhomogeneity problem, the concept of characteristic length has been put forward in the area of kinematics. The idea consists in scaling translations according to this characteristic length and then approximating the corresponding displacement defining the object pose in R^3 by a rotation in R^4, for which a norm exists. This paper sheds new light on this kind of approximations which permits simplifying optimization problem whose cost functions involve translations and rotations simultaneously. A good example of this kind of problems is the pointcloud registration problem in which the optimal rotation and translation between two sets of corresponding 3D point data, so that they are aligned/registered, have to be found. As a result, a simple closed-form formula for solving this problem is presented which is shown to be an attractive alternative to the previous approaches., This work was partially supported by the Spanish Ministry of Economy and Competitiveness through the projects DPI2017-88282-P, PID2020-117509GBI00, and MDM-2016-0656.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Hand-Eye Calibration Made Easy Through a Closed-Form Two-Stage Method

  • Sarabandi, Soheil
  • Porta, Josep M.
  • Thomas, Federico
An analysis of the existing hand-eye calibration methods reveals that most of them are far from trivial. And, what is worse, their intrinsic complexity makes it difficult to elucidate under which circumstances they fail to provide an accurate solution. Thus, although it might seem that the hand-eye calibration problem is uninspiring because it is assumed to be well-solved, we show in this letter that there was still room for improvement, both in terms of simplicity and robustness. After reviewing the most representative methods, we analyze the situations in which they fail, and we introduce a simpler closed-form alternative that accurately solves the problem in all the identified critical circumstances. Its performance is evaluated using simulated and real experimental data., This work was partially supported by the Spanish Government through project PID2020-117509GB-I00/AEI/10.13039/50110001103
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

A Legendre-Gauss pseudospectral collocation method for trajectory optimization in second order systems

  • Moreno Martín, Siro
  • Ros, Lluís
  • Celaya, Enric
Trabajo presentado en el International Conference on Intelligent Robots and Systems (IROS), celebrado en Kyoto (Japón), del 23 al 27 de octubre de 2022, Pseudospectral collocation methods have proven to be powerful tools to solve optimal control problems. While these methods generally assume the dynamics is given in the first order form xdot = f(x, u, t), where x is the state and u is the control vector, robotic systems are typically governed by second order ODEs of the form qddot = g(q, qdot, u, t), where q is the configuration. To convert the second order ODE into a first order one, the usual approach is to introduce a velocity variable v and impose its coincidence with the time derivative of q. Lobatto methods grant this constraint by construction, as their polynomials describing the trajectory for v are the time derivatives of those for q, but the same cannot be said for the Gauss and Radau methods. This is problematic for such methods, as then they cannot guarantee that qddot = g(q, qdot, u, t) at the collocation points. On their negative side, Lobatto methods cannot be used to solve initial value problems, as given the values of u at the collocation points they generate an overconstrained system of equations for the states. In this paper, we propose a Legendre-Gauss collocation method that retains the advantages of the usual Lobatto, Gauss, and Radau methods, while avoiding their shortcomings. The collocation scheme we propose is applicable to solve initial value problems, preserves the consistency between the polynomials for v and q, and ensures that qddot = g(q, qdot, u, t) at the collocation points., This work has been partially supported by the Spanish Agencia Estatal de Investigación under the KINODYN+ project, with reference PID2020-117509GB-I00/AEI/10.13039/50110001103.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Kinematics of a gear-based spherical mechanism

  • Thomas, Federico
Trabajo presentado en el International Symposium on Advances in Robot Kinematics, celebrado en Bilbao (España), del 26 al 30 de junio de 2022, Kazuki Abe and his collaborators have recently presented an actuated gear-based spherical mechanism called ABENICS. It has received a lot of attention, not only because of its eye-catching motions during operation, but also and mostly, because it can successfully be used when large motion ranges and a high stiffness are required. Nevertheless, the main disadvantage of Abe et al.'s design is that it is an over-actuated mechanism: it requires four instead of only three actuators. In this paper, we propose a variation on this mechanism which requires three actuators, thus simplifying its control and its potential cost. The kinematics of this new mechanism is studied in detail, including its forward and inverse kinematics, as well as its singularities., We gratefully acknowledge the financial support of the Spanish Ministry of Economy and Competitiveness through the project PID2020-117509GB-I00.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Direct Collocation Methods for Trajectory Optimization in Constrained Robotic Systems

  • Bordalba, Ricard
  • Schoels, Tobias
  • Ros, Lluís
  • Porta, Josep M.
  • Diehl, Moritz
Direct collocation methods are powerful tools to solve trajectory optimization problems in robotics. While their resulting trajectories tend to be dynamically accurate, they may also present large kinematic errors in the case of constrained mechanical systems, i.e., those whose state coordinates are subject to holonomic or nonholonomic constraints, such as loop-closure or rolling-contact constraints. These constraints confine the robot trajectories to an implicitly-defined manifold, which complicates the computation of accurate solutions. Discretization errors inherent to the transcription of the problem easily make the trajectories drift away from this manifold, which results in physically inconsistent motions that are difficult to track with a controller. This article reviews existing methods to deal with this problem and proposes new ones to overcome their limitations. Current approaches either disregard the kinematic constraints (which leads to drift accumulation) or modify the system dynamics to keep the trajectory close to the manifold (which adds artificial forces or energy dissipation to the system). The methods we propose, in contrast, achieve full drift elimination on the discrete trajectory, or even along the continuous one, without artificial modifications of the system dynamics. We illustrate and compare the methods using various examples of different complexity., This work has been partially funded by the Spanish Ministry of Science, Innovation, and Universities under projects DPI2017-88282-P, and PID2020- 117509GB-I00/AEI/10.13039/50110001103, and by the German Federal Ministry for Economic Affairs and Energy (BMWi) via DyConPV (0324166B).
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Solution methods to the nearest rotation matrix problem in ℝ3: A comparative survey

  • Sarabandi, Soheil
  • Thomas, Federico
This article has supplementary downloadable material available at http:// www.iri.upc.edu/people/thomas/Soft/ComparativeSurvey.zip. This material consists of several Matlab® scripts that permit to reproduce the results presented in Section 4. No particular requirements, except for an installed copy of Matlab®, release 2019b or higher, are needed. Contact Federico Thomas for questions about this material., Nowadays, the singular value decomposition (SVD) is the standard method of choice for solving the nearest rotation matrix problem. Nevertheless, many other methods are available in the literature for the 3D case. This article reviews the most representative ones, proposes alternative ones, and presents a comparative analysis to elucidate their relative computational costs and error performances. This analysis leads to the conclusion that some algebraic closed-form methods are as robust as the SVD, but significantly faster and more accurate., This research has been partially funded by the State Research Agency (AEI), Spain, through project PID2020- 117509GB-I00/AEI/10.13039/50110001103., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

New Bracket Polynomials Associated with the General Gough-Stewart Parallel Robot Singularities

  • Thomas, Federico
Trabajo presentado en el International Conference on Robotics and Automation (ICRA), celebrado en Londres (Reino Unido), del 29 de mayo al 2 de junio de 2023, It is well known that the singularities of a Gough-Stewart platform arise when the determinant of the Plücker coordinates of the robot leg lines vanish. The direct expansion of this determinant in terms of the configuration of the moving platform leads to an intimidating algebraic expression which is difficult to organize in a manner that facilitates extracting geometric conditions for singularities to occur. The use of Grassmann-Cayley algebra has permitted expressing this determinant as a bracket polynomial which is easier to manipulate symbolically. Each monomial in this polynomial is the product of three brackets, 4×4 determinants involving the homogeneous coordinates of four leg attachments. In this paper, we show how to derive, using elementary linear algebra arguments, bracket polynomials where all brackets can be interpreted as reciprocal products between lines. Contrarily to what one might expect, these new bracket polynomials are simpler in general than those previously obtained using Grassmann-Cayley algebra., This work was partially supported by the Spanish Government through project PID2020-117509GB-I00/AEI/10.13039/50110001103, Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Collocation methods for second and higher order systems

  • Moreno-Martín, Siro
  • Ros, Lluís
  • Celaya, Enric
It is often unnoticed that the predominant way to use collocation methods is fundamentally flawed when applied to optimal control in robotics. Such methods assume that the system dynamics is given by a first order ODE, whereas robots are often governed by a second or higher order ODE involving configuration variables and their time derivatives. To apply a collocation method, therefore, the usual practice is to resort to the well known procedure of casting an Mth order ODE into M first order ones. This manipulation, which in the continuous domain is perfectly valid, leads to inconsistencies when the problem is discretized. Since the configuration variables and their time derivatives are approximated with polynomials of the same degree, their differential dependencies cannot be fulfilled, and the actual dynamics is not satisfied, not even at the collocation points. This paper draws attention to this problem, and develops improved versions of the trapezoidal and Hermite–Simpson collocation methods that do not present these inconsistencies. In many cases, the new methods reduce the dynamics transcription error in one order of magnitude, or even more, without noticeably increasing the cost of computing the solutions., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work has been partially funded by Agencia Estatal de Investigación under project Kinodyn+, with reference PID2020-117509GB-I00/AEI /10.13039/50110001103, and by a Ph.D. contract supporting the first author, with reference PRE2018-085582., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

The inverse kinematics of lobster arms

  • Thomas, Federico
  • Porta, Josep M.
The roots of the closure polynomial associated with a given mechanism determine its assembly modes. In the case of 6R closed-loop mechanisms, these polynomials are usually expressed in the half-angle tangent of one of its joints. In this paper, we derive closure polynomials of 6R robots in terms of distances, not angles. The use of a distance-based formulation provides, in general, a fundamental advantage since it leads to closure conditions without requiring neither variable eliminations nor variable substitutions. We restrict our attention, though, to robots with coplanar consecutive joint axes, i.e., robots whose consecutive axes intersect at either proper or improper points. We show that this particular arrangement of joints does not result in a reduction in the maximum number of the inverse kinematic solutions with respect to the general case. Moreover, this family of robots include broadly used offset-wrist arms. For instance, in this paper, we obtain closure polynomials for robots such as the FANUC CRX-10iA/L, the UR10e, and the KUKA LBR iiwa R800 robot in generic form (i.e., as a function of their end-effector locations)., We would also like to gratefully acknowledge the financial support of the Spanish National Plan for Scientific and Technical Research and Innovation through project PID2020-117509GB-I00/MCIN/AEI/10.13039/50110001103., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Finding the Common Tangents to Four Spheres via Dimensionality Reduction

  • Porta, Josep M.
  • Thomas, Federico
One of the advantages of formulating position analysis problems in terms of distances is that the dimension of the problem can be reduced by projecting the problem onto a subspace. Although, in general, this operation does not provide a significant advantage, when parallelism or alignment constraints must be enforced, a proper projection results in an important simplification. This is the case when computing the common tangents to four spheres in R3. In this paper, we first show how this problem can be formulated in terms of just five points in R2 thanks to projection, and then this is applied to solve the forward kinematics of the 4-SPC parallel robot., This work was partially supported by the Spanish National Plan for Scientific and Technical Research and Innovation through the project PID2020-117509GB-I00/AEI/ 10.13039/50110001103., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Fixed Points in Distance Recurrence Formulas

  • Thomas, Federico
This paper shows how the position analysis of mechanisms with coupling number one can be solved by computing the fixed points of monotonic recurrent formulas. This new approach is directly elaborated on the 3-RPR planar mechanism., This work has been partially supported by the Spanish National Plan for Scientific and Technical Research and Innovation through project PID2020-117509GB-I00/AEI/ 10.13039/50110001103)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

On closed-form solutions to the 4D nearest rotation matrix problem

  • Sarabandi, Soheil
  • Thomas, Federico
In this paper, we address the problem of restoring the orthogonality of a numerically noisy 4D rotation matrix by finding its nearest (in Frobenius norm) correct rotation matrix. This problem can be straightforwardly solved using the Singular Value Decomposition (SVD). Nevertheless, to avoid numerical methods, we present two new closed-form methods. One relies on the direct minimization of the mentioned Frobenius norm, and the other on the passage to double quaternion representation. A comparison of these two methods with respect to the SVD reveals that the method based on a double quaternion representation is superior in all aspects., This work was partially supported by the Spanish Government through project PID2020-117509GB-I00/AEI/10.13039/50110001103., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Formulating the Unicycle on the Sphere Path Planning Problem as a Linear Time-Varying System

  • Thomas, Federico
  • Franch, Jaume
The kinematics, dynamics, and control of a unicycle moving without slipping on a plane has been extensively studied in the literature of nonholonomic mechanical systems. However, since planar motion can be seen as a limiting case of the motion on a sphere, we focus our analysis on the more general spherical case. This article introduces a novel approach to path planning for a unicycle rolling on a sphere while satisfying the nonslipping constraint. Our method is based on a simple yet effective idea: first, we model the system as a linear time-varying dynamic system. Then, leveraging the fact that certain such systems can be integrated under specific algebraic conditions, we derive a closed-form expression for the control variables. This formulation includes three free parameters, which can be tuned to generate a path connecting any two configurations of the unicycle. Notably, our approach requires no prior knowledge of nonholonomic system analysis, making it accessible to a broader audience., This work was supported by the Spanish National Plan for Scientific and Technical Research and Innovation through project PID2020-117509GB-I00/MCIN/AEI/10.13039/50110001103., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Supersurfaces for grasping, scene generation and contact modeling

  • Badia Torres, Joan
  • Garrido, Lidia
  • Perez-Gracia, Alba
In this work we study the use of superquadrics and superquartics for grasping and contact detection. We include an overview of the different formulations that have been derived from the superquadrics, and we group all these under the denomination of supersurfaces: superquadrics, superquartics, hyperquadrics, superfigures, deformed superquadrics and combination of superquadrics. The focus of this work is in the formulation of superellipsoids and supertoroids, with derivations for their differential geometric properties and distance formulations. We apply this to grasp synthesis and to formulations for the contact between objects., This work has been partially supported by Agencia Estatal de Investigación under project PID2020-117509GB-I00 / AEI / 10.13039/50110001103; and by the European Union’s Horizon Europe Research and Innovation Programme under Grant Agreement N̊ 101096352., Peer reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Supersurfaces for grasping, scene generation and contact modeling

  • Badia Torres, Joan
  • Garrido Reus, Lidia
  • Pérez Gracia, Alba|||0000-0002-6023-7857
In this work we study the use of superquadrics and superquartics for grasping and contact detection. We include an overview of the different formulations that have been derived from the superquadrics, and we group all these under the denomination of supersurfaces: superquadrics, superquartics, hyperquadrics, superfigures, deformed superquadrics and combination of superquadrics. The focus of this work is in the formulation of superellipsoids and supertoroids, with derivations for their differential geometric properties and distance formulations. We apply this to grasp synthesis and to formulations for the contact between objects., This work has been partially supported by Agencia Estatal de Investigación under project PID2020-117509GB-I00 / AEI / 10.13039/50110001103; and by the European Union’s Horizon Europe Research and Innovation Programme under Grant Agreement N˚ 101096352., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Direct collocation methods for trajectory optimization in constrained robotic systems

  • Bordalba Llaberia, Ricard
  • Schoels, Tobias
  • Ros Giralt, Lluís|||0000-0002-8338-6062
  • Porta Pleite, Josep Maria|||0000-0002-5056-1717
  • Diehl, Moritzz
© 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., Direct collocation methods are powerful tools to solve trajectory optimization problems in robotics. While their resulting trajectories tend to be dynamically accurate, they may also present large kinematic errors in the case of constrained mechanical systems, i.e., those whose state coordinates are subject to holonomic or nonholonomic constraints, such as loop-closure or rolling-contact constraints. These constraints confine the robot trajectories to an implicitly-defined manifold, which complicates the computation of accurate solutions. Discretization errors inherent to the transcription of the problem easily make the trajectories drift away from this manifold, which results in physically inconsistent motions that are difficult to track with a controller. This article reviews existing methods to deal with this problem and proposes new ones to overcome their limitations. Current approaches either disregard the kinematic constraints (which leads to drift accumulation) or modify the system dynamics to keep the trajectory close to the manifold (which adds artificial forces or energy dissipation to the system). The methods we propose, in contrast, achieve full drift elimination on the discrete trajectory, or even along the continuous one, without artificial modifications of the system dynamics. We illustrate and compare the methods using various examples of different complexity., This work was supported in part by the Spanish Ministry of Science, Innovation, and Universities under Project DPI2017-88282-P and Project PID2020-117509GBI00/AEI/10.13039/50110001103 and in part by the German Federal Ministry for Economic Affairs and Energy (BMWi) via DyConPV (0324166B), Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Formulating the unicycle on the sphere path planning problem as a linear time-varying system

  • Thomas, Federico|||0000-0001-9341-5528
  • Franch Bullich, Jaume|||0000-0002-6257-9113
© 2025 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., The kinematics, dynamics, and control of a unicycle moving without slipping on a plane has been extensively studied in the literature of nonholonomic mechanical systems. However, since planar motion can be seen as a limiting case of the motion on a sphere, we focus our analysis on the more general spherical case. This paper introduces a novel approach to path planning for a unicycle rolling on a sphere while satisfying the non-slipping constraint. Our method is based on a simple yet effective idea: first, we model the system as a linear time-varying dynamic system. Then, leveraging the fact that certain such systems can be integrated under specific algebraic conditions, we derive a closed-form expression for the control variables. This formulation includes three free parameters, which can be tuned to generate a path connecting any two configurations of the unicycle. Notably, our approach requires no prior knowledge of nonholonomic system analysis, making it accessible to a broader audience., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

On closed-form solutions to the 4D nearest rotation matrix problem

  • Sarabandi, Soheil|||0000-0002-2103-1610
  • Thomas, Federico|||0000-0001-9341-5528
This is an open access article under the terms of the Creative Commons Attribution-NonCommercial-NoDerivs License, which permits use and distribution in any medium, provided the original work is properly cited, the use is non-commercial and no modifications or adaptations are made. © 2022 The Authors. Mathematical Methods in the Applied Sciences published by John Wiley & Sons, Ltd., In this paper, we address the problem of restoring the orthogonality of a numerically noisy 4D rotation matrix by finding its nearest (in Frobenius norm) correct rotation matrix. This problem can be straightforwardly solved using the Singular Value Decomposition (SVD). Nevertheless, to avoid numerical methods, we present two new closed-form methods. One relies on the direct minimization of the mentioned Frobenius norm, and the other on the passage to double quaternion representation. A comparison of these two methods with respect to the SVD reveals that the method based on a double quaternion representation is superior in all aspects., Spanish Ministry of Economy andCompetitiveness, Grant/Award Number:PID2020-117509GB-I00/AEI/10.13039/50110001103, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

The inverse kinematics of lobster arms

  • Thomas, Federico|||0000-0001-9341-5528
  • Porta Pleite, Josep Maria|||0000-0002-5056-1717
© 2024 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/)., The roots of the closure polynomial associated with a given mechanism determine its assembly modes. In the case of 6R closed-loop mechanisms, these polynomials are usually expressed in the half-angle tangent of one of its joints. In this paper, we derive closure polynomials of 6R robots in terms of distances, not angles. The use of a distance-based formulation provides, in general, a fundamental advantage since it leads to closure conditions without requiring neither variable eliminations nor variable substitutions. We restrict our attention, though, to robots with coplanar consecutive joint axes, i.e., robots whose consecutive axes intersect at either proper or improper points. We show that this particular arrangement of joints does not result in a reduction in the maximum number of the inverse kinematic solutions with respect to the general case. Moreover, this family of robots include broadly used offset-wrist arms. For instance, in this paper, we obtain closure polynomials for robots such as the FANUC CRX-10iA/L, the UR10e, and the KUKA LBR iiwa R800 robot in generic form (i.e., as a function of their end-effector locations)., acknowledge the financial support of the Spanish National Plan for Scientific and Technical Research and Innovation through project PID2020-117509GB-I00/MCIN/AEI/10.13039/50110001103, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

New bracket polynomials associated with the general gough-stewart parallel robot singularities

  • Thomas, Federico|||0000-0001-9341-5528
© 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., It is well known that the singularities of a Gough-Stewart platform arise when the determinant of the Plücker coordinates of the robot leg lines vanish. The direct expansion of this determinant in terms of the configuration of the moving platform leads to an intimidating algebraic expression which is difficult to organize in a manner that facilitates extracting geometric conditions for singularities to occur. The use of Grassmann-Cayley algebra has permitted expressing this determinant as a bracket polynomial which is easier to manipulate symbolically. Each monomial in this polynomial is the product of three brackets, 4×4 determinants involving the homogeneous coordinates of four leg attachments. In this paper, we show how to derive, using elementary linear algebra arguments, bracket polynomials where all brackets can be interpreted as reciprocal products between lines. Contrarily to what one might expect, these new bracket polynomials are simpler in general than those previously obtained using Grassmann-Cayley algebra., This work was partially supported by the Spanish Government through project PID2020-117509GB-I00/AEI/10.13039/50110001103., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Collocation methods for second and higher order systems

  • Moreno Martín, Siro|||0000-0001-9460-8858
  • Ros Giralt, Lluís|||0000-0002-8338-6062
  • Celaya Llover, Enric|||0000-0001-8480-7706
It is often unnoticed that the predominant way to use collocation methods is fundamentally flawed when applied to optimal control in robotics. Such methods assume that the system dynamics is given by a first order ODE, whereas robots are often governed by a second or higher order ODE involving configuration variables and their time derivatives. To apply a collocation method, therefore, the usual practice is to resort to the well known procedure of casting an Mth order ODE into M first order ones. This manipulation, which in the continuous domain is perfectly valid, leads to inconsistencies when the problem is discretized. Since the configuration variables and their time derivatives are approximated with polynomials of the same degree, their differential dependencies cannot be fulfilled, and the actual dynamics is not satisfied, not even at the collocation points. This paper draws attention to this problem, and develops improved versions of the trapezoidal and Hermite-Simpson collocation methods that do not present these inconsistencies. In many cases, the new methods reduce the dynamic transcription error in one order of magnitude, or even more, without noticeably increasing the cost of computing the solutions., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work has been partially funded by Agencia Estatal de Investigación under project Kinodyn+, with reference PID2020-117509GB-I00/AEI /10.13039/50110001103, and by a Ph.D. contract supporting the first author, with reference PRE2018-085582., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Solution methods to the nearest rotation matrix problem in R3: a comparative survey

  • Sarabandi, Soheil|||0000-0002-2103-1610
  • Thomas, Federico|||0000-0001-9341-5528
Nowadays, the singular value decomposition (SVD) is the standard method of choice for solving the nearest rotation matrix problem. Nevertheless, many other methods are available in the literature for the 3D case. This article reviews the most representative ones, proposes alternative ones, and presents a comparative analysis to elucidate their relative computational costs and error performances. This analysis leads to the conclusion that some algebraic closed-form methods are as robust as the SVD, but significantly faster and more accurate., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

On closed-form solutions to the 4D nearest rotation matrix problem

  • Sarabandi, Soheil
  • Thomas, Federico
This is an open access article under the terms of the Creative Commons Attribution-NonCommercial-NoDerivs License, which permits use and distribution in any medium, provided the original work is properly cited, the use is non-commercial and no modifications or adaptations are made. © 2022 The Authors. Mathematical Methods in the Applied Sciences published by John Wiley & Sons, Ltd., In this paper, we address the problem of restoring the orthogonality of a numerically noisy 4D rotation matrix by finding its nearest (in Frobenius norm) correct rotation matrix. This problem can be straightforwardly solved using the Singular Value Decomposition (SVD). Nevertheless, to avoid numerical methods, we present two new closed-form methods. One relies on the direct minimization of the mentioned Frobenius norm, and the other on the passage to double quaternion representation. A comparison of these two methods with respect to the SVD reveals that the method based on a double quaternion representation is superior in all aspects., Spanish Ministry of Economy andCompetitiveness, Grant/Award Number:PID2020-117509GB-I00/AEI/10.13039/50110001103, Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Supersurfaces for grasping, scene generation and contact modeling

  • Badia Torres, Joan
  • Garrido Reus, Lidia
  • Pérez Gracia, Alba
In this work we study the use of superquadrics and superquartics for grasping and contact detection. We include an overview of the different formulations that have been derived from the superquadrics, and we group all these under the denomination of supersurfaces: superquadrics, superquartics, hyperquadrics, superfigures, deformed superquadrics and combination of superquadrics. The focus of this work is in the formulation of superellipsoids and supertoroids, with derivations for their differential geometric properties and distance formulations. We apply this to grasp synthesis and to formulations for the contact between objects., This work has been partially supported by Agencia Estatal de Investigación under project PID2020-117509GB-I00 / AEI / 10.13039/50110001103; and by the European Union’s Horizon Europe Research and Innovation Programme under Grant Agreement N˚ 101096352., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Collocation methods for second and higher order systems

  • Moreno Martín, Siro
  • Ros Giralt, Lluís
  • Celaya Llover, Enric
It is often unnoticed that the predominant way to use collocation methods is fundamentally flawed when applied to optimal control in robotics. Such methods assume that the system dynamics is given by a first order ODE, whereas robots are often governed by a second or higher order ODE involving configuration variables and their time derivatives. To apply a collocation method, therefore, the usual practice is to resort to the well known procedure of casting an Mth order ODE into M first order ones. This manipulation, which in the continuous domain is perfectly valid, leads to inconsistencies when the problem is discretized. Since the configuration variables and their time derivatives are approximated with polynomials of the same degree, their differential dependencies cannot be fulfilled, and the actual dynamics is not satisfied, not even at the collocation points. This paper draws attention to this problem, and develops improved versions of the trapezoidal and Hermite-Simpson collocation methods that do not present these inconsistencies. In many cases, the new methods reduce the dynamic transcription error in one order of magnitude, or even more, without noticeably increasing the cost of computing the solutions., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work has been partially funded by Agencia Estatal de Investigación under project Kinodyn+, with reference PID2020-117509GB-I00/AEI /10.13039/50110001103, and by a Ph.D. contract supporting the first author, with reference PRE2018-085582., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

New bracket polynomials associated with the general gough-stewart parallel robot singularities

  • Thomas, Federico
© 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., It is well known that the singularities of a Gough-Stewart platform arise when the determinant of the Plücker coordinates of the robot leg lines vanish. The direct expansion of this determinant in terms of the configuration of the moving platform leads to an intimidating algebraic expression which is difficult to organize in a manner that facilitates extracting geometric conditions for singularities to occur. The use of Grassmann-Cayley algebra has permitted expressing this determinant as a bracket polynomial which is easier to manipulate symbolically. Each monomial in this polynomial is the product of three brackets, 4×4 determinants involving the homogeneous coordinates of four leg attachments. In this paper, we show how to derive, using elementary linear algebra arguments, bracket polynomials where all brackets can be interpreted as reciprocal products between lines. Contrarily to what one might expect, these new bracket polynomials are simpler in general than those previously obtained using Grassmann-Cayley algebra., This work was partially supported by the Spanish Government through project PID2020-117509GB-I00/AEI/10.13039/50110001103., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Solution methods to the nearest rotation matrix problem in R3: a comparative survey

  • Sarabandi, Soheil
  • Thomas, Federico
Nowadays, the singular value decomposition (SVD) is the standard method of choice for solving the nearest rotation matrix problem. Nevertheless, many other methods are available in the literature for the 3D case. This article reviews the most representative ones, proposes alternative ones, and presents a comparative analysis to elucidate their relative computational costs and error performances. This analysis leads to the conclusion that some algebraic closed-form methods are as robust as the SVD, but significantly faster and more accurate., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Direct collocation methods for trajectory optimization in constrained robotic systems

  • Bordalba Llaberia, Ricard
  • Schoels, Tobias
  • Ros Giralt, Lluís
  • Porta Pleite, Josep Maria
  • Diehl, Moritzz
© 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., Direct collocation methods are powerful tools to solve trajectory optimization problems in robotics. While their resulting trajectories tend to be dynamically accurate, they may also present large kinematic errors in the case of constrained mechanical systems, i.e., those whose state coordinates are subject to holonomic or nonholonomic constraints, such as loop-closure or rolling-contact constraints. These constraints confine the robot trajectories to an implicitly-defined manifold, which complicates the computation of accurate solutions. Discretization errors inherent to the transcription of the problem easily make the trajectories drift away from this manifold, which results in physically inconsistent motions that are difficult to track with a controller. This article reviews existing methods to deal with this problem and proposes new ones to overcome their limitations. Current approaches either disregard the kinematic constraints (which leads to drift accumulation) or modify the system dynamics to keep the trajectory close to the manifold (which adds artificial forces or energy dissipation to the system). The methods we propose, in contrast, achieve full drift elimination on the discrete trajectory, or even along the continuous one, without artificial modifications of the system dynamics. We illustrate and compare the methods using various examples of different complexity., This work was supported in part by the Spanish Ministry of Science, Innovation, and Universities under Project DPI2017-88282-P and Project PID2020-117509GBI00/AEI/10.13039/50110001103 and in part by the German Federal Ministry for Economic Affairs and Energy (BMWi) via DyConPV (0324166B), Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

The inverse kinematics of lobster arms

  • Thomas, Federico
  • Porta Pleite, Josep Maria
© 2024 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/)., The roots of the closure polynomial associated with a given mechanism determine its assembly modes. In the case of 6R closed-loop mechanisms, these polynomials are usually expressed in the half-angle tangent of one of its joints. In this paper, we derive closure polynomials of 6R robots in terms of distances, not angles. The use of a distance-based formulation provides, in general, a fundamental advantage since it leads to closure conditions without requiring neither variable eliminations nor variable substitutions. We restrict our attention, though, to robots with coplanar consecutive joint axes, i.e., robots whose consecutive axes intersect at either proper or improper points. We show that this particular arrangement of joints does not result in a reduction in the maximum number of the inverse kinematic solutions with respect to the general case. Moreover, this family of robots include broadly used offset-wrist arms. For instance, in this paper, we obtain closure polynomials for robots such as the FANUC CRX-10iA/L, the UR10e, and the KUKA LBR iiwa R800 robot in generic form (i.e., as a function of their end-effector locations)., acknowledge the financial support of the Spanish National Plan for Scientific and Technical Research and Innovation through project PID2020-117509GB-I00/MCIN/AEI/10.13039/50110001103, Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Formulating the unicycle on the sphere path planning problem as a linear time-varying system

  • Thomas, Federico
  • Franch Bullich, Jaume
© 2025 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., The kinematics, dynamics, and control of a unicycle moving without slipping on a plane has been extensively studied in the literature of nonholonomic mechanical systems. However, since planar motion can be seen as a limiting case of the motion on a sphere, we focus our analysis on the more general spherical case. This paper introduces a novel approach to path planning for a unicycle rolling on a sphere while satisfying the non-slipping constraint. Our method is based on a simple yet effective idea: first, we model the system as a linear time-varying dynamic system. Then, leveraging the fact that certain such systems can be integrated under specific algebraic conditions, we derive a closed-form expression for the control variables. This formulation includes three free parameters, which can be tuned to generate a path connecting any two configurations of the unicycle. Notably, our approach requires no prior knowledge of nonholonomic system analysis, making it accessible to a broader audience., Peer Reviewed, Postprint (author's final draft)