{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T13:19:28Z","timestamp":1762607968581,"version":"3.37.3"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Games"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1109\/tg.2020.3012602","type":"journal-article","created":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T22:27:48Z","timestamp":1595975268000},"page":"23-35","source":"Crossref","is-referenced-by-count":5,"title":["Static Rectangle Expansion A<sup>*<\/sup>Algorithm for Pathfinding"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8143-3972","authenticated-orcid":false,"given":"Li","family":"Chong","sequence":"first","affiliation":[{"name":"28th Research Institute of China Electronics Technology Group Corporation, Nanjing, China"}]},{"given":"Li","family":"Jian","sequence":"additional","affiliation":[{"name":"28th Research Institute of China Electronics Technology Group Corporation, Nanjing, China"}]},{"given":"Liu","family":"XueQuan","sequence":"additional","affiliation":[{"name":"28th Research Institute of China Electronics Technology Group Corporation, Nanjing, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/736138"},{"article-title":"Incremental search-based path planning for moving target search","year":"2013","author":"Sun","key":"ref2"},{"issue":"2","key":"ref3","first-page":"99","article-title":"Incremental heuristic search in artificial intelligence","volume":"25","author":"Koenig","year":"2004","journal-title":"Artif. Intell. Mag."},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2004.838026"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cja.2016.04.023"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2014.2340020"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41968-3_55"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.01.009"},{"key":"ref10","first-page":"1311","article-title":"Adaptive A","volume-title":"Proc. 4th Int. Joint Conf. Auton. Agents Multiagent Syst.","author":"Koenig"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-014-9266-0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2994"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v25i1.13724"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v6i1.18382"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v23i1.13568"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v23i1.13609"},{"key":"ref17","article-title":"Fast pathfinding via symmetry breaking","volume-title":"Aigamedev Com.","author":"Harabor","year":"2015"},{"key":"ref18","first-page":"683","article-title":"Canonical orderings on grids","volume-title":"Proc. 25th Int. Joint Conf. Artif. Intell.","author":"Sturtevant"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v35i3.2547"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2197681"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v6i1.18364"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10076"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v25i1.7813"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v25i1.7994"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v3i1.18254"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v24i1.13633"},{"key":"ref27","first-page":"241","article-title":"2D path planning based on Dijkstras algorithm and pseudo priority queues","volume-title":"Proc. 5th Int. Symp. Combinatorial Search","author":"Jose"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v3i1.18251"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v23i1.13600"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v5i1.18311"}],"container-title":["IEEE Transactions on Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7782673\/9736931\/09151356.pdf?arnumber=9151356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T22:50:35Z","timestamp":1704840635000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9151356\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3]]},"references-count":30,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tg.2020.3012602","relation":{},"ISSN":["2475-1502","2475-1510"],"issn-type":[{"type":"print","value":"2475-1502"},{"type":"electronic","value":"2475-1510"}],"subject":[],"published":{"date-parts":[[2022,3]]}}}