Skip to main content

ESTRATEGIAS DE CONTROL PARA UN ROBOT ACTUADO POR CABLES PARA SIMULACION DE BAJA GRAVEDAD

DPI2014-57220-C2-2-P

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D (Excelencia / Generación de Conocimiento)
Call year 2014
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Secretaría de Estado de Educación, Formación Profesional y Universidades
Beneficiary centre AGENCIA ESTATAL CONSEJO SUPERIOR DE INVESTIGACIONES CIENTIFICAS (CSIC)

Resultados relacionados

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

RUC. Repositorio da Universidade da Coruña
Publication Contribución de congreso (ConferenceOutput)

Improving Local Symmetry Estimations in RGB-D Images by Fitting Superquadrics

  • Fornas, David
  • Sanz, Pedro J.
  • Porta, Josep M.
  • Thomas, Federico
[Abstract] Real-time manipulation tasks rely on finding good candidates for apprehension points which, in turn, usually requires the computation of local symmetries. When RGB-D images are used as input information, these local symmetries can be deduced from segmenting these images and computing geometric moments for each cluster of points. This approach gives a rough approximation because it does not take into account that the considered points lie on a surface. In this paper, to improve the quality of the symmetry estimations, we propose a simple refinement process that takes as input the estimation obtained using moments and then fits a superquadric to the considered set of points. We evaluate our approach on data collected using a Microsoft's Kinect 2 sensor. The obtained experimental results demonstrate the efficacy of the proposed approach., This work has been partially supported by by the Spanish Ministry of Economy and Competitiveness under projects DPI2014-57220-C2-2-P and DPI2014-57746-C3, https://doi.org/10.17979/spudc.9788497498081
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Variable symmetry breaking in numerical constraint problems

  • Goldsztejn, Alexandre
  • Jermann, Christophe
  • Ruiz de Angulo, Vicente
  • Torras, Carme
Symmetry breaking has been a hot topic of research in the past years, leading to many theoretical developments as well as strong scaling strategies for dealing with hard applications. Most of the research has however focused on discrete, combinatorial, problems, and only few considered also continuous, numerical, problems. While part of the theory applies in both contexts, numerical problems have specificities that make most of the technical developments inadequate. In this paper, we present the rlex constraints, partial symmetry-breaking inequalities corresponding to a relaxation of the famous lex constraints extensively studied in the discrete case. They allow (partially) breaking any variable symmetry and can be generated in polynomial time. Contrarily to lex constraints that are impractical in general (due to their overwhelming number) and inappropriate in the continuous context (due to their form), rlex constraints can be efficiently handled natively by numerical constraint solvers. Moreover, we demonstrate their pruning power on continuous domains is almost as strong as that of lex constraints, and they subsume several previous work on breaking specific symmetry classes for continuous problems. Their experimental behavior is assessed on a collection of standard numerical problems and the factors influencing their impact are studied. The results confirm rlex constraints are a dependable counterpart to lex constraints for numerical problems., The authors have been financially supported by the following grants for this research: Spanish project RobCab (DPI2014-57220-C2-2-P), Robotics Group of the Generalitat de Catalunya (SGR2014-1102), University of Nantes international exchanges program (CURI-2009)., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Path planning for active tensegrity structures

  • Porta, Josep M.
  • Hernàndez, Sergi
This paper presents a path planning method for actuated tensegrity structures with quasi-static motion. The valid configurations for such structures lay on an equilibrium manifold, which is implicitly defined by a set of kinematic and static constraints. The exploration of this manifold is difficult with standard methods due to the lack of a global parameterization. Thus, this paper proposes the use of techniques with roots in differential geometry to define an atlas, i.e., a set of coordinated local parameterizations of the equilibrium manifold. This atlas is exploited to define a rapidly-exploring random tree, which efficiently finds valid paths between configurations. However, these paths are typically long and jerky and, therefore, this paper also introduces a procedure to reduce their control effort. A variety of test cases are presented to empirically evaluate the proposed method., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness under Project DPI2014-57220-C2-2-P., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Planning wrench-feasible motions for cable-driven hexapods

  • Bohigas, Oriol
  • Manubens, Montserrat
  • Ros, Lluís
