{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T01:57:22Z","timestamp":1773107842656,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T00:00:00Z","timestamp":1676505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T00:00:00Z","timestamp":1676505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["STPGP-506987-2017"],"award-info":[{"award-number":["STPGP-506987-2017"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Intel Serv Robotics"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s11370-023-00458-6","type":"journal-article","created":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T21:40:21Z","timestamp":1676583621000},"page":"195-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Hierarchical Topology Map with Explicit Corridor for global path planning of mobile robots"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3091-7605","authenticated-orcid":false,"given":"Jeong-woo","family":"Han","sequence":"first","affiliation":[]},{"given":"Soo","family":"Jeon","sequence":"additional","affiliation":[]},{"given":"Hyock Ju","family":"Kwon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,16]]},"reference":[{"issue":"3731","key":"458_CR1","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1126\/science.153.3731.34","volume":"153","author":"R Bellman","year":"1966","unstructured":"Bellman R (1966) Dynamic programming. Science 153(3731):34\u201337","journal-title":"Science"},{"key":"458_CR2","doi-asserted-by":"crossref","unstructured":"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\u201347","DOI":"10.1109\/ISVD.2007.43"},{"issue":"2","key":"458_CR3","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/MRA.2008.921540","volume":"15","author":"P Bhattacharya","year":"2008","unstructured":"Bhattacharya P, Gavrilova ML (2008) Roadmap-based path planning\u2014using the Voronoi diagram for a clearance-based shortest path. IEEE Robot Autom Mag 15(2):58\u201366. https:\/\/doi.org\/10.1109\/MRA.2008.921540","journal-title":"IEEE Robot Autom Mag"},{"key":"458_CR4","doi-asserted-by":"crossref","unstructured":"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\u00a01. IEEE, pp 341\u2013346","DOI":"10.1109\/ROBOT.1999.770002"},{"issue":"2","key":"458_CR5","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1177\/02783640022066770","volume":"19","author":"H Choset","year":"2000","unstructured":"Choset H, Burdick J (2000) Sensor-based exploration: the hierarchical generalized Voronoi graph. Int J Robot Res 19(2):96\u2013125","journal-title":"Int J Robot Res"},{"issue":"1","key":"458_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1(1):269\u2013271","journal-title":"Numerische Mathematik"},{"issue":"3","key":"458_CR7","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10846-017-0567-9","volume":"89","author":"Y Dong","year":"2018","unstructured":"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\u2013401","journal-title":"J Intell Robot Syst"},{"key":"458_CR8","doi-asserted-by":"crossref","unstructured":"Geraerts R (2010) Planning short paths with clearance using explicit corridors. In: 2010 IEEE international conference on robotics and automation. IEEE, pp 1997\u20132004","DOI":"10.1109\/ROBOT.2010.5509263"},{"key":"458_CR9","doi-asserted-by":"crossref","unstructured":"G\u00f3mez 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\u20131876","DOI":"10.1109\/ICRA.2014.6907105"},{"key":"458_CR10","doi-asserted-by":"crossref","unstructured":"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\u20131591","DOI":"10.1109\/AIM.2019.8868423"},{"issue":"2","key":"458_CR11","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"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\u2013107","journal-title":"IEEE Trans Syst Sci Cybern"},{"key":"458_CR12","unstructured":"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"},{"issue":"7","key":"458_CR13","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S Karaman","year":"2011","unstructured":"Karaman S, Frazzoli E (2011) Sampling-based algorithms for optimal motion planning. Int J Robot Res 30(7):846\u2013894","journal-title":"Int J Robot Res"},{"issue":"3","key":"458_CR14","doi-asserted-by":"publisher","first-page":"448","DOI":"10.3390\/vehicles3030027","volume":"3","author":"K Karur","year":"2021","unstructured":"Karur K, Sharma N, Dharmatti C, Siegel JE (2021) A survey of path planning algorithms for mobile robots. Vehicles 3(3):448\u2013468","journal-title":"Vehicles"},{"key":"458_CR15","doi-asserted-by":"crossref","unstructured":"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\u20133025","DOI":"10.1109\/70.508439"},{"key":"458_CR16","doi-asserted-by":"crossref","unstructured":"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\u00a02. IEEE, pp 500\u2013505","DOI":"10.1109\/ROBOT.1985.1087247"},{"issue":"22","key":"458_CR17","doi-asserted-by":"publisher","first-page":"15569","DOI":"10.1007\/s00521-021-06179-0","volume":"33","author":"F Kiani","year":"2021","unstructured":"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\u201315599","journal-title":"Neural Comput Appl"},{"key":"458_CR18","doi-asserted-by":"crossref","unstructured":"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\u2013244","DOI":"10.1007\/978-3-319-16595-0_14"},{"key":"458_CR19","first-page":"293","volume":"5","author":"SM LaValle","year":"2001","unstructured":"LaValle SM, Kuffner JJ, Donald B et al (2001) Rapidly-exploring random trees: progress and prospects. Algorithm Comput Robot New Direct 5:293\u2013308","journal-title":"Algorithm Comput Robot New Direct"},{"key":"458_CR20","unstructured":"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"},{"issue":"3","key":"458_CR21","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/MRA.2015.2448276","volume":"22","author":"M Moll","year":"2015","unstructured":"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\u2013102","journal-title":"IEEE Robot Autom Mag"},{"key":"458_CR22","doi-asserted-by":"crossref","unstructured":"Ogniewicz R, Ilg M (1992) Voronoi skeletons: theory and applications. In: IEEE computer society conference on computer vision and pattern recognition, pp 63\u201369","DOI":"10.1109\/CVPR.1992.223226"},{"key":"458_CR23","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.asoc.2019.01.036","volume":"77","author":"U Orozco-Rosas","year":"2019","unstructured":"Orozco-Rosas U, Montiel O, Sep\u00falveda R (2019) Mobile robot path planning using membrane evolutionary artificial potential field. Appl Soft Comput 77:236\u2013251","journal-title":"Appl Soft Comput"},{"key":"458_CR24","doi-asserted-by":"publisher","first-page":"156787","DOI":"10.1109\/ACCESS.2019.2949835","volume":"7","author":"U Orozco-Rosas","year":"2019","unstructured":"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\u2013156803","journal-title":"IEEE Access"},{"issue":"1","key":"458_CR25","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/TIV.2016.2578706","volume":"1","author":"B Paden","year":"2016","unstructured":"Paden B, \u010c\u00e1p 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\u201355","journal-title":"IEEE Trans Intell Veh"},{"issue":"4","key":"458_CR26","first-page":"1513","volume":"13","author":"S Pradhan","year":"2021","unstructured":"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\u20131519","journal-title":"Int J Inf Technol"},{"key":"458_CR27","unstructured":"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"},{"key":"458_CR28","unstructured":"R\u00f6smann C, Feiten W, W\u00f6sch 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\u20136"},{"issue":"1","key":"458_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2498\/cit.2003.01.01","volume":"11","author":"JA Sethian","year":"2003","unstructured":"Sethian JA et al (2003) Level set methods and fast marching methods. J Comput Inf Technol 11(1):1\u20132","journal-title":"J Comput Inf Technol"},{"key":"458_CR30","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.oceaneng.2016.11.009","volume":"129","author":"R Song","year":"2017","unstructured":"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\u2013317","journal-title":"Ocean Eng"},{"issue":"1","key":"458_CR31","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0004-3702(97)00078-7","volume":"99","author":"S Thrun","year":"1998","unstructured":"Thrun S (1998) Learning metric-topological maps for indoor mobile robot navigation. Artif Intell 99(1):21\u201371","journal-title":"Artif Intell"},{"issue":"1","key":"458_CR32","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s10846-016-0362-z","volume":"84","author":"EG Tsardoulias","year":"2016","unstructured":"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\u2013858","journal-title":"J Intell Robot Syst"},{"key":"458_CR33","unstructured":"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"},{"issue":"12","key":"458_CR34","doi-asserted-by":"publisher","first-page":"10621","DOI":"10.1109\/TIE.2019.2962425","volume":"67","author":"J Wang","year":"2020","unstructured":"Wang J, Meng MQH (2020) Optimal path planning using generalized Voronoi graph and multiple potential functions. IEEE Trans Ind Electron 67(12):10621\u201310630","journal-title":"IEEE Trans Ind Electron"},{"issue":"29","key":"458_CR35","doi-asserted-by":"publisher","first-page":"107","DOI":"10.3182\/20131111-3-KR-2043.00007","volume":"46","author":"Q Wang","year":"2013","unstructured":"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\u2013112","journal-title":"IFAC Proc Vol"},{"issue":"3","key":"458_CR36","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/357994.358023","volume":"27","author":"T Zhang","year":"1984","unstructured":"Zhang T, Suen CY (1984) A fast parallel algorithm for thinning digital patterns. Commun ACM 27(3):236\u2013239","journal-title":"Commun ACM"}],"container-title":["Intelligent Service Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-023-00458-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11370-023-00458-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-023-00458-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T15:16:35Z","timestamp":1681226195000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11370-023-00458-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,16]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["458"],"URL":"https:\/\/doi.org\/10.1007\/s11370-023-00458-6","relation":{},"ISSN":["1861-2776","1861-2784"],"issn-type":[{"value":"1861-2776","type":"print"},{"value":"1861-2784","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,16]]},"assertion":[{"value":"25 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}