{"id":"https://openalex.org/W2980721454","doi":"https://doi.org/10.1109/aim.2019.8868423","title":"A New Global Path Planning Strategy for Mobile Robots Using Hierarchical Topology Map and Safety-Aware Navigation Speed","display_name":"A New Global Path Planning Strategy for Mobile Robots Using Hierarchical Topology Map and Safety-Aware Navigation Speed","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2980721454","doi":"https://doi.org/10.1109/aim.2019.8868423","mag":"2980721454"},"language":"en","primary_location":{"id":"doi:10.1109/aim.2019.8868423","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aim.2019.8868423","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102913575","display_name":"Jeong Woo Han","orcid":"https://orcid.org/0000-0003-3091-7605"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Jeong-woo Han","raw_affiliation_strings":["Mechanical and Mechatronics Engineering, University of Waterloo, CANADA"],"affiliations":[{"raw_affiliation_string":"Mechanical and Mechatronics Engineering, University of Waterloo, CANADA","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060527481","display_name":"Soo Jeon","orcid":"https://orcid.org/0000-0002-3148-1658"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Soo Jeon","raw_affiliation_strings":["Mechanical and Mechatronics Engineering, University of Waterloo, CANADA"],"affiliations":[{"raw_affiliation_string":"Mechanical and Mechatronics Engineering, University of Waterloo, CANADA","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024242719","display_name":"Hyock\u2010Ju Kwon","orcid":"https://orcid.org/0000-0003-1354-0391"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Hyock-Ju Kwon","raw_affiliation_strings":["Mechanical and Mechatronics Engineering, University of Waterloo, CANADA"],"affiliations":[{"raw_affiliation_string":"Mechanical and Mechatronics Engineering, University of Waterloo, CANADA","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102913575"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":0.2024,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.54616318,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1586","last_page":"1591"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10879","display_name":"Robotic Locomotion and Control","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7549133896827698},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6066652536392212},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5987721085548401},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.5705280900001526},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.5227929949760437},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5062762498855591},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.45715636014938354},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45364922285079956},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.44380757212638855},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4434368312358856},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.4222470819950104},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41884130239486694},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.41543954610824585},{"id":"https://openalex.org/keywords/configuration-space","display_name":"Configuration space","score":0.41366150975227356},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37665584683418274},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3044692575931549},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2715460956096649},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2258908748626709},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11160668730735779}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7549133896827698},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6066652536392212},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5987721085548401},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5705280900001526},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.5227929949760437},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5062762498855591},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.45715636014938354},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45364922285079956},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.44380757212638855},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4434368312358856},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.4222470819950104},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41884130239486694},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.41543954610824585},{"id":"https://openalex.org/C90738871","wikidata":"https://www.wikidata.org/wiki/Q41642869","display_name":"Configuration space","level":2,"score":0.41366150975227356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37665584683418274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3044692575931549},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2715460956096649},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2258908748626709},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11160668730735779},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aim.2019.8868423","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aim.2019.8868423","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6700000166893005,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W1160995053","https://openalex.org/W1587371456","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W1971639106","https://openalex.org/W1974909294","https://openalex.org/W2000359213","https://openalex.org/W2039204626","https://openalex.org/W2079713137","https://openalex.org/W2092507038","https://openalex.org/W2096636360","https://openalex.org/W2117211893","https://openalex.org/W2143102370","https://openalex.org/W2166077797","https://openalex.org/W2169528473","https://openalex.org/W2343568200","https://openalex.org/W4249787530","https://openalex.org/W6605295560"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W2368795992","https://openalex.org/W2005695917","https://openalex.org/W1490490684","https://openalex.org/W2333571655","https://openalex.org/W2104320275","https://openalex.org/W4367628293","https://openalex.org/W2268712943"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3],"efficient":[4],"global":[5],"path":[6,142,151,174,186,235],"planning":[7],"method":[8,200,215],"for":[9],"a":[10,14,19,61,71,78,89,94,170,180,220],"mobile":[11],"robot":[12,31],"using":[13,96,219],"new":[15,62],"skeleton":[16,98],"representation":[17,92,156],"of":[18,24,29,39,45,48,93,103,120,132,135,212,231],"map.":[20],"For":[21],"practical":[22],"consideration":[23],"both":[25],"safety":[26,196],"and":[27,110,157,172,188,204],"agility":[28],"the":[30,37,49,53,56,67,84,97,101,107,115,121,129,133,136,139,153,159,164,184,189,210,213,232],"in":[32,70,77],"narrow":[33],"corridors,":[34],"we":[35,87,224],"introduce":[36],"concept":[38],"allowable":[40,68],"speed":[41,69,192],"at":[42,106,114],"each":[43],"point":[44],"free":[46],"space":[47],"map":[50,95],"based":[51,193],"on":[52,194],"distance":[54],"to":[55,66,127],"closest":[57],"obstacle.":[58],"We":[59,208],"define":[60],"cost-to-go":[63,119],"function":[64],"corresponding":[65,111,160],"time-relevant":[72],"way":[73],"that":[74,99,230],"eventually":[75],"results":[76,218],"safe":[79,140,171],"time-minimized":[80,141],"path.":[81],"To":[82],"realize":[83],"main":[85],"idea,":[86],"built":[88],"hierarchical":[90],"graph":[91],"has":[100],"topology":[102],"undirected":[104],"multigraph":[105],"higher":[108,154],"level":[109,155],"metric":[112,122,161],"points":[113,123,162],"lower":[116,165],"level.":[117,166],"The":[118,198],"are":[124],"added":[125],"up":[126],"construct":[128],"weight":[130],"values":[131],"edges":[134],"graph.":[137],"Then,":[138],"can":[143,175],"be":[144,176],"efficiently":[145],"computed":[146],"by":[147],"obtaining":[148],"optimal":[149],"topological":[150],"from":[152,163],"identifying":[158],"Using":[167],"this":[168],"approach,":[169],"agile":[173],"found,":[177],"which":[178],"provides":[179],"good":[181],"trade-off":[182],"between":[183],"shortest":[185,234],"criterion":[187],"admissible":[190],"navigation":[191],"lateral":[195],"margins.":[197],"proposed":[199,214],"offers":[201],"enhanced":[202],"performance":[203,228],"less":[205],"computational":[206],"cost.":[207],"demonstrate":[209],"advantages":[211],"through":[216],"simulation":[217],"real":[221],"map,":[222],"where":[223],"also":[225],"compared":[226],"its":[227],"with":[229],"conventional":[233],"strategy.":[236]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}