{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:22:16Z","timestamp":1740169336968,"version":"3.37.3"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100004358","name":"Samsung Electronics Company Ltd.","doi-asserted-by":"publisher","award":["IO201209-07873-01"],"award-info":[{"award-number":["IO201209-07873-01"]}],"id":[{"id":"10.13039\/100004358","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3293125","type":"journal-article","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T18:38:15Z","timestamp":1688755095000},"page":"74263-74276","source":"Crossref","is-referenced-by-count":1,"title":["Grid Graph Reduction for Efficient Shortest Pathfinding"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-4528-4999","authenticated-orcid":false,"given":"Chan-Young","family":"Kim","sequence":"first","affiliation":[{"name":"School of Electrical Engineering, Korea University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1664-2062","authenticated-orcid":false,"given":"Sanghoon","family":"Sull","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, Korea University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3070054"},{"key":"ref12","first-page":"125","article-title":"A*-based pathfinding in modern computer games","volume":"11","author":"cui","year":"2011","journal-title":"Int J Comput Sci Netw Sec"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/769\/1\/012021"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.1056"},{"key":"ref11","first-page":"624","article-title":"Reduction-based solving of multi-agent pathfinding on large maps using graph pruning","author":"hus\u00e1r","year":"2022","journal-title":"Proc 21st Int Conf Auton Agents Multiagent Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2021.11.007"},{"key":"ref2","first-page":"8026","article-title":"PyTorch: An imperative style, high-performance deep learning library","volume":"33","author":"paszke","year":"2019","journal-title":"Proc NeurIPS"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9367"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICIEA49774.2020.9102061"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITNG.2010.53"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICWT.2017.8284160"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2808407"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3544585"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v25i1.7829"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.apor.2021.102995"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1177\/1729881420962263"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0263841"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.01.054"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.5772\/51942"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1515\/cait-2015-0036"},{"key":"ref4","first-page":"683","article-title":"Canonical orderings on grids","author":"sturtevant","year":"2016","journal-title":"Proc IJCAI"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi10110785"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v25i1.7994"},{"key":"ref5","first-page":"207","article-title":"The JPS pathfinding system","author":"harabor","year":"2012","journal-title":"Proc Int Symp Combinat Search"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10175869.pdf?arnumber=10175869","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T18:02:35Z","timestamp":1692036155000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10175869\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3293125","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2023]]}}}