Motion paths of cable-driven hexapods must carefully be planned to ensure that the lengths and tensions of all cables remain within acceptable limits, for a given wrench applied to the platform. The cables cannot go slack-to keep the control of the robot-nor excessively tight-to prevent cable breakage-even in the presence of bounded perturbations of the wrench. This paper proposes a path-planning method that accommodates such constraints simultaneously. Given two configurations of the robot, the method attempts to connect them through a path that, at any point, allows the cables to counteract any wrench lying in a predefined uncertainty region. The configuration space, or C-space for short, is placed in correspondence with a smooth manifold, which facilitates the definition of a continuation strategy to search this space systematically from one configuration, until the second configuration is found, or path nonexistence is proved by exhaustion of the search. The force Jacobian is full rank everywhere on the C-space, which implies that the computed paths will naturally avoid crossing the forward singularity locus of the robot. The adjustment of tension limits, moreover, allows to maintain a meaningful clearance relative to such locus. The approach is applicable to compute paths subject to geometric constraints on the platform pose or to synthesize free-flying motions in the full 6-D C-space. Experiments illustrate the performance of the method in a real prototype., This work has been partially supported by the Spanish Ministry of Economy under project DPI2014-57220-C2-2-P, by the CSIC project 201250E026, and by a Juan de la Cierva fellowship supporting Montserrat Manubens., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

On Cayley's factorization of 4D rotations and applications

  • Perez-Gracia, Alba
  • Thomas, Federico
A 4D rotation can be decomposed into a left- and a right-isoclinic rotation. This decomposition, known as Cayley’s factorization of 4D rotations, can be performed using the Elfrinkhof–Rosen method. In this paper, we present a more straightforward alternative approach using the corresponding orthogonal subspaces, for which orthogonal bases can be defined. This yields easy formulations, both in the space of 4×4 real orthogonal matrices representing 4D rotations and in the Clifford algebra C4,0,0. Cayley’s factorization has many important applications. It can be used to easily transform rotations represented using matrix algebra to different Clifford algebras. As a practical application of the proposed method, it is shown how Cayley’s factorization can be used to efficiently compute the screw parameters of 3D rigid-body transformations., This work was partially supported by the Spanish Ministry of Economy and Competitiveness through Project DPI2014-57220-C2-2-P and the USA National Science Foundation under Grant No. 1208385., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Contribución de congreso (ConferenceOutput)

Distance bound smoothing under orientation constraints

  • Rull, Aleix
  • Porta, Josep M.
  • Thomas, Federico
  • Thomas, Federico
Trabajo presentado al ICRA celebrado en Seattle (US) del 26 al 30 de mayo de 2015., Distance Bound Smoothing (DBS) is a basic operation originally developed in Computational Chemistry to determine point configurations that are within certain pairwise ranges of distances. This operation consist in the iterative application of filtering processes that reduce the given ranges using triangular and tetrangular inequalities. Standard DBS has a limited range of applications because it does not take into account constraints on the orientations of simplices (triangles or tetrahedra, depending on the dimension of the problem). This paper discusses an extension of DBS that permits incorporating these constraints. This paves the way for the application of DBS techniques to a broad range of problems in Robotics., This work has been partially supported by by the Spanish Ministry of Economy and Competitiveness under project DPI2014-57220-C2-2-P, Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Sensor Localization from Distance and Orientation Constraints

  • Porta, Josep M.
  • Rull, Aleix
  • Thomas, Federico
The sensor localization problem can be formalized using distance and orientation constraints, typically in 3D. Local methods can be used to refine an initial location estimation, but in many cases such estimation is not available and a method able to determine all the feasible solutions from scratch is necessary. Unfortunately, existing methods able to find all the solutions in distance space can not take into account orientations, or they can only deal with one- or two-dimensional problems and their extension to 3D is troublesome. This paper presents a method that addresses these issues. The proposed approach iteratively projects the problem to decrease its dimension, then reduces the ranges of the variable distances, and back-projects the result to the original dimension, to obtain a tighter approximation of the feasible sensor locations. This paper extends previous works introducing accurate range reduction procedures which effectively integrate the orientation constraints. The mutual localization of a fleet of robots carrying sensors and the position analysis of a sensor moved by a parallel manipulator are used to validate the approach., This work has been partially supported by by the Spanish Ministry of Economy and Competitiveness under project DPI2014-57220-C2-2-P., We acknowledge support by the CSIC Open Access Publication Initiative through its Unit of Information Resources for Research (URICI)
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

A Bayesian approach to simultaneously recover camera pose and non-rigid shape from monocular images

  • Moreno-Noguer, Francesc
  • Porta, Josep M.
