Title:
Closing the Loop with Graphical SLAM

dc.contributor.author Folkesson, John
dc.contributor.author Christensen, Henrik I.
dc.contributor.corporatename Georgia Institute of Technology. College of Computing
dc.contributor.corporatename Massachusetts Institute of Technology
dc.contributor.corporatename Georgia Institute of Technology. Center for Robotics and Intelligent Machines
dc.date.accessioned 2011-03-16T14:15:55Z
dc.date.available 2011-03-16T14:15:55Z
dc.date.issued 2007-08
dc.description (c) 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. en_US
dc.description Digital Object Identifier: 10.1109/TRO.2007.900608
dc.description.abstract The problem of simultaneous localization and mapping (SLAM) is addressed using a graphical method. The main contributions are a computational complexity that scales well with the size of the environment, the elimination of most of the linearization inaccuracies, and a more flexible and robust data association. We also present a detection criteria for closing loops.We show how multiple topological constraints can be imposed on the graphical solution by a process of coarse fitting followed by fine tuning. The coarse fitting is performed using an approximate system. This approximate system can be shown to possess all the local symmetries. Observations made during the SLAM process often contain symmetries, that is to say, directions of change to the state space that do not affect the observed quantities. It is important that these directions do not shift as we approximate the system by, for example, linearization. The approximate system is both linear and block diagonal. This makes it a very simple system to work with especially when imposing global topological constraints on the solution. These global constraints are nonlinear. We show how these constraints can be discovered automatically.We develop a method of testing multiple hypotheses for data matching using the graph. This method is derived from statistical theory and only requires simple counting of observations. The central insight is to examine the probability of not observing the same features on a return to a region. We present results with data from an outdoor scenario using a SICK laser scanner. en_US
dc.identifier.citation Folkesson, J., and Christensen, H. I. Closing the loop with Graphical SLAM. IEEE Trans. on Robotics 23, 4 (Aug. 2007), 731-741. en_US
dc.identifier.issn 1552-3098
dc.identifier.uri http://hdl.handle.net/1853/37756
dc.language.iso en_US en_US
dc.publisher Georgia Institute of Technology en_US
dc.publisher.original Institute of Electrical and Electronics Engineers
dc.subject Autonomous navigation en_US
dc.subject Data association en_US
dc.subject Localization en_US
dc.subject Mapping en_US
dc.subject Mobile robots en_US
dc.subject Nonlinear estimation en_US
dc.subject Simultaneous localization and mapping en_US
dc.title Closing the Loop with Graphical SLAM en_US
dc.type Text
dc.type.genre Article
dspace.entity.type Publication
local.contributor.author Christensen, Henrik I.
local.contributor.corporatename Institute for Robotics and Intelligent Machines (IRIM)
relation.isAuthorOfPublication afdc727f-2705-4744-945f-e7d414f2212b
relation.isOrgUnitOfPublication 66259949-abfd-45c2-9dcc-5a6f2c013bcf
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
04285846.pdf
Size:
566.44 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.76 KB
Format:
Item-specific license agreed upon to submission
Description: