Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A Heuristic Indoor Path Planning Method Based on Hierarchical Indoor Modelling

  • Conference paper
  • First Online:
Data Science (ICPCSEE 2018)

Abstract

Indoor path planning technology has become more and more extensive, e.g., indoor navigation and real-time scene construction. There are many difficulties in the existing indoor path planning researches, including the slower searching speed and the higher storage space cost, which is inability to meet user requirements in a complex indoor environment. This paper proposes a path planning method based on indoor maps. First, the indoor environment is hierarchically modelled, and then the corresponding path searching algorithm is developed to obtain the optimal path. Experimental results show that using the path planning method designed in this paper can effectively solve the above problems.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

References

  1. Cho, K., Suh, J., Tomlin, C.J., Oh, S.: Cost-aware path planning under co-safe temporal logic specifications. IEEE Robot. Autom. Lett. 2(4), 2308–2315 (2017)

    Article  Google Scholar 

  2. Xiong, Q., Zhu, Q., Zlatanova, S., Zhiqiang, D., Zhang, Y., Zeng, L.: Multi-level indoor path planning method. Int. Arch. Photogramm. Remote Sens. Spat. Inf. Sci. 40(4), 19 (2015)

    Article  Google Scholar 

  3. Peng, B., Lü, Z., Cheng, T.C.E.: A tabu search/path relinking algorithm to solve the job shop scheduling problem. Comput. Oper. Res. 53, 154–164 (2015)

    Article  MathSciNet  Google Scholar 

  4. Valencia, R., Andrade-Cetto, J.: Path planning in belief space with pose SLAM. Mapping, Planning and Exploration with Pose SLAM. STAR, vol. 119, pp. 53–87. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-60603-3_4

    Chapter  Google Scholar 

  5. Yu, L., Long, Z., Xi, N., Jia, Y., Ding, C.: Local path planning based on ridge regression extreme learning machines for an outdoor robot. In: 2015 IEEE International Conference on Robotics and Biomimetics (ROBIO), pp. 745–750. IEEE (2015)

    Google Scholar 

  6. Hossain, M.A., Ferdous, I.: Autonomous robot path planning in dynamic environment using a new optimization technique inspired by bacterial foraging technique. Robot. Auton. Syst. 64, 137–141 (2015)

    Article  Google Scholar 

  7. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. math. 1(1), 269–271 (1959)

    Article  MathSciNet  Google Scholar 

  8. Singh, Y., Sharma, S., Sutton, R., Hatton, D.C.: Optimal path planning of an unmanned surface vehicle in a real-time marine environment using dijkstra algorithm (2017)

    Google Scholar 

  9. Goldberg, A., Radzik, T.: A heuristic improvement of the Bellman-Ford algorithm. Technical report, STANFORD UNIV CA DEPT OF COMPUTER SCIENCE (1993)

    Google Scholar 

  10. Hagelbäck, J.: Hybrid pathfinding in starcraft. IEEE Trans. Comput. Intell. AI Games 8(4), 319–324 (2016)

    Article  Google Scholar 

  11. Harabor, D.D., Grastien, A., et al.: Online graph pruning for pathfinding on grid maps. In: AAAI (2011)

    Google Scholar 

  12. Zhou, K., Lingli, Y., Long, Z., Mo, S.: Local path planning of driverless car navigation based on jump point search method under urban environment. Futur. Internet 9(3), 51 (2017)

    Article  Google Scholar 

Download references

Acknowledgements

This work is supported by the Natural Science Foundation of Heilongjiang Province in China (No. F2016028, F2016009, F2015029, F2015045), the Youth Innovation Talent Project of Harbin University of Commerce in China (No. 2016Q N052), the Support Program for Young Academic Key Teacher of Higher Education of Heilongjiang Province (No. 1254G030), the Young Reserve Talents Research Foundation of Harbin Science and Technology Bureau (2015RQQXJ082), and the Fundamental Research Fund for the Central Universities in China (No. HEUCFM180604).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Guangsheng Feng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, J., Zhang, L., Zhao, Q., Wang, H., Lv, H., Feng, G. (2018). A Heuristic Indoor Path Planning Method Based on Hierarchical Indoor Modelling. In: Zhou, Q., Miao, Q., Wang, H., Xie, W., Wang, Y., Lu, Z. (eds) Data Science. ICPCSEE 2018. Communications in Computer and Information Science, vol 902. Springer, Singapore. https://doi.org/10.1007/978-981-13-2206-8_38

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-2206-8_38

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-2205-1

  • Online ISBN: 978-981-13-2206-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics