English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30564
Title: A branch-and-prune solver for distance constraints
Authors: Porta, Josep M.; Ros, Lluís; Thomas, Federico; Torras, Carme
Keywords: Branch-and-prune
Direct and inverse kinematics
Distance constraint
Interval method
Issue Date: 2005
Publisher: Institute of Electrical and Electronics Engineers
Citation: IEEE Transactions on Robotics 21(2): 176-187 (2005)
Abstract: Given 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.
Description: This paper was presented in part at the IEEE International Conference on Robotics and Automation, Taipei, Taiwan, R.O.C., September 2003.
Publisher version (URL): http://dx.doi.org/10.1109/TRO.2004.835450
URI: http://hdl.handle.net/10261/30564
ISSN: 1552-3098
DOI: 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
Show full item record

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