In this paper we bring the tools of the Simultaneous Localization and Map Building (SLAM) problem from a rigid to a deformable domain and use them to simultaneously recover the 3D shape of non-rigid surfaces and the sequence of poses of a moving camera. Under the assumption that the surface shape may be represented as a weighted sum of deformation modes, we show that the problem of estimating the modal weights along with the camera poses, can be probabilistically formulated as a maximum a posteriori estimate and solved using an iterative least squares optimization. In addition, the probabilistic formulation we propose is very general and allows introducing different constraints without requiring any extra complexity. As a proof of concept, we show that local inextensibility constraints that prevent the surface from stretching can be easily integrated. An extensive evaluation on synthetic and real data, demonstrates that our method has several advantages over current non-rigid shape from motion approaches. In particular, we show that our solution is robust to large amounts of noise and outliers and that it does not need to track points over the whole sequence nor to use an initialization close from the ground truth., This work has been partially funded by Spanish Ministry of Economy and Competitiveness under projects RobInstruct TIN2014-58178-R and RobCab DPI2014-57220-C2-2-P; and by the ERA-net CHISTERA project I-DRESS PCIN-2015-147., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Geometric path planning without maneuvers for nonholonomic parallel orienting robots

  • Grosch, Patrick
  • Thomas, Federico
Current geometric path planners for nonholonomic parallel orienting robots generate maneuvers consisting of a sequence of moves connected by zero-velocity points. The need for these maneuvers restrains the use of this kind of parallel robots to few applications. Based on a rather old result on linear time-varying systems, this letter shows that there are infinitely differentiable paths connecting two arbitrary points in SO such that the instantaneous axis of rotation along the path rest on a fixed plane. This theoretical result leads to a practical path planner for nonholonomic parallel orienting robots that generates single-move maneuvers. To present this result, we start with a path planner based on three-move maneuvers, and then we proceed by progressively reducing the number of moves to one, thus providing a unified treatment with respect to previous geometric path planners., This work was supported by the Spanish Ministry of Economy and Competitiveness through project DPI2014-57220-C2-2-P., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Artículo científico (JournalArticle)

Closed-form position analysis of variable geometry trusses

  • Porta, Josep M.
  • Thomas, Federico
Variable geometry trusses are composed, in general, of unit cells which can be modeled as bars connected by spherical joints. Under mild conditions, it has been shown that the only feasible cells are topologically equivalent to bipyramids. Unfortunately, using standard formulations, the closed-form position analysis of bipyramids is not a trivial task. Actually, it has only been achieved for bipyramids with up to 7 vertices, whose closure polynomial has been shown to be of order 24. In this paper, using a distance-based formulation and a kinematic inversion for fans of tetrahedra, the problem is solved for bipyramids with up to 11 vertices, whose closure polynomial is of degree 896. No other position analysis problem leading to such a high-order closure polynomial has been previously solved., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness under project DPI2014-57220-C2-2-P., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication Otros (Other)

Randomized kinodynamic planning for cable-suspended parallel robots

  • Bordalba, Ricard
  • Porta, Josep M.
  • Ros, Lluís
This paper proposes the use of a randomized kinodynamic planning technique to synthesize dynamic motions for cable-suspended parallel robots. Given two mechanical states of the robot, both with a prescribed position and velocity, the method attempts to connect them by a collision-free trajectory that respects the joint and force limits of the actuators, keeps the cables in tension, and takes the robot dynamics into account. The method is based on the construction of a bidirectionalrapidly-exploring random tree over the state space. Remarkably, the technique can be used to cross forward singularities of the robot in a predictable manner, which extends the motion capabilities beyond those demonstrated in previous work. The paper describes experiments that show the performance of the method in point-to-point operations with specific cable-driven robots, but the overall strategy remains applicable to other mechanism designs., This research has been partially funded by project DPI2014-57220-C2-2-P., Peer Reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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
Publication Otros (Other)

Distance geometry in active structures

  • Porta, Josep M.
  • Rojas, Nicolás
  • Thomas, Federico
Distance constraints are an emerging formulation that offers intuitive geometrical interpretation of otherwise complex problems. The formulation can be applied in problems such as position and singularity analysis and path planning of mechanisms and structures. This paper reviews the recent advances in distance geometry, providing a unified view of these apparently disparate problems. This survey reviews algebraic and numerical techniques, and is, to the best of our knowledge, the first attempt to summarize the different approaches relating to distance-based formulations., This work has been partially supported by the Spanish Ministry of Economy and Competitiveness under project DPI2014-57220-C2-2-P., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publication 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
Publication 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.
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

