{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T05:50:41Z","timestamp":1780638641221,"version":"3.54.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100010014","name":"Six Talent Peaks Project in Jiangsu Province","doi-asserted-by":"publisher","award":["GDZB-002"],"award-info":[{"award-number":["GDZB-002"]}],"id":[{"id":"10.13039\/501100010014","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3094854","type":"journal-article","created":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T19:49:23Z","timestamp":1625514563000},"page":"102877-102885","source":"Crossref","is-referenced-by-count":17,"title":["A Fast Bi-Directional A* Algorithm Based on Quad-Tree Decomposition and Hierarchical Map"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3838-7779","authenticated-orcid":false,"given":"Zhou","family":"Yijun","sequence":"first","affiliation":[{"name":"School of Mechanical Engineering, Southeast University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8023-0169","authenticated-orcid":false,"given":"Xi","family":"Jiadong","sequence":"additional","affiliation":[{"name":"School of Mechanical Engineering, Southeast University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luo","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Mechanical Engineering, Southeast University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1","article-title":"Memory-efficient abstractions for pathfinding","author":"sturtevant","year":"2007","journal-title":"Proc 3rd Artif Intell Interact Digit Entertainment Conf"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/69.687976"},{"key":"ref12","article-title":"Valentin Avram road traffic optimization by using an intelligent vehicle-highway system (IVHS)","year":"2003","journal-title":"Proc 14th Int Conf Control Syst Comput Sci (CSCS)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033772"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45643-0_4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1064546.1180616"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24838-5_20"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1412228.1412239"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1998.677046"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/43.21842"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.3233\/ICA-200645"},{"key":"ref4","first-page":"1539","article-title":"Incremental A*","volume":"57","author":"koenig","year":"2001","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa775"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-48113-3_22"},{"key":"ref6","first-page":"1114","article-title":"Online graph pruning for pathfinding on grid maps","author":"harabor","year":"2011","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2015.2460732"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/322003.322004"},{"key":"ref8","article-title":"Abstraction-based heuristics with true distance computations","author":"felner","year":"2009","journal-title":"Dblp"},{"key":"ref7","first-page":"156","article-title":"Search space reduction using swamp hierarchies","author":"pochter","year":"2010","journal-title":"Proc 3rd Annu Symp Combinat Search (SOCS)"},{"key":"ref2","first-page":"28","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"hart","year":"1972","journal-title":"IEEE Trans Syst Sci Cybern"},{"key":"ref9","first-page":"609","article-title":"Memory-based heuristics for explicit state spaces","author":"sturtevant","year":"2009","journal-title":"Proc IJCAI 21st Int Joint Conf Artif Intell"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref20","first-page":"1","article-title":"Path planning: A 2013 survey","author":"souissi","year":"2013","journal-title":"Proc Int Conf Ind Eng Syst Manage (IESM)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2015.125"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(95)00111-5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2013.09.004"},{"key":"ref23","first-page":"7","article-title":"Near optimal hierarchical path-finding","volume":"1","author":"botea","year":"2004","journal-title":"J Game Develop"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2914200"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"1166","DOI":"10.1109\/TAC.2012.2191836","article-title":"A beamlet-based graph structure for path planning using multiscale information","volume":"57","author":"lu","year":"2012","journal-title":"IEEE Trans Autom Control"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09475032.pdf?arnumber=9475032","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:09:33Z","timestamp":1662667773000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9475032\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3094854","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}