Pasar al contenido principal

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

DPI2014-57220-C2-2-P

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
Programa Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D (Excelencia / Generación de Conocimiento)
Año convocatoria 2014
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Unidad de gestión Secretaría de Estado de Educación, Formación Profesional y Universidades
Centro beneficiario AGENCIA ESTATAL CONSEJO SUPERIOR DE INVESTIGACIONES CIENTIFICAS (CSIC)
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

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

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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
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)

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
Publicación 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
Publicación 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
Publicación 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
Recercat. Dipósit de la Recerca de Catalunya
Publicación 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
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, 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
Publicación 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)