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

CuikSLAM: A Kinematic-based approach to SLAM

AuthorsPorta, Josep M.
KeywordsSLAM
Kinematics
Interval-based methods
Automation: Robots
Robots
Robotics
Issue Date2005
PublisherInstitute of Electrical and Electronics Engineers
CitationIEEE International Conference on Robotics and Automation: 2425-2431 (2005)
AbstractIn this paper, we depart from the fact that Simultaneous Localization and Mapping (SLAM) is a sub-case of the general kinematic problem, and, thus, all techniques used in kinematics are potentially applicable to SLAM. We describe how to formalize a SLAM problem as a typical kinematic problem and we propose a simple SLAM algorithm based on an interval-based kinematic method called Cuik previously developed in our group. This new algorithm solves the SLAM problem taking advantage of the structure imposed in the SLAM problem by the motion and sensing capabilities of the autonomous robots. However, since we use a kinematic approach instead of a probabilistic one (the usual approach for SLAM) we can perfectly model the constraints between robot poses and between robot poses and landmarks, including the nonlinearities, and we can ensure those constraints to be fulfilled at any time during the map construction and refinement. The viability of the new algorithm is shown with a small test.
DescriptionIEEE International Conference on Robotics and Automation (ICRA), 2005, Barcelona (España)
URIhttp://hdl.handle.net/10261/30289
ISBN078038914X
Appears in Collections:(IRII) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
doc1.pdf217,95 kBAdobe 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.