Skip to main content

A Separate Data Structure for Online Multi-hypothesis Topological Mapping

  • Conference paper
  • First Online:
Intelligent Robotics and Applications (ICIRA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11743))

Included in the following conference series:

  • 2700 Accesses

Abstract

This paper proposes an algorithm for topological simultaneous localization and mapping (SLAM) using multi-hypothesis method. This algorithm focuses on improving on-board computational efficiency and capability of finding out the correct hypothesis as early as possible. In the algorithm, an innovative data structure is applied, in which the edges and vertexes of the topological graph are stored separately. So that detailed information of the vertexes has only one copy in the storage, which also benefits saving communication bandwidth. Then, lots of repetitive loop-closing tests in similar hypothesizes are simplified to one single test that only uses vertexes storage. Lastly, incorporating with the data structure, loop closure situations can be evaluated as soon as it happens. In a word, the algorithm is highly efficient to cope with the hyper-exponential growth disaster caused by perceptual aliasing. The work is evaluated by simulations and demonstrated on a maze-like scenario with a Micro-Aerial Vehicle (MAV) equipped a computational resources restricted computer.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Notes

  1. 1.

    All source code in this paper can be found here: https://github.com/StumboEugen/topology_map.

  2. 2.

    The experiment video can be found here: https://jbox.sjtu.edu.cn/l/uoaCIv.

References

  1. Mur-Artal, R., Montiel, J.M.M., Tardos, J.D.: ORB-SLAM: a versatile and accurate monocular slam system. IEEE Trans. Robot. 31(5), 1147–1163 (2015)

    Article  Google Scholar 

  2. Hornung, A., Wurm, K.M., Bennewitz, M., Stachniss, C., Burgard, W.: OctoMap: an efficient probabilistic 3D mapping framework based on octrees. Auton. Robot. 34(3), 189–206 (2013)

    Article  Google Scholar 

  3. Chrastil, E.R., Warren, W.H.: Active and passive spatial learning in human navigation: acquisition of graph knowledge. J. Exp. Psychol. Learn. Mem. Cogn. 39(5), 1520–1537 (2013)

    Article  Google Scholar 

  4. Kuipers, B., Browning, R., Gribble, B., Hewett, M., Remolina, E.: The spatial semantic hierarchy. Artif. Intell. 119(1–2), 191–233 (2000)

    Article  MathSciNet  Google Scholar 

  5. Ranganathan, A., Dellaert, F.: Inference in the space of topological maps: an MCMC-based approach. In: IEEE/RSJ International Conference on Intelligent Robots & Systems (2008)

    Google Scholar 

  6. Marinakis, D., Dudek, G.: Pure topological mapping in mobile robotics. IEEE Trans. Robot. 26(6), 1051–1064 (2010)

    Article  Google Scholar 

  7. Chrastil, E.R., Warren, W.H.: From cognitive maps to cognitive graphs. PLoS ONE 9(11), e112544 (2014)

    Article  Google Scholar 

  8. Kuipers, B., Modayil, J., Beeson, P., Macmahon, M., Savelli, F.: Local metrical and global topological maps in the hybrid spatial semantic hierarchy. In: IEEE International Conference on Robotics & Automation (2004)

    Google Scholar 

  9. Savelli, F., Kuipers, B.: Loop-closing and planarity in topological map-building. In: IEEE/RSJ International Conference on Intelligent Robots & Systems (2004)

    Google Scholar 

  10. Tully, S., Kantor, G., Choset, H., Werner, F.: Multi-hypothesis topological slam approach for loop closing on edge-ordered graphs. In: IEEE/RSJ International Conference on Intelligent Robots & Systems (2009)

    Google Scholar 

  11. Tully, S., Kantor, G., Choset, H.: A unified Bayesian framework for global localization and SLAM in hybrid metric/topological maps (2012)

    Article  Google Scholar 

  12. Johnson, C., Kuipers, B.: Efficient search for correct and useful topological maps. In: IEEE/RSJ International Conference on Intelligent Robots & Systems (2012)

    Google Scholar 

  13. Remolina, E., Kuipers, B.: Towards a general theory of topological maps. Artif. Intell. 152(1), 47–104 (2004)

    Article  MathSciNet  Google Scholar 

  14. Ranganathan, A., Dellaert, F.: Online probabilistic topological mapping. Int. J. Robot. Res. 30(6), 755–771 (2011)

    Article  Google Scholar 

  15. Vijayan, G., Wigderson, A.: Planarity of edge ordered graphs. Technical report 307, Depart (1982)

    Google Scholar 

Download references

Acknowledgement

This work was partially supported by National Science and Technology Major Project (2017ZX01041101-003) and National Natural Science Foundation of China (Grant No. 51605282).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xinjun Sheng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Gong, C., Chen, G., Dong, W., Sheng, X., Zhu, X. (2019). A Separate Data Structure for Online Multi-hypothesis Topological Mapping. In: Yu, H., Liu, J., Liu, L., Ju, Z., Liu, Y., Zhou, D. (eds) Intelligent Robotics and Applications. ICIRA 2019. Lecture Notes in Computer Science(), vol 11743. Springer, Cham. https://doi.org/10.1007/978-3-030-27538-9_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-27538-9_58

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-27537-2

  • Online ISBN: 978-3-030-27538-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics