Pasar al contenido principal

Resultados relacionados

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

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

Yet another approach to the Gough-Stewart platform forward kinematics

  • Porta, Josep M.
  • Thomas, Federico
Trabajo presentado en la IEEE International Conference on Robotics and Automation (ICRA), celebrado en Brisbane (Australia), del 21 al 25 de mayo de 2018, The forward kinematics of the Gough-Stewart platform, and their simplified versions in which some leg endpoints coalesce, has been typically solved using variable elimination methods. In this paper, we cast doubts on whether this is the easiest way to solve the problem. We will see how the indirect approach in which the length of some extra virtual legs is first computed leads to important simplifications. In particular, we provide a procedure to solve 30 out of 34 possible topologies for a Gough-Stewart platform without variable elimination., 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., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

A singularity-robust LQR controller for parallel robots

  • Bordalba, Ricard
  • Porta, Josep M.
  • Ros, Lluís
Trabajo presentado en la IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), celebrada en Madrid, del 1 al 5 de octubre de 2018, Parallel robots exhibit the so-called forward singularities, which complicate substantially the planning and control of their motions. Often, such complications are circumvented by restricting the motions to singularity-free regions of the workspace. However, this comes at the expense of reducing the motion range of the robot substantially. It is for this reason that, recently, efforts are underway to control singularity-crossing trajectories. This paper proposes a reliable controller to stabilize such kind of trajectories. The controller is based on the classical theory of linear quadratic regulators, which we adapt appropriately to the case of parallel robots. As opposed to traditional computed-torque methods, the obtained controller does not rely on expensive inverse dynamics computations. Instead, it uses an optimal control law that is easy to evaluate, and does not generate instabilities at forward singularities. The performance of the controller is exemplified on a five-bar parallel robot accomplishing two tasks that require the traversal of singularities, This work has been partially funded by the Spanish Ministry of Economy and Competitiveness under projects DPI2014-57220-C2-2-P and DPI2017-88282-P., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

The forward kinematics of doubly-planar Gough-Stewart platforms and the position analysis of strips of tetrahedra

  • Porta, Josep M.
  • Thomas, Federico
Trabajo presentado en la 16th International Conference on Advances in Robot Kinematics, celebrada en Bolonia (Italia), del 1 al 5 de julio de 2018, A strip of tetrahedra is a tetrahedron-tetrahedron truss where any tetrahedron has two neighbors except those in the extremes which have only one. The problem of finding all the possible lengths for an edge in the strip compatible with a given distance imposed between the strip end-points has been revealed of relevance due to the large number of possible applications. In this paper, this is applied to solve the forward kinematics of 6-6 Gough-Stewart platforms with planar base and moving platform, a problem which is known to have up to 40 solutions (20 if we do not consider mirror configurations with respect to the base as different solutions)., 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 MDM2016-0656, Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

A reconfigurable asymmetric 3-UPU parallel robot

  • Sarabandi, Soheil
  • Grosch, Patrick
  • Porta, Josep M.
  • Thomas, Federico
trabajo presentado en la 4th International Conference on Reconfigurable Mechanisms and Robots, celebrada en Delft (Netherlands), del 20 al 22 de junio de 2018, Parallel robots with three UPU legs have received a lot of attention due to the possibility of assembling these legs so that the robot performs either a pure translational or a pure rotational motion. Nevertheless, some arrangements, despite their theoretical interest, are of doubtful practical utility due to their sensitivity to errors and the presence in their workspaces of mixed-modes that involve both translations and rotations. The introduction of some sort of asymmetry has been revealed of relevance to come up with more robust designs. In this context, we present an asymmetric 3-P robot, that can be reconfigured to work either as a translational or as a rotational robot by simply flipping upside down its moving platform., 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., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

Angle-bound smoothing with applications in kinematics

  • Porta, Josep M.
  • Sarabandi, Soheil
  • Thomas, Federico
Trabajo presentado en la 5th IFToMM Asian Conference on Mechanism and Machine Science, celebrada en Bengaluru (India), del 17 al 19 de diciembre de 2018, Distance-bound smoothing is a method to characterize point configurations satisfying a given set of constraints on the pairwise ranges of distances. This technique essentially consists in the iterative application of a set of algebraic conditions to reduce the given initial distance ranges. Although originally developed in a Computational Chemistry context, it has successfully been applied to problems of planar point configurations arising in Robotics, which includes the position analysis of planar robots. In this paper, this technique is generalized to deal with points on a sphere so that the planar case can now be deduced from the one presented here as a limit case. To exemplify the interest of this technique, it is applied to solve the position analysis of multiloop spherical linkages, 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., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

Singularity-free computation of quaternions from rotation matrices in E4 and E3

  • Sarabandi, Soheil
  • Perez-Gracia, Alba
  • Thomas, Federico
Trabajo presentado en la 7th Conference on Applied Geometric Algebras in Computer Science and Engineering (AGACSE), celebrada en Campinas (Brasil), del 23 al 27 de julio de 2018, A real orthogonal matrix representing a rotation in E 4 can be decomposed into the commutative product of a left-isoclinic and a right-isoclinic rotation matrix. The double quaternion representation of rotations in E 4 follows directly from this decomposition. In this paper, it is shown how this decomposition can be performed without divisions. This avoids the common numerical issues attributed to the computation of quaternions from rotation matrices. The map from the 4×4 rotation matrices to the set of double unit quaternions is a 2-to-1 covering map. Thus, 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. When particularized to three dimensions, it is shown how the resulting formulation outperforms, from the numerical point of view, the celebrated Shepperd’s method., This work was partially supported by the Spanish Ministry of Economy and Competitiveness through project DPI2014-57220-C2-2-P, DPI2017-88282-P, MDM-2016-0656, and the USA National Science Foundation under Grant No. 1208385., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Contribución de congreso (ConferenceOutput)

Accurate computation of quaternions from rotation matrices

  • Sarabandi, Soheil
  • Thomas, Federico
Trabajo presentado en el 16th International Symposium on Advances in Robot Kinematics (ARK), celebrado en Bolonia (Italia), del 1 al 5 de julio de 2018, The main non-singular alternative to 3×3 proper orthogonal matrices, for representing rotations in R3, is quaternions. Thus, it is important to have reliable methods to pass from one representation to the other. While passing from a quaternion to the corresponding rotation matrix is given by Euler-Rodrigues formula, the other way round can be performed in many different ways. Although all of them are algebraically equivalent, their numerical behavior can be quite different. In 1978, Shepperd proposed a method for computing the quaternion corresponding to a rotation matrix which is considered the most reliable method to date. Shepperd’s method, thanks to a voting scheme between four possible solutions, always works far from formulation singularities. In this paper, we propose a new method which outperforms Shepperd’s method without increasing the computational cost., 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. We also want to express our gratitude to Antonio B. Martınez for the financial support of the first author, and to the anonymous reviewers whose comments have led to a number of valuable improvements in the text, Peer reviewed
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 Contribución de congreso (ConferenceOutput)

A fast branch-and-prune algorithm for the position analysis of spherical mechanisms

  • Shabani, Arya
  • Sarabandi, Soheil
  • Porta, Josep M.
  • Thomas, Federico
Trabajo presentado en el IFToMM World Congress on Mechanism and Machine Science, celebrado en Cracovia (Polonia), del 15 al 18 de julio de 2019, Different branch-and-prune schemes can be found in the literature for numerically solving the position analysis of spherical mechanisms. For the prune operation, they all rely on the propagation of motion intervals. They differ in the way the problem is algebraically formulated. This paper exploits the fact that spherical kinematic loop equations can be formulated as sets of 3 multi-affine polynomials. Multi-affinity has an important impact on how the propagation of motion intervals can be performed because a multi-affine polynomial is uniquely determined by its values at the vertices of a closed hyperbox defined in its domain., This research has been partially funded under the project DPI2017-88282-P (AEI/FEDER, UE)
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 Contribución de congreso (ConferenceOutput)

Clifford’s Identity and Generalized Cayley-Menger Determinants

  • Thomas, Federico
  • Porta, Josep M.
Trabajo presentado en el International Symposium on Advances in Robot Kinematics, celebrado en Ljubljana (Eslovenia) del 6 al 10 de diciembre de 2020, Distance geometry is usually defined as the characterization and study of point sets in Rk , the k-dimensional Euclidean space, based on the pairwise distances between their points. In this paper, we use Clifford’s identity to extend this kind of characterization to sets of n hyperspheres embedded in Sn−3 or Rn−3 where the role of the Euclidean distance between two points is replaced by the so-called power between two hyperspheres. By properly choosing the value of n and the radii of these hyperspheres, Clifford’s identity reduces to conditions in terms of generalized Cayley-Menger determinants which has been previously obtained on the basis of a case-by-case analysis., 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 Contribución de congreso (ConferenceOutput)

Position analysis of a class of n-RRR planar parallel robots

  • Marchi, Tommaso
  • Mottola, Giovanni
  • Porta, Josep M.
  • Thomas, Federico
  • Carricato, Marco
