Skip to main content

Bio-Inspired Scan Matching for Efficient Simultaneous Localization and Mapping

  • Conference paper
  • First Online:
Computational Science and Its Applications – ICCSA 2021 (ICCSA 2021)

Abstract

Simultaneous Localization And Mapping (SLAM) is a fundamental problem in robotic systems. In this work, we apply a derivative free bio-inspired techniques to the scan-matching step, which is a the main step in the SLAM problem based on the exploitation of swarm intelligence. For this purpose, we have explore the swarm intelligence optimization meta-heuristics based on the firefly behavior. Aiming at reducing further the translational and rotational scan alignment errors, the proposed scan matching proceeds in two main steps, namely scan-to-scan and scan-to-map matching. The proposed firefly-based implementation of the SLAM provides a good trade-off regarding accuracy and execution efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Akbari, R., Mohammadi, A., Ziarati, K.: A powerful bee swarm optimization algorithm. In: 2009 IEEE 13th International Multitopic Conference, pp. 1–6 (2009). https://doi.org/10.1109/INMIC.2009.5383155

  2. Baeck, T., Fogel, D., Michalewicz, Z.: Evolutionary Computation 1: Basic Algorithms and Operators (Chapter 23). Taylor & Francis, Oxon, OX (2000)

    Book  Google Scholar 

  3. Bentley, J.L.: Multidimensional divide-and-conquer. Commun. ACM 23(4), 214–229 (1980)

    Article  MathSciNet  Google Scholar 

  4. Bentley, J.L., Friedman, J.H.: Data structures for range searching. ACM Comput. Surv. 11(4), 397–409 (1979)

    Article  Google Scholar 

  5. Besl, P., McKay, N.: A method for registration of 3-d shapes. IEEE Trans. Pattern Anal. Mach. Intell. 14(2), 239–256 (1992)

    Article  Google Scholar 

  6. Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant algorithms for discrete optimization. Artif. Life 5, 137–172 (1999)

    Article  Google Scholar 

  7. Fister, I., Yang, X.S., Brest, J.: A comprehensive review of firefly algorithms. Swarm Evol. Comput. 13, 34–46 (2013)

    Article  Google Scholar 

  8. Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3(3), 209–226 (1977)

    Article  Google Scholar 

  9. Grisetti, G., Kummerle, R., Stachniss, C., Burgard, W.: A tutorial on graph-based SLAM. IEEE Intell. Transp. Syst. Mag. 2(4), 31–43 (12 2010)

    Google Scholar 

  10. Kaess, M., Ranganathan, A., Dellaert, F.: iSAM: incremental smoothing and mapping. IEEE Trans. Rob. 24, 1365–1378 (2008)

    Article  Google Scholar 

  11. Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony ABC algorithm. J. Global Optim. 39(3), 459–471 (2007)

    Article  MathSciNet  Google Scholar 

  12. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948. IEEE, Perth, WA, Australia, November 1995

    Google Scholar 

  13. Kümmerle, R., Grisetti, G., Strasdat, H., Konolige, K., Burgard, W.: G2O: a general framework for graph optimization. In: Proceedings - IEEE International Conference on Robotics and Automation, pp. 3607–3613. IEEE, Shanghai, China (2011)

    Google Scholar 

  14. Kümmerle, R.e.: On measuring the accuracy of SLAM algorithms. Autonomous Robots 27(4), 387 (2009)

    Google Scholar 

  15. Lu, F., Milios, E.: Globally consistent range scan alignment for environment mapping. Auton. Robot. 4(4), 333–349 (1997)

    Article  Google Scholar 

  16. Mobile Robot: Pioneer 3dx robot (2011). https://www.generationrobots.com/media/Pioneer3DX-P3DX-RevA.pdf

  17. Nedjah, N., Macedo Mourelle, L., Albuquerque de Oliveira, P.J.: Simultaneous localization and mapping using swarm intelligence based methods. Expert Syst. Appl. 159, 113547 (2020). https://doi.org/10.1016/j.eswa.2020.113547

  18. Oliveira, P.J.A., Nedjah, N., Mourelle, L.M.: SLAM baseado em scan-matching com otimização por enxame de partículas. In: Proceedings of the XIII Brazilian Congress on Computational Intelligence. Curitiba, Brazil (2017). https://doi.org/10.21528/CBIC2017-96

  19. Thrun, S., Burgard, W., Fox, D.: Probabilistic robotics (Chapters 6 and 10), 1 edn. The MIT Press, Cambridge (2005)

    Google Scholar 

  20. Zhang, Z.: Iterative point matching for registration of free-form curves. Int. J. Comput. Vision 13(2), 119–152 (1994)

    Google Scholar 

Download references

Acknowledgments

This study is financed in part by the Coordenação de Aperfeicoiamento de Pessoal de Nível Superior, Brasil (CAPES), Finance Code 001.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nadia Nedjah .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nedjah, N., Mourelle, L.d.M., de Oliveira, P.J.A. (2021). Bio-Inspired Scan Matching for Efficient Simultaneous Localization and Mapping. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2021. ICCSA 2021. Lecture Notes in Computer Science(), vol 12952. Springer, Cham. https://doi.org/10.1007/978-3-030-86973-1_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-86973-1_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-86972-4

  • Online ISBN: 978-3-030-86973-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics