Global Optimization for 2D SLAM Problem

  • Usman Qayyum
  • Jonghyuk Kim
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 283)


A globally optimal approach is proposed in this work for map-joining SLAM problem. Traditionally local optimization based approaches are adapted for SLAM problem but due to highly non-convex nature of the SLAM problem, they are susceptible to local minima. In this work, we have exploited the theoretical limit on the number of local minima. The proposed approach is not dependent upon the good initial guess whereas existing approaches in SLAM literature requires a good starting point for convergence to the basin of global minima. Simulation and real dataset results are provided to validate the robustness of the approach to converge to global minima. This chapter provides the robotics community to look into the SLAM problem with global optimization approach by guarantying the global optimal solution in a least square cost function particularly when covariance matrices are defined as spherical.


Local minima Map-joining Gauss-Newton optimization Greedy random adaptive search procedure Optimal solution 



This work is supported by the ARC DP Project (DP0987829) funded by the Australian Research Council (ARC). We are also thankful to [10] and [19] for open source implementation and datasets.


  1. 1.
    Bailey, T., Durrant-Whyte, H.: Simultaneous localization and mapping (SLAM): Part II. IEEE Robot. Autom. Mag. 13(3), 108–117 (2006)CrossRefGoogle Scholar
  2. 2.
    Lu, F., Milios, E.: Globally consistent range scan alignment for environment mapping, J. Auton. Robots 4, 333–349 (1997)Google Scholar
  3. 3.
    Huang, S., Wang, Z., Dissanayake, G.: Sparse local submap joining filter for building large-scale maps. IEEE Trans. Robot. 24(5), 1121–1130 (2008)Google Scholar
  4. 4.
    Doucet, A., Freitas, N., Murphy, K. Russel, S.: Blackwellized particle filtering for dynamic bayesian networks. In: International Conference on Uncertainty in Artificial Intelligence, p. 17618 (2002)Google Scholar
  5. 5.
    Duckett, T., Marsland, S. Shapiro, J.: Fast, on-line learning of globally consistent map. J. Global Optim. 12(3), 287–300 (2002)Google Scholar
  6. 6.
    Frese, U., Larsson, P., Duckett, T.: A multilevel relaxation algorithm for simultaneous localization and mapping. IEEE Trans. Robot. 21(2), 196–207 (2005)CrossRefGoogle Scholar
  7. 7.
    Dellaert, F., Kaess, M.: Square root SAM: Simultaneous localization and mapping via square root information smoothing. Int. J. Robot. Res. 25(12), 1181–1203 (2006)CrossRefMATHGoogle Scholar
  8. 8.
    Olson, E., Leonard, J., Teller, S.: Fast iterative optimization of pose graphs with poor initial estimates. In: IEEE International Conference on Robotics and Automation (ICRA), pp. 2262–2269 (2006)Google Scholar
  9. 9.
    Kummerle, R., Grisetti, G., Strasdat, H., Konolige, K., Burgard, W.: g2o: A general framework for graph optimization. In: IEEE International Conference on Robotics and Automation (ICRA), (2011)Google Scholar
  10. 10.
    Kurlbaum, J., Frese, U.: A benchmark data set for data association, Technical Report, University of Bremen, Data Available on, (2010)
  11. 11.
    Freund, R., Jarr, F.: Solving the sum-of-ratios problem by an interior-point method. J. Global Optim. 19(1), 83–102 (2001)Google Scholar
  12. 12.
    Astrom, K., Enqvist, O., Olsson, C., Kahl, F., Hartley, R.: An L\(\infty \) approach to structure and motion problems in 1D-vision. In: International Conference on Computer Vision (ICCV) (2007)Google Scholar
  13. 13.
    Olsson, C., Kahl, F., Oskarsson, M: Branch and bound methods for euclidean registration problems. In: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)Google Scholar
  14. 14.
    Iser, R., Wahl, F.: AntSLAM: global map optimization using swarm intelligence. In: IEEE International Conference on Robotics and Automation (ICRA), pp. 265–272 (2010)Google Scholar
  15. 15.
    Huang, S., Wang, H., Frese, U., Dissanayake, G.: On the number of local minima to the point feature based SLAM problem. In: IEEE International Conference on Robotics and Automation (ICRA), pp. 265–272 (2012)Google Scholar
  16. 16.
    Resende, M., Ribeiro, C.: Greedy randomized adaptive search procedures. In: Handbook of Metaheuristics, pp. 219–249 (2003)Google Scholar
  17. 17.
    Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35(3), 268–308 (2003)Google Scholar
  18. 18.
    Ni, K., Steedly, D., Dellaert, F.: Tectonic sam: exact, out-of-core, submap-based slam. In: IEEE International Conference on Robotics and Automation (ICRA), pp. 1678–1685 (2007)Google Scholar
  19. 19.
    Huang, S., Wang, Z., Dissanayake, G. Frese, U.: Iterated SLSJF: A sparse local submap joining algorithm with improved consistency. In: Australasian Conference on Robotics and Automation (ACRA) (2008)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.School of EngineeringAustralian National UniversityCanberraAustralia

Personalised recommendations