Trabajo presentado en el International Conference of IFToMM ITALY, celebrada en Nápoles (Italia) del 9 al 11 de septiembre de 2020, Parallel robots with a configurable platform are a class of parallel robots in which the end-effector is a closed-loop kinematic chain. In n-RRR planar robots the end-effector is a n-bar chain controlled by n actuated RRR chains connected to the base. We solve the direct kinematic problem for 4, 5 and 6-RRR mechanisms by using bilateration, a method that easily lends itself to generalization. Finally, we present the results from experimental tests that have been performed on a 5-RRR prototype., F. Thomas and J. M. Porta were partially supported by the Spanish Ministry of Economy and Competitiveness through projects DPI2017-88282-P and MDM-2016-0656. The support of Dr. Patrick Grosch in building the prototype is gratefully acknowledged.
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 Contribución de congreso (ConferenceOutput)

Model predictive control for a Mecanum-wheeled robot navigating among obstacles

  • Moreno-Caireta, Iñigo
  • Celaya, Enric
  • Ros, Lluís
Trabajo presentado en el 7th IFAC Conference on Nonlinear Model Predictive Control NMPC 2021, celebrado en Bratislava (Eslovaquia), del 11 al 14 de julio de 2021, Mecanum-wheeled robots have been thoroughly used to automate tasks in many different applications. However, they are usually controlled by neglecting their dynamics and relying only on their kinematic model. In this paper, we model the behaviour of such robots by taking into account both their equations of motion and the electrodynamic response of their actuators, including dry and viscous friction at their shafts. This allows us to design a model predictive controller aimed to minimise the energy consumed by the robot. The controller also satisfies a number of non-linear inequalities modelling motor voltage limits and obstacle avoidance constraints. The result is an agile controller that can quickly adapt to changes in the environment, while generating fast and energy-efficient manoeuvres towards the goal., Work partially funded by the Spanish Ministry of Science, Innovation, and Universities under project DPI2017-88282-P.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Tesis doctoral (DoctoralThesis)

Solving the Nearest Rotation Matrix Problem in Three and Four Dimensions with Applications in Robotics

  • Sarabandi, Soheil
Tesis doctoral presentada para lograr el título de Doctor por la Universidad Politécnica de Cataluña.--2021-04-27, Since the map from quaternions to rotation matrices is a 2-to-1 covering map, it cannot be smoothly inverted. As a consequence, it is sometimes 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 was clarified when we found a new division-free conversion method. This result triggered the research work presented in this thesis. At first glance, the matrix to quaternion conversion does not seem to be a relevant problem. Actually, most researchers consider it as a well-solved problem whose revision is not likely to provide any new insight in any area of practical interest. Nevertheless, we show in this thesis how solving the nearest rotation matrix problem, in Frobenius norm, can essentially be reduced to a matrix to quaternion conversion. Many problems, such as hand-eye calibration, camera pose estimation, location recognition, image stitching, etc. require finding the nearest proper orthogonal matrix to a given matrix. Thus, the matrix to quaternion conversion becomes of paramount importance. While a rotation in 3D can be represented using a quaternion, a rotation in 4D can be represented using a double quaternion. As a consequence, the computation of the nearest rotation matrix in 4D, using our approach, essentially follows the same steps as in the 3D case. Although the 4D case might seem of theoretical interest only, we show in this thesis its practical relevance thanks to a little known mapping between 3D displacements and 4D rotations. In this thesis we focus our attention in obtaining closed-form solutions, in particular those that only require the four basic arithmetic operations because they can easily be implemented on microcomputers with limited computational resources. Moreover, closed-form methods are preferable for at least two reasons: they provide the most meaningful answer because they permit symbolically analyzing the influence of each variable on the result; and their computational cost, in terms of arithmetic operations, is fixed and assessable beforehand. We have actually derived closed-form methods specifically tailored for solving the hand-eye calibration and the pointcloud registration problems which outperform all previous approaches.
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 Capítulo o parte de un libro (BookPart)

Position analysis of a class of n-RRR planar parallel robots

  • Marchi, Tommaso
  • Mottola, Giovanni
  • Porta Pleite, Josep Maria|||0000-0002-5056-1717
  • Thomas, Federico|||0000-0001-9341-5528
  • Carricato, Marco
