English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30287
Share/Impact:
Statistics
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

BioCD : An efficient algorithm for self-collision and distance computation between highly articulated molecular models

AuthorsRuiz de Angulo, Vicente ; Cortés, Juan; Simeon, Thierry
KeywordsCollision detection
Biochemistry
Proteins
Automation: Robots
Robots
Robotics
Issue Date2005
PublisherMassachusetts Institute of Technology
Citation1st Robotics: Science and Systems Conference: 141-148 (2005)
AbstractThis paper describes an efficient approach to (self) collision detection and distance computations for complex articulated mechanisms such as molecular chains. The proposed algorithm called BioCD is particularly designed for sampling-based motion planning on molecular models described by long kinematic chains possibly including cycles. The algorithm con s that the kinematic chain is structured into a number of rigid groups articulated by preselected degrees of freedom. This structuration is exploited by a two-level spatially-adapted hierarchy. The proposed algorithm is not limited to particular kinematic topologies and allows good collision detection times. BioCD is also tailored to deal with the particularities imposed by the molecular context on collision detection. Experimental results show the effectiveness of the proposed approach which is able to process thousands of (self) collision tests per second on flexible protein models with up to hundreds of degrees of freedom.
DescriptionRobotics: Science and Systems Conference (RSS), 2005, Cambridge (EE.UU.)
URIhttp://hdl.handle.net/10261/30287
ISBN9780262701143
Appears in Collections:(IRII) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
doc1.pdf1,54 MBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 


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