Pasar al contenido principal

Resultados relacionados

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

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

A Convolutional Neural Network for the automatic diagnosis of collagen VI-related muscular dystrophies

  • Bazaga, Adrián
  • Roldán, Mònica
  • Badosa, Carmen
  • Jiménez-Mallebrera, Cecilia
  • Porta, Josep M.
The development of machine learning systems for the diagnosis of rare diseases is challenging, mainly due to the lack of data to study them. This paper surmounts this obstacle and presents the first Computer-Aided Diagnosis (CAD) system for low-prevalence collagen VI-related congenital muscular dystrophies. The proposed CAD system works on images of fibroblast cultures obtained with a confocal microscope and relies on a Convolutional Neural Network (CNN) to classify patches of such images in two classes: samples from healthy persons and samples from persons affected by a collagen VI-related muscular distrophy. This fine-grained classification is then used to generate an overall diagnosis on the query image using a majority voting scheme. The proposed system is advantageous, as it overcomes the lack of training data, points to the possibly problematic areas in the query images, and provides a global quantitative evaluation of the condition of the patients, which is fundamental to monitor the effectiveness of potential therapies. The system achieves a high classification performance, with 95% of accuracy and 92% of precision on randomly selected independent test images, outperforming alternative approaches by a significant margin., Adrián Bazaga was supported by a JAE-intro scholarship granted by the Spanish Council of Scientific Research, and acknowledges funding from Innovate UK under grant number KTP011266. Josep M. Porta is supported by the Spanish Ministry of Economy and Competitiveness under project DPI2017-88282-P. Cecilia Jiménez-Mallebrera and Carmen Badosa are funded by the Health Institute ’Carlos III’ (ISCIII, Spain) and the European Regional Development Fund (ERDF/FEDER), ’A way of making Europe’, grants references PI16/00579, PI19/00122 and CP09/00011, and Fundación Noelia .
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

A survey on the computation of quaternions from rotation matrices

  • Sarabandi, Soheil
  • Thomas, Federico
The parameterization of rotations is a central topic in many theoretical and applied fields such as rigid body mechanics, multibody dynamics, robotics, spacecraft attitude dynamics, navigation, three-dimensional image processing, and computer graphics. Nowadays, the main alternative to the use of rotation matrices, to represent rotations in ℝ 3, is the use of Euler parameters arranged in quaternion form. Whereas the passage from a set of Euler parameters to the corresponding rotation matrix is unique and straightforward, the passage from a rotation matrix to its corresponding Euler parameters has been revealed to be somewhat tricky if numerical aspects are considered. Since the map from quaternions to 3 × 3 rotation matrices is a 2-to-1 covering map, this map cannot be smoothly inverted. As a consequence, it is erroneously assumed that all inversions should necessarily contain singularities that arise in the form of quotients where the divisor can be arbitrarily small. This misconception is herein clarified. This paper reviews the most representative methods available in the literature, including a comparative analysis of their computational costs and error performances. The presented analysis leads to the conclusion that Cayley's factorization, a little-known method used to compute the double quaternion representation of rotations in four dimensions from 4 × 4 rotation matrices, is the most robust method when particularized to three dimensions., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness through projects DPI2014-57220-C2-2-P, DPI2017-88282- P, and MDM-2016-0656.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

On Cayley’s Factorization with an Application to the Orthonormalization of Noisy Rotation Matrices

  • Sarabandi, Soheil
  • Perez-Gracia, Alba
  • Thomas, Federico
A real orthogonal matrix representing a rotation in four dimensions can be decomposed into the commutative product of a left- and a right-isoclinic rotation matrix. This operation, known as Cayley’s factorization, directly provides the double quaternion representation of rotations in four dimensions. This factorization can be performed without divisions, thus avoiding the common numerical issues attributed to the computation of quaternions from rotation matrices. In this paper, it is shown how this result is particularly useful, when particularized to three dimensions, to re-orthonormalize a noisy rotation matrix by converting it to quaternion form and then obtaining back the corresponding proper rotation matrix. This re-orthonormalization method is commonly implemented using the Shepperd–Markley method, but the method derived here is shown to outperform it by returning results closer to those obtained using the singular value decomposition which are known to be optimal in terms of the Frobenius norm., Fuding was provided by Ministerio de Economía y Competitividad (Grant no. DPI2017-88282-P), Ministerio de Economía y Competitividad (Grant no. MDM-2016-0656) and National Science Foundation (Grant no. 1208385).
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Solution intervals for variables in spatial RCRCR linkages

  • Celaya, Enric