The final publication is available at link.springer.com, Parallel robots with a configurable platform are a class of parallel robots in which the end-effector is a closed-loop kinematic chain. In n-RRR planar robots the end-effector is a n-bar chain controlled by 'n' actuated RRR chains connected to the base. We solve the direct kinematic problem for 4, 5 and 6-RRR mechanisms by using bilateration, a method that easily lends itself to generalization. Finally, we present the results from experimental tests that have been performed on a 5-RRR prototype., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Clifford’s identity and generalized Cayley-Menger determinants

  • Thomas, Federico|||0000-0001-9341-5528
  • Porta Pleite, Josep Maria|||0000-0002-5056-1717
The final publication is available at link.springer.com, Distance geometry is usually defined as the characterization and study of point sets in Rk, the k-dimensional Euclidean space, based on the pairwise distances between their points. In this paper, we use Clifford’s identity to extend this kind of characterization to sets of n hyperspheres embedded in ¿n-3 or Rn-3 where the role of the Euclidean distance between two points is replaced by the so-called power between two hyperspheres. By properly choosing the value of n and the radii of these hyperspheres, Clifford’s identity reduces to conditions in terms of generalized Cayley-Menger determinants which has been previously obtained on the basis of a case-by-case analysis., This work was partially supported by the Spanish Ministry of Economy and Competitiveness through the projects DPI2017-88282-P and MDM-2016-0656., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Estudio, informe, memoria (Report)

Yet a better closed-form formula for the 3D nearest rotation matrix problem

  • Wu, Jin
  • Sarabandi, Soheil|||0000-0002-2103-1610
  • Porta Pleite, Josep Maria|||0000-0002-5056-1717
  • Liu, Ming
  • Thomas, Federico|||0000-0001-9341-5528
This technical report complements the results recently presented in [1] showing that they can be extended to define an efficient and robust method to determine the rotation matrix nearest to an arbitrary 3 × 3 matrix. This problem arises in different areas of robotics that range from the simple case in which we have to restore the orthogonality of a noisy rotation matrix to point-cloud registration or hand-eye calibration. We show that the new method compares favorably with the classical approaches to address this problem and also with more recent methods
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 Contribución de congreso (ConferenceOutput)

A Legendre-Gauss pseudospectral collocation method for trajectory optimization in second 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
© 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, 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., 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 Contribución de congreso (ConferenceOutput)

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

  • Moreno Martín, Siro
  • Ros Giralt, Lluís
  • Celaya Llover, Enric
© 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, 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., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación

Yet a better closed-form formula for the 3D nearest rotation matrix problem

  • Wu, Jin
  • Sarabandi, Soheil
  • Porta Pleite, Josep Maria
  • Liu, Ming
  • Thomas, Federico
This technical report complements the results recently presented in [1] showing that they can be extended to define an efficient and robust method to determine the rotation matrix nearest to an arbitrary 3 × 3 matrix. This problem arises in different areas of robotics that range from the simple case in which we have to restore the orthogonality of a noisy rotation matrix to point-cloud registration or hand-eye calibration. We show that the new method compares favorably with the classical approaches to address this problem and also with more recent methods, Preprint
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Clifford’s identity and generalized Cayley-Menger determinants

  • Thomas, Federico
  • Porta Pleite, Josep Maria
The final publication is available at link.springer.com, Distance geometry is usually defined as the characterization and study of point sets in Rk, the k-dimensional Euclidean space, based on the pairwise distances between their points. In this paper, we use Clifford’s identity to extend this kind of characterization to sets of n hyperspheres embedded in ¿n-3 or Rn-3 where the role of the Euclidean distance between two points is replaced by the so-called power between two hyperspheres. By properly choosing the value of n and the radii of these hyperspheres, Clifford’s identity reduces to conditions in terms of generalized Cayley-Menger determinants which has been previously obtained on the basis of a case-by-case analysis., This work was partially supported by the Spanish Ministry of Economy and Competitiveness through the projects DPI2017-88282-P and MDM-2016-0656., Peer Reviewed, Postprint (author's final draft)
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)
Recercat. Dipósit de la Recerca de Catalunya
Publicación

Position analysis of a class of n-RRR planar parallel robots

  • Marchi, Tommaso
  • Mottola, Giovanni
  • Porta Pleite, Josep Maria
  • Thomas, Federico
  • Carricato, Marco
The final publication is available at link.springer.com, Parallel robots with a configurable platform are a class of parallel robots in which the end-effector is a closed-loop kinematic chain. In n-RRR planar robots the end-effector is a n-bar chain controlled by 'n' actuated RRR chains connected to the base. We solve the direct kinematic problem for 4, 5 and 6-RRR mechanisms by using bilateration, a method that easily lends itself to generalization. Finally, we present the results from experimental tests that have been performed on a 5-RRR prototype., Peer Reviewed, Postprint (author's final draft)