English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30564
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
DC FieldValueLanguage
dc.contributor.authorPorta, Josep M.-
dc.contributor.authorRos, Lluís-
dc.contributor.authorThomas, Federico-
dc.contributor.authorTorras, Carme-
dc.date.accessioned2010-12-17T13:27:20Z-
dc.date.available2010-12-17T13:27:20Z-
dc.date.issued2005-
dc.identifier.citationIEEE Transactions on Robotics 21(2): 176-187 (2005)-
dc.identifier.issn1552-3098-
dc.identifier.urihttp://hdl.handle.net/10261/30564-
dc.descriptionThis paper was presented in part at the IEEE International Conference on Robotics and Automation, Taipei, Taiwan, R.O.C., September 2003.-
dc.description.abstractGiven some geometric elements such as points and lines in R3, subject to a set of pairwise distance constraints, the problem tackled in this paper is that of finding all possible configurations of these elements that satisfy the constraints. Many problems in robotics (such as the position analysis of serial and parallel manipulators) and CAD/CAM (such as the interactive placement of objects) can be formulated in this way. The strategy herein proposed consists of looking for some of the a priori unknown distances, whose derivation permits solving the problem rather trivially. Finding these distances relies on a branch-and-prune technique, which iteratively eliminates from the space of distances entire regions which cannot contain any solution. This elimination is accomplished by applying redundant necessary conditions derived from the theory of distance geometry. The experimental results qualify this approach as a promising one.-
dc.description.sponsorshipThis work was supported by projects: 'Design and implementation of efficient parallelizable algorithms with applications to robotics and proteomics' (J-00869), 'Grup de recerca consolidat - ROBÒTICA' (8007), 'Resolución de sistemas de ecuaciones cinemáticas para la simulación de mecanismos, posicionado interactivo de objetos y conformación de moléculas' (070-722). This work was supported in part by the Spanish CICYT under Contracts TIC2000-0696 and TIC2003-03396, and in part by the Catalan Research Commission through the “Robotics and Control” group. The work of J. M. Porta and L. Ros was supported by a Ramón y Cajal contract from the Spanish Ministry for Science and Technology.-
dc.language.isoeng-
dc.publisherInstitute of Electrical and Electronics Engineers-
dc.relation.isversionofPublisher's version-
dc.rightsopenAccess-
dc.subjectBranch-and-prune-
dc.subjectDirect and inverse kinematics-
dc.subjectDistance constraint-
dc.subjectInterval method-
dc.subjectRobots-
dc.titleA branch-and-prune solver for distance constraints-
dc.typeartículo-
dc.identifier.doi10.1109/TRO.2004.835450-
dc.description.peerreviewedPeer Reviewed-
dc.relation.publisherversionhttp://dx.doi.org/10.1109/TRO.2004.835450-
Appears in Collections:(IRII) Artículos
Files in This Item:
File Description SizeFormat 
A branch-and-prune.pdf999,48 kBAdobe PDFThumbnail
View/Open
Show simple item record
 

Related articles:


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.