Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 15
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 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 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 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.
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 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
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 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)