Skip to main content

Resultados relacionados

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

UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Vision-based loop closing for delayed state robot mapping

  • Illa, Viorela Simona
  • Andrade-Cetto, Juan|||0000-0002-6354-8941
  • Valencia Carreño, Rafael
  • Sanfeliu Cortés, Alberto|||0000-0003-3868-9678
© 2007 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., This paper shows results on outdoor vision-based loop closing for Simultaneous Localization and Mapping. Our experiments show that for loops of over 50m, the pose estimates maintained with a Delayed-State Extended Information Filter are consistent enough to guarantee assertion of vision-based pose constraints for loop closure, provided no necessary information links are added to the estimator. The technique computes relative pose constraints via a robust least squares minimization of 3D point correspondences, which are in turn obtained from the matching of SIFT features over candidate image pairs. We propose a loop closure test that checks both for closeness of means and for highly informative updates at the same time., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

A space decomposition method for path planning of loop linkages

  • Porta Pleite, Josep Maria|||0000-0002-5056-1717
  • Cortés, Juan
  • Ros Giralt, Lluís|||0000-0002-8338-6062
  • Thomas, Federico|||0000-0001-9341-5528
This paper introduces box approximations as a new tool for path planning of closed-loop linkages. Box approximations are finite collections of rectangloids that tightly envelop the robot's free space at a desired resolution. They play a similar role to that of approximate cell decompositions for open-chain robots - they capture the free-space connectivity in a multi-resolutive fashion and yield rectangloid channels enclosing collision-free paths - but have the additional property of enforcing the satisfaction of loop closure constraints frequently arising in articulated linkages. We present an efficient technique to compute such approximations and show how resolution-complete path planners can be devised using them. To the authors' knowledge, this is the first space-decomposition approach to closed-loop linkage path planning proposed in the literature., This work has been partially supported by the Spanish Ministryof Education and Science through the contract DPI2004-07358, by the“Comunitat de Treball dels Pirineus” under contract 2006ITT-10004, andby Ram ́on y Cajal and I3 programme funds., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Exploiting single-cycle symmetries in branch-and-prune algorithms

  • Ruiz de Angulo García, Vicente|||0000-0002-2067-7399
  • Torras, Carme|||0000-0002-2933-398X
The final publication is available at link.springer.com, As a first attempt to exploit symmetries in continuous constraint problems, we focus on permutations of the variables consisting of one single cycle. We propose a procedure that takes advantage of these symmetries by interacting with a Branch-and-Prune algorithm without interfering with it. A key concept in this procedure are the classes of symmetric boxes formed by bisecting a n-dimensional cube at the same point in all dimensions at the same time. We quantify these classes as a function of n. Moreover, we propose a simple algorithm to generate the representatives of all these classes for any number of variables at very high rates. A problem example from the chemical field and a kinematics solver are used to show the performance of the approach in practice., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Direct position analysis of a large family of spherical and planar parallel manipulators with four loops

  • Borràs Sol, Júlia|||0000-0002-1662-2037
  • Di Gregorio, Raffaele
The direct position analysis (DPA) of a manipulator is the computation of the end-effector poses (positions and orientations) compatible with assigned values of the actuated-joint variables. Assigning the actuated-joint variables corresponds to considering the actuated joints locked, which makes the manipulator a structure. The solutions of the DPA of a manipulator one-to-one correspond to the assembly modes of the structure that is generated by locking the actuated-joint variables of that manipulator. Determining the assembly modes of a structure means solving the DPA of a large family of manipulators since the same structure can be generated from different manipulators. This paper provides an algorithm that determines all the assembly modes of two structures with the same topology which are generated from two families of mechanisms: one planar and the other spherical. The topology of these structures is constituted of nine links (one quaternary link, four ternary links and four binary links) connected through twelve revolute pairs to form four closed loops., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

A space decomposition method for path planning of loop linkages

  • Porta Pleite, Josep Maria
  • Cortés, Juan
  • Ros Giralt, Lluís
  • Thomas, Federico
This paper introduces box approximations as a new tool for path planning of closed-loop linkages. Box approximations are finite collections of rectangloids that tightly envelop the robot's free space at a desired resolution. They play a similar role to that of approximate cell decompositions for open-chain robots - they capture the free-space connectivity in a multi-resolutive fashion and yield rectangloid channels enclosing collision-free paths - but have the additional property of enforcing the satisfaction of loop closure constraints frequently arising in articulated linkages. We present an efficient technique to compute such approximations and show how resolution-complete path planners can be devised using them. To the authors' knowledge, this is the first space-decomposition approach to closed-loop linkage path planning proposed in the literature., This work has been partially supported by the Spanish Ministryof Education and Science through the contract DPI2004-07358, by the“Comunitat de Treball dels Pirineus” under contract 2006ITT-10004, andby Ram ́on y Cajal and I3 programme funds., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Vision-based loop closing for delayed state robot mapping

  • Illa, Viorela Simona
  • Andrade-Cetto, Juan
  • Valencia Carreño, Rafael
  • Sanfeliu Cortés, Alberto
© 2007 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., This paper shows results on outdoor vision-based loop closing for Simultaneous Localization and Mapping. Our experiments show that for loops of over 50m, the pose estimates maintained with a Delayed-State Extended Information Filter are consistent enough to guarantee assertion of vision-based pose constraints for loop closure, provided no necessary information links are added to the estimator. The technique computes relative pose constraints via a robust least squares minimization of 3D point correspondences, which are in turn obtained from the matching of SIFT features over candidate image pairs. We propose a loop closure test that checks both for closeness of means and for highly informative updates at the same time., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Direct position analysis of a large family of spherical and planar parallel manipulators with four loops

  • Borràs Sol, Júlia
  • Di Gregorio, Raffaele
The direct position analysis (DPA) of a manipulator is the computation of the end-effector poses (positions and orientations) compatible with assigned values of the actuated-joint variables. Assigning the actuated-joint variables corresponds to considering the actuated joints locked, which makes the manipulator a structure. The solutions of the DPA of a manipulator one-to-one correspond to the assembly modes of the structure that is generated by locking the actuated-joint variables of that manipulator. Determining the assembly modes of a structure means solving the DPA of a large family of manipulators since the same structure can be generated from different manipulators. This paper provides an algorithm that determines all the assembly modes of two structures with the same topology which are generated from two families of mechanisms: one planar and the other spherical. The topology of these structures is constituted of nine links (one quaternary link, four ternary links and four binary links) connected through twelve revolute pairs to form four closed loops., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Exploiting single-cycle symmetries in branch-and-prune algorithms

  • Ruiz de Angulo García, Vicente
  • Torras, Carme
The final publication is available at link.springer.com, As a first attempt to exploit symmetries in continuous constraint problems, we focus on permutations of the variables consisting of one single cycle. We propose a procedure that takes advantage of these symmetries by interacting with a Branch-and-Prune algorithm without interfering with it. A key concept in this procedure are the classes of symmetric boxes formed by bisecting a n-dimensional cube at the same point in all dimensions at the same time. We quantify these classes as a function of n. Moreover, we propose a simple algorithm to generate the representatives of all these classes for any number of variables at very high rates. A problem example from the chemical field and a kinematics solver are used to show the performance of the approach in practice., Peer Reviewed, Postprint (author's final draft)