By Topic

Solving computational and memory requirements of feature-based simultaneous localization and mapping algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Guivant, J.E. ; Australian Centre for Field Robotics, Univ. of Sydney, NSW, Australia ; Nebot, E.M.

This paper presents new algorithms to implement simultaneous localization and mapping in environments with very large numbers of features. The algorithms present an efficient solution to the full update required by the compressed extended Kalman filter algorithm. It makes use of the relative landmark representation to develop very close to optimal decorrelation solutions. With this approach, the memory and computational requirements are reduced from ∼O(N2) to ∼O(N*Na), N and Na proportional to the number of features in the map and features close to the vehicle, respectively. Experimental results are presented to verify the operation of the system when working in large outdoor environments.

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:19 ,  Issue: 4 )