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): 6
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)

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)

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.