A new insight into the coupler curves of the RCCC four-bar linkage

  • Thomas, Federico|||0000-0001-9341-5528
  • Pérez Gracia, Alba|||0000-0002-6023-7857
The final publication is available at link.springer.com, Based on the condition for four points to lie on the unit sphere, derived using Distance Geometry, a new mathematical formulation for the coupler curves of the RCCC linkage is presented. The relevance of this formulation is not only its simplicity, but the elegant way in which we can obtain the derivative of any variable with respect to any other, and the simple way in which intervals of monotonicity can be detected. All these results are compactly expressed in terms of Gramians and, as a consequence, they have a direct geometric meaning contrarily to what happens with previous approaches based on kinematic loop equations., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Forward kinematics of the general triple-arm robot using a distance-based formulation

  • Rojas, Nicolas
  • Thomas, Federico|||0000-0001-9341-5528
The final publication is available at link.springer.com, Distance-based formulations have successfully been used to obtain closure polynomialsfor planar mechanisms without relying, in most cases, on variable eliminations. The methods re-sulting from previous attempts to generalize these techniques to spatial mechanisms exhibit somelimitations such as the impossibility of incorporating orientation constraints. For the first time, thispaper presents a complete satisfactory generalization. As an example, it is applied to obtain a clo-sure polynomial for the the general triple-arm parallel robot (that is, the 3-RPS 3-DOF robot). Thispolynomial, not linked to any particular reference frame, is obtained without variable eliminationsor tangent-half-angle substitutions, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

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

  • Sarabandi, Soheil|||0000-0002-2103-1610
  • Pérez Gracia, Alba|||0000-0002-6023-7857
  • Thomas, Federico|||0000-0001-9341-5528
A real orthogonal matrix representing a rotation in E4 can be decomposed into the commutative product of a left-isoclinic and a right-isoclinic rotation matrix. The double quaternion representation of rotations in E4 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 clari¿ed. When particularized to three dimensions, it is shown how the resulting formulation outperforms, from the numerical point of view, the celebrated Shepperd’s method., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Yet another approach to the Gough-Stewart platform forward kinematics

  • Porta Pleite, Josep Maria|||0000-0002-5056-1717
  • Thomas, Federico|||0000-0001-9341-5528
© 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., The 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., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

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

  • Porta Pleite, Josep Maria|||0000-0002-5056-1717
  • Thomas, Federico|||0000-0001-9341-5528
The final publication is available at link.springer.com, 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)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

A survey on the computation of quaternions from rotation matrices

  • Sarabandi, Soheil|||0000-0002-2103-1610
  • Thomas, Federico|||0000-0001-9341-5528
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, 3D image processing, computer graphics, etc. Nowadays, the main alternative to the use of rotation matrices, to represent rotations in R3, 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 3x3 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 4x4 rotation matrices, is the most robust method when particularized to three dimensions
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

On Cayley's factorization of 4D rotations and applications

  • Pérez Gracia, Alba|||0000-0002-6023-7857
  • Thomas, Federico|||0000-0001-9341-5528
The final publication is available at link.springer.com, A 4D rotation can be decomposed into a left- and a right-isoclinic rotation. This decomposition, known as Cayley’s factorization of 4D rotations, can be performed using the Elfrinkhof–Rosen method. In this paper, we present a more straightforward alternative approach using the corresponding orthogonal subspaces, for which orthogonal bases can be defined. This yields easy formulations, both in the space of 4×44×4 real orthogonal matrices representing 4D rotations and in the Clifford algebra C4,0,0C4,0,0. Cayley’s factorization has many important applications. It can be used to easily transform rotations represented using matrix algebra to different Clifford algebras. As a practical application of the proposed method, it is shown how Cayley’s factorization can be used to efficiently compute the screw parameters of 3D rigid-body transformations., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Solution intervals for variables in spatial RCRCR linkages

  • Celaya Llover, Enric|||0000-0001-8480-7706
© 2019. Elsevier, 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, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

On Cayley’s Factorization of 3D Rotations and Applications

  • Thomas, Federico|||0000-0001-9341-5528
  • Pérez Gracia, Alba|||0000-0002-6023-7857
A 4D rotation can be decomposed into a left- and a right-isoclinic rotation. This decomposition, known as Cayley’s factorization of 4D rotations, can be performed using the Elfrinkhof–Rosen method. In this paper, we present a more straightforward alternative approach using the corresponding orthogonal subspaces, for which orthogonal bases can be defined. This yields easy formulations, both in the space of 4×4 real orthogonal matrices representing 4D rotations and in the Clifford algebra C4,0,0. Cayley’s factorization has many important applications. It can be used to easily transform rotations represented using matrix algebra to different Clifford algebras. As a practical application of the proposed method, it is shown how Cayley’s factorization can be used to efficiently compute the screw parameters of 3D rigid-body transformations., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Randomized kinodynamic planning for constrained systems

  • Bordalba Llaberia, Ricard
  • Ros Giralt, Lluís|||0000-0002-8338-6062
  • Porta Pleite, Josep Maria|||0000-0002-5056-1717
© 20xx 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 RRT planners are considered to be general tools for effectively finding feasible trajectories for high-dimensional dynamical systems. However, they struggle when holonomic constraints are present in the system, such as those arising in parallel manipulators, in robots that cooperate to fulfill a given task, or in situations involving contacts with the environment. In such cases, the state space becomes an implicitly-defined manifold, which makes the diffusion heuristic inefficient and leads to inaccurate dynamical simulations. To address these issues, this paper presents an extension of the kinodynamic RRT planner that constructs an atlas of the state-space manifold incrementally, and uses this atlas both to generate random states and to dynamically steer the system towards such states. To the best of our knowledge, this is the first randomized kinodynamic planner that explicitly takes holonomic constraints into account. We validate the approach in significantly-complex systems.
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Randomized kinodynamic planning for cable-suspended parallel robots

  • Bordalba Llaberia, Ricard
  • Porta Pleite, Josep Maria|||0000-0002-5056-1717
  • Ros Giralt, Lluís|||0000-0002-8338-6062
The final publication is available at link.springer.com, This paper proposes the use of a randomized kinodynamic planning technique to synthesize dynamic motions for cable-suspended parallel robots. Given two mechanical states of the robot, both with a prescribed position and velocity, the method attempts to connect them by a collision-free trajectory that respects the joint and force limits of the actuators, keeps the cables in tension, and takes the robot dynamics into account. The method is based on the construction of a bidirectionalrapidly-exploring random tree over the state space. Remarkably, the technique can be used to cross forward singularities of the robot in a predictable manner, which extends the motion capabilities beyond those demonstrated in previous work. The paper describes experiments that show the performance of the method in point-to-point operations with specific cable-driven robots, but the overall strategy remains applicable to other mechanism designs., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

On Cayley’s Factorization of 3D Rotations and Applications

  • Thomas, Federico
  • Pérez Gracia, Alba
A 4D rotation can be decomposed into a left- and a right-isoclinic rotation. This decomposition, known as Cayley’s factorization of 4D rotations, can be performed using the Elfrinkhof–Rosen method. In this paper, we present a more straightforward alternative approach using the corresponding orthogonal subspaces, for which orthogonal bases can be defined. This yields easy formulations, both in the space of 4×4 real orthogonal matrices representing 4D rotations and in the Clifford algebra C4,0,0. Cayley’s factorization has many important applications. It can be used to easily transform rotations represented using matrix algebra to different Clifford algebras. As a practical application of the proposed method, it is shown how Cayley’s factorization can be used to efficiently compute the screw parameters of 3D rigid-body transformations., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Solution intervals for variables in spatial RCRCR linkages

  • Celaya Llover, Enric
© 2019. Elsevier, 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, Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Randomized kinodynamic planning for cable-suspended parallel robots

  • Bordalba Llaberia, Ricard
  • Porta Pleite, Josep Maria
  • Ros Giralt, Lluís
The final publication is available at link.springer.com, This paper proposes the use of a randomized kinodynamic planning technique to synthesize dynamic motions for cable-suspended parallel robots. Given two mechanical states of the robot, both with a prescribed position and velocity, the method attempts to connect them by a collision-free trajectory that respects the joint and force limits of the actuators, keeps the cables in tension, and takes the robot dynamics into account. The method is based on the construction of a bidirectionalrapidly-exploring random tree over the state space. Remarkably, the technique can be used to cross forward singularities of the robot in a predictable manner, which extends the motion capabilities beyond those demonstrated in previous work. The paper describes experiments that show the performance of the method in point-to-point operations with specific cable-driven robots, but the overall strategy remains applicable to other mechanism designs., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

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

  • Porta Pleite, Josep Maria
  • Thomas, Federico
The final publication is available at link.springer.com, 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)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Forward kinematics of the general triple-arm robot using a distance-based formulation

  • Rojas, Nicolas
  • Thomas, Federico
The final publication is available at link.springer.com, Distance-based formulations have successfully been used to obtain closure polynomialsfor planar mechanisms without relying, in most cases, on variable eliminations. The methods re-sulting from previous attempts to generalize these techniques to spatial mechanisms exhibit somelimitations such as the impossibility of incorporating orientation constraints. For the first time, thispaper presents a complete satisfactory generalization. As an example, it is applied to obtain a clo-sure polynomial for the the general triple-arm parallel robot (that is, the 3-RPS 3-DOF robot). Thispolynomial, not linked to any particular reference frame, is obtained without variable eliminationsor tangent-half-angle substitutions, Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Yet another approach to the Gough-Stewart platform forward kinematics

  • Porta Pleite, Josep Maria
  • Thomas, Federico
© 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., The 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., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication 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, 3D image processing, computer graphics, etc. Nowadays, the main alternative to the use of rotation matrices, to represent rotations in R3, 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 3x3 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 4x4 rotation matrices, is the most robust method when particularized to three dimensions, Preprint
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Randomized kinodynamic planning for constrained systems

  • Bordalba Llaberia, Ricard
  • Ros Giralt, Lluís
  • Porta Pleite, Josep Maria
© 20xx 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 RRT planners are considered to be general tools for effectively finding feasible trajectories for high-dimensional dynamical systems. However, they struggle when holonomic constraints are present in the system, such as those arising in parallel manipulators, in robots that cooperate to fulfill a given task, or in situations involving contacts with the environment. In such cases, the state space becomes an implicitly-defined manifold, which makes the diffusion heuristic inefficient and leads to inaccurate dynamical simulations. To address these issues, this paper presents an extension of the kinodynamic RRT planner that constructs an atlas of the state-space manifold incrementally, and uses this atlas both to generate random states and to dynamically steer the system towards such states. To the best of our knowledge, this is the first randomized kinodynamic planner that explicitly takes holonomic constraints into account. We validate the approach in significantly-complex systems., Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

On Cayley's factorization of 4D rotations and applications

  • Pérez Gracia, Alba
  • Thomas, Federico
The final publication is available at link.springer.com, A 4D rotation can be decomposed into a left- and a right-isoclinic rotation. This decomposition, known as Cayley’s factorization of 4D rotations, can be performed using the Elfrinkhof–Rosen method. In this paper, we present a more straightforward alternative approach using the corresponding orthogonal subspaces, for which orthogonal bases can be defined. This yields easy formulations, both in the space of 4×44×4 real orthogonal matrices representing 4D rotations and in the Clifford algebra C4,0,0C4,0,0. Cayley’s factorization has many important applications. It can be used to easily transform rotations represented using matrix algebra to different Clifford algebras. As a practical application of the proposed method, it is shown how Cayley’s factorization can be used to efficiently compute the screw parameters of 3D rigid-body transformations., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

A new insight into the coupler curves of the RCCC four-bar linkage

  • Thomas, Federico
  • Pérez Gracia, Alba
The final publication is available at link.springer.com, Based on the condition for four points to lie on the unit sphere, derived using Distance Geometry, a new mathematical formulation for the coupler curves of the RCCC linkage is presented. The relevance of this formulation is not only its simplicity, but the elegant way in which we can obtain the derivative of any variable with respect to any other, and the simple way in which intervals of monotonicity can be detected. All these results are compactly expressed in terms of Gramians and, as a consequence, they have a direct geometric meaning contrarily to what happens with previous approaches based on kinematic loop equations., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

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

  • Sarabandi, Soheil
  • Pérez Gracia, Alba
  • Thomas, Federico
A real orthogonal matrix representing a rotation in E4 can be decomposed into the commutative product of a left-isoclinic and a right-isoclinic rotation matrix. The double quaternion representation of rotations in E4 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 clari¿ed. When particularized to three dimensions, it is shown how the resulting formulation outperforms, from the numerical point of view, the celebrated Shepperd’s method., Peer Reviewed, Postprint (author's final draft)