An analytic method to compute the solution intervals for the input variables of spatial RCRCR linkages and their inversions is presented. The input-output equation is formulated as the intersection of a single ellipse with a parameterized family of ellipses, both related with the possible values that certain dual angles determined by the configuration of the mechanism can take. Bounds for the angles of the input pairs of the RCRCR and RRCRC inversions are found by imposing the tangency of two ellipses, what reduces to analyzing the discriminant of a fourth degree polynomial. The bounds for the input pair of the RCRRC inversion is found as the intersection of a single ellipse with the envelope of the parameterized family of ellipses. The method provides the bounds of each of the assembly modes of the mechanism as well as the local extrema that may exist for the input variable., This work is supported by the Spanish Ministry of Economy and Competitiveness(MINECO) through the I+D projects DPI2014-57220-C2-2-P and DPI2017-88282-P.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

On Closed-Form Formulas for the 3-D Nearest Rotation Matrix Problem

  • Sarabandi, Soheil
  • Shabani, Arya
  • Porta, Josep M.
  • Thomas, Federico
The problem of restoring the orthonormality of a noisy rotation matrix by finding its nearest correct rotation matrix arises in many areas of robotics, computer graphics, and computer vision. When the Frobenius norm is taken as the measure of closeness, the solution is usually computed using the singular value decomposition (SVD). A closed-form formula exists but, as it involves the roots of a polynomial of third degree, it is assumed to be too complicated and numerically ill-conditioned. In this article, we show how, by carefully using some algebraic recipes scattered in the literature, it is possible to derive a simple and yet numerically stable formula for most practical applications. Moreover, by relying on a result that permits obtaining the quaternion corresponding to the sought optimal rotation matrix, we present another closed-form formula that provides a good approximation to the optimal one using only the elementary algebraic operations of addition, subtraction, multiplication, and division. These two closed-form formulas are compared with respect to the SVD in terms of accuracy and computational cost., This work was partially supported by the Spanish Ministry of Economy and Competitiveness through the projects DPI2017-88282-P and MDM-2016-0656.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Position and Singularity Analysis of a Class of Planar Parallel Manipulators with a Reconfigurable End-Effector

  • Marchi, Tommaso
  • Mottola, Giovanni
  • Porta, Josep M.
  • Thomas, Federico
  • Carricato, Marco
Parallel robots with configurable platforms are a class of robots in which the end-effector has an inner mobility, so that its overall shape can be reconfigured: in most cases, the end-effector is thus a closed-loop kinematic chain composed of rigid links. These robots have a greater flexibility in their motion and control with respect to rigid-platform parallel architectures, but their kinematics is more challenging to analyze. In our work, we consider <i>n</i>-<span style="text-decoration: underline;">R</span>RR planar configurable robots, in which the end-effector is a chain composed of <i>n</i> links and revolute joints, and is controlled by <i>n</i> rotary actuators located on the base of the mechanism. In particular, we study the geometrical design of such robots and their direct and inverse kinematics for <inline-formula><math display="inline"><semantics><mrow><mi>n</mi><mo>=</mo><mn>4</mn></mrow></semantics></math></inline-formula>, <inline-formula><math display="inline"><semantics><mrow><mi>n</mi><mo>=</mo><mn>5</mn></mrow></semantics></math></inline-formula> and <inline-formula><math display="inline"><semantics><mrow><mi>n</mi><mo>=</mo><mn>6</mn></mrow></semantics></math></inline-formula>; we employ the bilateration method, which can simplify the kinematic analysis and allows us to generalize the approach and the results obtained for the 3-<span style="text-decoration: underline;">R</span>RR mechanism to <i>n</i>-<span style="text-decoration: underline;">R</span>RR robots (with <inline-formula><math display="inline"><semantics><mrow><mi>n</mi><mo>></mo><mn>3</mn></mrow></semantics></math></inline-formula>). Then, we study the singularity configurations of these robot architectures. Finally, we present the results from experimental tests that have been performed on a 5–<span style="text-decoration: underline;">R</span>RR robot prototype., This research was funded by the Spanish Ministry of Economy and Competitiveness grants number DPI2017-88282-P and MDM-2016-0656. The APC was funded by Marco Carricato., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

A branch-and-prune method to solve closure equations in dual quaternions

  • Shabani, Arya
  • Porta, Josep M.
  • Thomas, Federico
