English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/96308
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

A singularity-free path planner for closed-chain manipulators

AuthorsBohigas, Oriol ; Henderson, M. E.; Ros, Lluís ; Porta, Josep M.
Issue Date2012
PublisherInstitute of Electrical and Electronics Engineers
CitationIEEE International Conference on Robotics and Automation: 2128-2134 (2012)
AbstractThis paper provides an algorithm for computing singularity-free paths on non-redundant closed-chain manipulators. Given two non-singular configurations of the manipulator, the method attempts to connect them through a configuration space path that maintains a minimum clearance with respect to the singularity locus at all points. The method is resolution-complete, in the sense that it always returns a path if one exists at a given resolution, or returns failure otherwise. The path is computed by defining a new manifold that maintains a one-to-one correspondence with the singularity-free configuration space of the manipulator, and then using a higher-dimensional continuation technique to explore this manifold systematically from one configuration, until the second configuration is found. Examples are included that demonstrate the performance of the method on illustrative situations.
DescriptionTrabajo presentado al ICRA celebrado en Minnesota del 14 al 18 de mayo de 2012.
Publisher version (URL)http://dx.doi.org/10.1109/ICRA.2012.6224899
URIhttp://hdl.handle.net/10261/96308
DOI10.1109/ICRA.2012.6224899
Identifiersdoi: 10.1109/ICRA.2012.6224899
isbn: 978-1-4673-1403-9
Appears in Collections:(IRII) Libros y partes de libros
Files in This Item:
File Description SizeFormat 
A Singularity-free.pdf2,37 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.