Skip to main content
Springer Nature Link
Log in

Hierarchical Topology Map with Explicit Corridor for global path planning of mobile robots

  • Original Research Paper
  • Published:
Intelligent Service Robotics Aims and scope Submit manuscript

Abstract

One way to construct a global path for a mobile robot is to extract the equidistant points from obstacles in an occupancy grid map (OGM) as its backbone of thin lines (skeleton) and find an appropriate path from them. Such skeleton-based methods are advantageous as they provide complete path planning, i.e., a feasible path is guaranteed to be found if it exists and often allow safe distances from obstacles with light computation. However, a skeleton path needs to be properly refined to avoid excessive bypasses, which inherently exist, and get an optimal path. This paper introduces hierarchical topology map with explicit corridor (HTM-EC) as a new skeleton-based strategy for global path planning with path optimization. HTM-EC is a skeleton-based hierarchical graph structure with a topology graph and the corresponding skeleton of a map, which can be an alternative map expression of an OGM. A skeleton path can be quickly obtained from the topology graph of HTM-EC as needed with the light computation facilitated by the significantly reduced size of searching space. The novelty of the paper lies on, first, the formulation of HTM-EC structure, and second, the refinement method of the given skeleton path with cost optimization by using corridor discretization and dynamic programming. For cost optimization, we incorporate the allowable speed that limits the navigation speed in narrow areas for safe operation, which enables a time-optimal path with the cost of traveling time. Simulations and experiments were conducted with real OGMs and a mobile robot to validate the proposed global planning method.

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

Access this article

Log in via an institution

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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Notes

  1. https://youtu.be/oDTTdYcj_qA.

References

  1. Bellman R (1966) Dynamic programming. Science 153(3731):34–37

    Article  MATH  Google Scholar 

  2. Bhattacharya P, Gavrilova ML (2007) Voronoi diagram in optimal path planning. In: 4th IEEE international symposium on Voronoi diagrams in science and engineering (ISVD 2007), pp 38–47

  3. Bhattacharya P, Gavrilova ML (2008) Roadmap-based path planning—using the Voronoi diagram for a clearance-based shortest path. IEEE Robot Autom Mag 15(2):58–66. https://doi.org/10.1109/MRA.2008.921540

    Article  Google Scholar 

  4. Brock O, Khatib O (1999) High-speed navigation using the global dynamic window approach. In: Proceedings 1999 IEEE international conference on robotics and automation (Cat. No. 99CH36288C), vol 1. IEEE, pp 341–346

  5. Choset H, Burdick J (2000) Sensor-based exploration: the hierarchical generalized Voronoi graph. Int J Robot Res 19(2):96–125

    Article  Google Scholar 

  6. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1(1):269–271

    Article  MathSciNet  MATH  Google Scholar 

  7. Dong Y, Camci E, Kayacan E (2018) Faster rrt-based nonholonomic path planning in 2d building environments using skeleton-constrained path biasing. J Intell Robot Syst 89(3):387–401

    Article  Google Scholar 

  8. Geraerts R (2010) Planning short paths with clearance using explicit corridors. In: 2010 IEEE international conference on robotics and automation. IEEE, pp 1997–2004

  9. Gómez JV, Mavridis N, Garrido S (2014) Fast marching solution for the social path planning problem. In: IEEE international conference on robotics and automation (ICRA), pp 1871–1876

  10. Han Jw, Jeon S, Kwon HJ (2019) A new global path planning strategy for mobile robots using hierarchical topology map and safety-aware navigation speed. In: 2019 IEEE/ASME international conference on advanced intelligent mechatronics (AIM). IEEE, pp 1586–1591

  11. Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100–107

    Article  Google Scholar 

  12. Holz D, Behnke S (2010) Intel Research Lab (Seattle). http://www.ais.uni-bonn.de/~holz/spmicp/files/intel_map.gif@ONLINE. Accessed 15 Jan 2019

  13. Karaman S, Frazzoli E (2011) Sampling-based algorithms for optimal motion planning. Int J Robot Res 30(7):846–894

    Article  MATH  Google Scholar 

  14. Karur K, Sharma N, Dharmatti C, Siegel JE (2021) A survey of path planning algorithms for mobile robots. Vehicles 3(3):448–468

    Article  Google Scholar 

  15. Kavraki LE, Kolountzakis MN, Latombe JC (1996) Analysis of probabilistic roadmaps for path planning. In: IEEE international conference on robotics and automation (ICRA), vol 4, pp 3020–3025

  16. Khatib O (1985) Real-time obstacle avoidance for manipulators and mobile robots. In: Proceedings of the 1985 IEEE international conference on robotics and automation, vol 2. IEEE, pp 500–505

  17. Kiani F, Seyyedabbasi A, Aliyev R, Gulle MU, Basyildiz H, Shah MA (2021) Adapted-rrt: novel hybrid method to solve three-dimensional path planning problem using sampling and metaheuristic-based algorithms. Neural Comput Appl 33(22):15569–15599

    Article  Google Scholar 

  18. Kunz T, Stilman M (2015) Kinodynamic rrts with fixed time step and best-input extension are not probabilistically complete. In: Algorithmic foundations of robotics XI. Springer, pp 233–244

  19. LaValle SM, Kuffner JJ, Donald B et al (2001) Rapidly-exploring random trees: progress and prospects. Algorithm Comput Robot New Direct 5:293–308

    MATH  Google Scholar 

  20. Marder-Eppstein E, Lu DV (2013) ROS global planner. https://github.com/ros-planning/navigation/blob/noetic-devel/global_planner/src/dijkstra.cpp@ONLINE. Accessed 30 July 2020

  21. Moll M, Sucan IA, Kavraki LE (2015) Benchmarking motion planning algorithms: an extensible infrastructure for analysis and visualization. IEEE Robot Autom Mag 22(3):96–102

    Article  Google Scholar 

  22. Ogniewicz R, Ilg M (1992) Voronoi skeletons: theory and applications. In: IEEE computer society conference on computer vision and pattern recognition, pp 63–69

  23. Orozco-Rosas U, Montiel O, Sepúlveda R (2019) Mobile robot path planning using membrane evolutionary artificial potential field. Appl Soft Comput 77:236–251

    Article  Google Scholar 

  24. Orozco-Rosas U, Picos K, Montiel O (2019) Hybrid path planning algorithm based on membrane pseudo-bacterial potential field for autonomous mobile robots. IEEE Access 7:156787–156803

    Article  Google Scholar 

  25. Paden B, Čáp M, Yong SZ, Yershov D, Frazzoli E (2016) A survey of motion planning and control techniques for self-driving urban vehicles. IEEE Trans Intell Veh 1(1):33–55

    Article  Google Scholar 

  26. Pradhan S, Mandava RK, Vundavilli PR (2021) Development of path planning algorithm for biped robot using combined multi-point rrt and visibility graph. Int J Inf Technol 13(4):1513–1519

    Google Scholar 

  27. Robotnik Inc (2017) Willow Garage Map. https://github.com/RobotnikAutomation/summit_xl_common/blob/kinetic-devel/summit_xl_localization/maps/willow_garage/willow_garage.pgm@ONLINE. Accessed 30 July 2020

  28. Rösmann C, Feiten W, Wösch T, Hoffmann F, Bertram T (2012) Trajectory modification considering dynamic constraints of autonomous robots. In: ROBOTIK 2012; 7th German conference on robotics. VDE, pp 1–6

  29. Sethian JA et al (2003) Level set methods and fast marching methods. J Comput Inf Technol 11(1):1–2

    Google Scholar 

  30. Song R, Liu Y, Bucknall R (2017) A multi-layered fast marching method for unmanned surface vehicle path planning in a time-variant maritime environment. Ocean Eng 129:301–317

    Article  Google Scholar 

  31. Thrun S (1998) Learning metric-topological maps for indoor mobile robot navigation. Artif Intell 99(1):21–71

    Article  MATH  Google Scholar 

  32. Tsardoulias EG, Iliakopoulou A, Kargakos A, Petrou L (2016) A review of global path planning methods for occupancy grid maps regardless of obstacle density. J Intell Robot Syst 84(1):829–858

    Article  Google Scholar 

  33. van Toll W, Cook AF IV, van Kreveld MJ, Geraerts R (2017) The explicit corridor map: a medial axis-based navigation mesh for multi-layered environments. arXiv preprint arXiv:1701.05141

  34. Wang J, Meng MQH (2020) Optimal path planning using generalized Voronoi graph and multiple potential functions. IEEE Trans Ind Electron 67(12):10621–10630

    Article  MathSciNet  Google Scholar 

  35. Wang Q, Langerwisch M, Wagner B (2013) Wide range global path planning for a large number of networked mobile robots based on generalized Voronoi diagrams. IFAC Proc Vol 46(29):107–112

    Article  Google Scholar 

  36. Zhang T, Suen CY (1984) A fast parallel algorithm for thinning digital patterns. Commun ACM 27(3):236–239

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by Natural Sciences and Engineering Research Council (NSERC) of Canada under the Strategic Partnership Grant for Projects (STPGP-506987-2017). The authors would like to thank James Kattukudiyil for his support for the code implementation and Sooyong Kim for his support during the experiment.

Author information

Authors and Affiliations

  1. University of Waterloo, Waterloo, ON, Canada

    Jeong-woo Han, Soo Jeon & Hyock Ju Kwon

Authors
  1. Jeong-woo Han
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Soo Jeon
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Hyock Ju Kwon
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Jeong-woo Han.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix A

Appendix A

figure d
figure e

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Han, Jw., Jeon, S. & Kwon, H.J. Hierarchical Topology Map with Explicit Corridor for global path planning of mobile robots. Intel Serv Robotics 16, 195–212 (2023). https://doi.org/10.1007/s11370-023-00458-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11370-023-00458-6

Keywords