Using dual quaternions, the closure equations of a kinematic loop can be expressed as a system of multiaffine equations. In this paper, this property is leveraged to introduce a branch-and-prune method specially tailored for solving such systems of equations. The new method is objectively simpler (in the sense that it is easier to understand and to implement) than previous approaches relying on general techniques such as interval Newton methods or methods based on Bernstein polynomials or linear relaxations. Moreover, it relies on two basic operations — linear interpolation and projection onto coordinate planes— that can be efficiently computed. The generality of the proposed method is evaluated on position analysis problems with 0-, 1-, and 2-dimensional solution sets, including the inverse kinematics of serial robots and the forward kinematics of parallel ones. The results obtained on these problems show that the efficiency of the method compares favorably to state-of-the-art alternatives., This work was partially supported by the Spanish Ministry of Economy and Competitiveness through the project DPI2017-88282-P.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación 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
Publicación 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).
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Position and singularity analysis of a class of planar parallel manipulators with a reconfigurable end-effector

  • Marchi, Tommaso
  • Mottola, Giovanni
  • Porta Pleite, Josep Maria|||0000-0002-5056-1717
  • Thomas, Federico|||0000-0001-9341-5528
  • Carricato, Marco
Parallel robots with configurable platforms are a class of robots in which the end-effector has an inner mobility, so that its overall shape can be reconfigured: in most cases, the end-effector is thus a closed-loop kinematic chain composed of rigid links. These robots have a greater flexibility in their motion and control with respect to rigid-platform parallel architectures, but their kinematics is more challenging to analyze. In our work, we consider n-RRR planar configurable robots, in which the end-effector is a chain composed of n links and revolute joints, and is controlled by n rotary actuators located on the base of the mechanism. In particular, we study the geometrical design of such robots and their direct and inverse kinematics for n = 4, n = 5 and n = 6; we employ the bilateration method, which can simplify the kinematic analysis and allows us to generalize the approach and the results obtained for the 3-RRR mechanism to n-RRR robots (with n > 3). Then, we study the singularity configurations of these robot architectures. Finally, we present the results from experimental tests that have been performed on a 5–RRR robot prototype., This research was funded by the Spanish Ministry of Economy and Competitiveness grants number DPI2017-88282-P and MDM-2016-0656. The APC was funded by Marco Carricato., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Hand-eye calibration made easy through a closed-form two-stage method

  • Sarabandi, Soheil|||0000-0002-2103-1610
  • Porta Pleite, Josep Maria|||0000-0002-5056-1717
  • Thomas, Federico|||0000-0001-9341-5528
© 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, 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 hand-eye calibration problem is uninspiring because it is assumed to be well-solved, we show in this paper 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., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

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

  • Sarabandi, Soheil|||0000-0002-2103-1610
  • Thomas, Federico|||0000-0001-9341-5528
© 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, 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., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A branch-and-prune method to solve closure equations in dual quaternions

  • Shabani, Arya
  • Porta Pleite, Josep Maria|||0000-0002-5056-1717
  • Thomas, Federico|||0000-0001-9341-5528
© 2021 Elsevier, Using dual quaternions, the closure equations of a kinematic loop can be expressed as a system of multiaffine quations. In this paper, this property is leveraged to introduce a branch-and-prune method specially tailored for solving such systems of equations. The new method is objectively simpler (in the sense that it is easier to understand and to implement) than previous approaches relying on general techniques such as interval Newton methods or methods based on Bernstein polynomials or linear relaxations. Moreover, it relies on two basic operations —linear interpolation and projection onto coordinate planes— that can be e¿ciently computed. The generality of the proposed method is evaluated on position analysis problems with 0-, 1-, and 2-dimensional solution sets, including the inverse kinematics of serial robots and the forward kinematics of parallel ones. The results obtained on these problems show that the efficiency of the method compares favorably to state-of-the-art alternatives., This work was partially supported by the Spanish Ministry of Economy and Competitiveness through the project DPI2017- 88282-P., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación 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
Publicación Artículo científico (JournalArticle)

A randomised kinodynamic planner for closed-chain robotic systems

  • Bordalba Llaberia, Ricard
  • Ros Giralt, Lluís|||0000-0002-8338-6062
  • Porta Pleite, Josep Maria|||0000-0002-5056-1717
© 2021 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, Kinodynamic rapidly-exploring random tree (RRT) planners are effective tools for finding feasible trajectories in many classes of robotic systems. However, they are hard to apply to systems with closed-kinematic chains, like parallel robots, collaborative arms manipulating an object, or legged robots keeping their feet in contact with the environment. The state space of such systems is an implicitly-defined manifold that complicates the design of the sampling and steering procedures, and leads to trajectories that drift from the manifold if standard integration methods are used. To address these issues, this article presents a kinodynamic RRT planner that constructs an atlas of the state space incrementally, and uses this atlas to generate random states, and to dynamically steer the system toward such states. The steering method exploits the atlas charts to compute locally optimal controls based on linear quadratic regulators. The atlas also allows the integration of the equations of motion using local coordinates, which eliminates any drift from the state space manifold and results in accurate trajectories. To the best of our knowledge, this is the first kinodynamic planner that explicitly takes closed kinematic chains into account. In this article, we illustrate the planner performance in significantly complex tasks involving planar and spatial robots that have to lift or throw a load using torque-limited actuators., This work has been partially funded by the Spanish Ministry of Science,Innovation, and Universities under project DPI2017-88282-P, Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A branch-and-prune method to solve closure equations in dual quaternions

  • Shabani, Arya
  • Porta Pleite, Josep Maria
  • Thomas, Federico
