Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Closing the Loop With Graphical SLAM
KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS. (CAS)ORCID iD: 0000-0002-7796-1438
2007 (English)In: IEEE Transactions on robotics, ISSN 1552-3098, E-ISSN 1941-0468, Vol. 23, no 4, 731-741 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2007. Vol. 23, no 4, 731-741 p.
Keyword [en]
autonomous navigation, data association, localization, mapping, mobile robots, nonlinear estimation, simultaneous localization and mapping (SLAM)
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:kth:diva-38231DOI: 10.1109/TRO.2007.900608ISI: 000248671300008OAI: oai:DiVA.org:kth-38231DiVA: diva2:436296
Available from: 2011-08-23 Created: 2011-08-23 Last updated: 2017-12-08Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Folkesson, John

Search in DiVA

By author/editor
Folkesson, John
By organisation
Centre for Autonomous Systems, CAS
In the same journal
IEEE Transactions on robotics
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 47 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf