{"id":"https://openalex.org/W3183153856","doi":"https://doi.org/10.1109/access.2021.3094854","title":"A Fast Bi-Directional A* Algorithm Based on Quad-Tree Decomposition and Hierarchical Map","display_name":"A Fast Bi-Directional A* Algorithm Based on Quad-Tree Decomposition and Hierarchical Map","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3183153856","doi":"https://doi.org/10.1109/access.2021.3094854","mag":"3183153856"},"language":"en","primary_location":{"id":"doi:10.1109/access.2021.3094854","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2021.3094854","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2021.3094854","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101821483","display_name":"Yijun Zhou","orcid":"https://orcid.org/0000-0002-3838-7779"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhou Yijun","raw_affiliation_strings":["School of Mechanical Engineering, Southeast University, Nanjing, China"],"raw_orcid":"https://orcid.org/0000-0002-3838-7779","affiliations":[{"raw_affiliation_string":"School of Mechanical Engineering, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090240521","display_name":"Xi Jiadong","orcid":"https://orcid.org/0000-0002-8023-0169"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xi Jiadong","raw_affiliation_strings":["School of Mechanical Engineering, Southeast University, Nanjing, China"],"raw_orcid":"https://orcid.org/0000-0002-8023-0169","affiliations":[{"raw_affiliation_string":"School of Mechanical Engineering, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058483710","display_name":"Chen Luo","orcid":"https://orcid.org/0000-0003-4339-0355"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Luo Chen","raw_affiliation_strings":["School of Mechanical Engineering, Southeast University, Nanjing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mechanical Engineering, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I76569877"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":1.2248,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.81427552,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"9","issue":null,"first_page":"102877","last_page":"102885"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"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":0.9995999932289124,"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/T11106","display_name":"Data Management and Algorithms","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9872000217437744,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/precomputation","display_name":"Precomputation","score":0.7830905914306641},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6945086717605591},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6747725009918213},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5030283331871033},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.4956923723220825},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4796364903450012},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.47293853759765625},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4699456989765167},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4536612927913666},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45172494649887085},{"id":"https://openalex.org/keywords/quadtree","display_name":"Quadtree","score":0.4381408989429474},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.4377439320087433},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.42757177352905273},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41719913482666016},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.39874958992004395},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32248538732528687},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28312206268310547},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.1595466434955597}],"concepts":[{"id":"https://openalex.org/C159379195","wikidata":"https://www.wikidata.org/wiki/Q7239568","display_name":"Precomputation","level":3,"score":0.7830905914306641},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6945086717605591},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6747725009918213},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5030283331871033},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.4956923723220825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4796364903450012},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.47293853759765625},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4699456989765167},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4536612927913666},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45172494649887085},{"id":"https://openalex.org/C151416825","wikidata":"https://www.wikidata.org/wiki/Q934791","display_name":"Quadtree","level":2,"score":0.4381408989429474},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.4377439320087433},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.42757177352905273},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41719913482666016},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.39874958992004395},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32248538732528687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28312206268310547},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.1595466434955597},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2021.3094854","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2021.3094854","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:31205b1607ac4cc8b6a71f529569a979","is_oa":true,"landing_page_url":"https://doaj.org/article/31205b1607ac4cc8b6a71f529569a979","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 9, Pp 102877-102885 (2021)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2021.3094854","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2021.3094854","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7400000095367432,"display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G3219196085","display_name":null,"funder_award_id":"GDZB-002","funder_id":"https://openalex.org/F4320326182","funder_display_name":"Six Talent Peaks Project in Jiangsu Province"}],"funders":[{"id":"https://openalex.org/F4320326182","display_name":"Six Talent Peaks Project in Jiangsu Province","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W135651235","https://openalex.org/W147738233","https://openalex.org/W196854640","https://openalex.org/W1524979267","https://openalex.org/W1585104299","https://openalex.org/W1772276748","https://openalex.org/W1969483458","https://openalex.org/W1975423918","https://openalex.org/W2019738489","https://openalex.org/W2023624803","https://openalex.org/W2082431709","https://openalex.org/W2103776069","https://openalex.org/W2113276858","https://openalex.org/W2131237536","https://openalex.org/W2152545366","https://openalex.org/W2154356512","https://openalex.org/W2165036656","https://openalex.org/W2166375899","https://openalex.org/W2166542580","https://openalex.org/W2169528473","https://openalex.org/W2240526870","https://openalex.org/W2296620075","https://openalex.org/W2312464733","https://openalex.org/W2943186426","https://openalex.org/W2980995577","https://openalex.org/W3022683862","https://openalex.org/W3087406311","https://openalex.org/W3111588371","https://openalex.org/W6605583594","https://openalex.org/W6606034858","https://openalex.org/W6607999367","https://openalex.org/W6631507701","https://openalex.org/W6637787829","https://openalex.org/W6642555851","https://openalex.org/W6697164153","https://openalex.org/W6729319880","https://openalex.org/W6776694869"],"related_works":["https://openalex.org/W2100138895","https://openalex.org/W2011542752","https://openalex.org/W2573887882","https://openalex.org/W1494662170","https://openalex.org/W1814031283","https://openalex.org/W2037710955","https://openalex.org/W3098335909","https://openalex.org/W2684574069","https://openalex.org/W1755177257","https://openalex.org/W3183153856"],"abstract_inverted_index":{"Although":[0],"the":[1,16,19,26,37,90,104,119,137,141,155,167,172],"popular":[2],"path-planning":[3,156],"algorithms":[4,35],"based":[5,34,53],"on":[6,45,54],"graph-search":[7,33],"such":[8],"as":[9],"Dijkstra":[10],"and":[11,73,84,131,159],"A*":[12],"guarantee":[13],"to":[14,101,135,148,153],"find":[15,166],"optimal":[17],"path,":[18],"search":[20,173],"time":[21,43],"will":[22],"increase":[23],"rapidly":[24],"with":[25,62],"growth":[27],"of":[28,39,68,79,86,113,121,126,183,190],"map":[29,82,91,106,128,150],"size.":[30],"Those":[31],"traditional":[32],"ignore":[36],"distribution":[38],"obstacles,":[40],"causing":[41],"much":[42],"wasted":[44],"exploring":[46],"unrelated":[47],"regions.":[48,109],"A":[49],"fast":[50],"bidirectional-A*":[51,146],"algorithm":[52],"hierarchical":[55,87,122,127,138,149],"map(QH-A*)":[56],"was":[57,99,129,133,151,178],"proposed":[58,152],"in":[59],"this":[60],"paper":[61],"high":[63,187],"real-time":[64,188],"performance.":[65],"QH-A*":[66,80,163,177],"consists":[67],"two":[69],"parts:":[70],"offline":[71,77],"pre-processing":[72,78],"online":[74],"search.":[75],"The":[76],"comprises":[81],"decomposition":[83,92,97],"construction":[85,120],"map.":[88,139],"In":[89,140,170],"step,":[93,143],"a":[94,124,144],"modified":[95],"quad-tree":[96],"method":[98],"used":[100],"recursively":[102],"divide":[103],"initial":[105],"into":[107],"different":[108],"Then":[110],"boundary":[111],"nodes":[112],"each":[114],"region":[115],"were":[116],"extracted.":[117],"During":[118],"map,":[123],"kind":[125],"defined":[130],"precomputation":[132],"done":[134],"construct":[136],"online-search":[142],"revised":[145],"specific":[147],"finish":[154],"task.":[157],"Experiments":[158],"theories":[160],"proved":[161],"that":[162,182],"can":[164],"always":[165],"shortest":[168],"path.":[169],"addition,":[171],"area":[174],"required":[175],"by":[176],"70%-80%":[179],"less":[180],"than":[181],"A*,":[184],"which":[185],"verified":[186],"performance":[189],"QH-A*.":[191]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"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"}