© 2021 Elsevier, Using dual quaternions, the closure equations of a kinematic loop can be expressed as a system of multiaffine quations. In this paper, this property is leveraged to introduce a branch-and-prune method specially tailored for solving such systems of equations. The new method is objectively simpler (in the sense that it is easier to understand and to implement) than previous approaches relying on general techniques such as interval Newton methods or methods based on Bernstein polynomials or linear relaxations. Moreover, it relies on two basic operations —linear interpolation and projection onto coordinate planes— that can be e¿ciently computed. The generality of the proposed method is evaluated on position analysis problems with 0-, 1-, and 2-dimensional solution sets, including the inverse kinematics of serial robots and the forward kinematics of parallel ones. The results obtained on these problems show that the efficiency of the method compares favorably to state-of-the-art alternatives., This work was partially supported by the Spanish Ministry of Economy and Competitiveness through the project DPI2017- 88282-P., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Hand-eye calibration made easy through a closed-form two-stage method

  • Sarabandi, Soheil
  • Porta Pleite, Josep Maria
  • Thomas, Federico
© 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, 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 hand-eye calibration problem is uninspiring because it is assumed to be well-solved, we show in this paper 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., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A randomised kinodynamic planner for closed-chain robotic systems

  • Bordalba Llaberia, Ricard
  • Ros Giralt, Lluís
  • Porta Pleite, Josep Maria
© 2021 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, Kinodynamic rapidly-exploring random tree (RRT) planners are effective tools for finding feasible trajectories in many classes of robotic systems. However, they are hard to apply to systems with closed-kinematic chains, like parallel robots, collaborative arms manipulating an object, or legged robots keeping their feet in contact with the environment. The state space of such systems is an implicitly-defined manifold that complicates the design of the sampling and steering procedures, and leads to trajectories that drift from the manifold if standard integration methods are used. To address these issues, this article presents a kinodynamic RRT planner that constructs an atlas of the state space incrementally, and uses this atlas to generate random states, and to dynamically steer the system toward such states. The steering method exploits the atlas charts to compute locally optimal controls based on linear quadratic regulators. The atlas also allows the integration of the equations of motion using local coordinates, which eliminates any drift from the state space manifold and results in accurate trajectories. To the best of our knowledge, this is the first kinodynamic planner that explicitly takes closed kinematic chains into account. In this article, we illustrate the planner performance in significantly complex tasks involving planar and spatial robots that have to lift or throw a load using torque-limited actuators., This work has been partially funded by the Spanish Ministry of Science,Innovation, and Universities under project DPI2017-88282-P, Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Position and singularity analysis of a class of planar parallel manipulators with a reconfigurable end-effector

  • Marchi, Tommaso
  • Mottola, Giovanni
  • Porta Pleite, Josep Maria
  • Thomas, Federico
  • Carricato, Marco
Parallel robots with configurable platforms are a class of robots in which the end-effector has an inner mobility, so that its overall shape can be reconfigured: in most cases, the end-effector is thus a closed-loop kinematic chain composed of rigid links. These robots have a greater flexibility in their motion and control with respect to rigid-platform parallel architectures, but their kinematics is more challenging to analyze. In our work, we consider n-RRR planar configurable robots, in which the end-effector is a chain composed of n links and revolute joints, and is controlled by n rotary actuators located on the base of the mechanism. In particular, we study the geometrical design of such robots and their direct and inverse kinematics for n = 4, n = 5 and n = 6; we employ the bilateration method, which can simplify the kinematic analysis and allows us to generalize the approach and the results obtained for the 3-RRR mechanism to n-RRR robots (with n > 3). Then, we study the singularity configurations of these robot architectures. Finally, we present the results from experimental tests that have been performed on a 5–RRR robot prototype., This research was funded by the Spanish Ministry of Economy and Competitiveness grants number DPI2017-88282-P and MDM-2016-0656. The APC was funded by Marco Carricato., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación 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
Publicación 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
© 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, 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., Peer Reviewed, Postprint (author's final draft)