{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:02:20Z","timestamp":1770278540038,"version":"3.49.0"},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001769","name":"Charles Sturt University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Intell. AI Games"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1109\/tciaig.2015.2421493","type":"journal-article","created":{"date-parts":[[2015,4,10]],"date-time":"2015-04-10T23:39:14Z","timestamp":1428709154000},"page":"268-277","source":"Crossref","is-referenced-by-count":19,"title":["Optimization Using Boundary LookupJump Point Search"],"prefix":"10.1109","volume":"8","author":[{"given":"Jason","family":"Traish","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Tulip","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wayne","family":"Moore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","author":"champandard","year":"2007","journal-title":"Top 10 Most Influential AI Games"},{"key":"ref3","first-page":"7","article-title":"Near optimal hierarchical path-finding","volume":"1","author":"botea","year":"2004","journal-title":"J Game Develop"},{"key":"ref10","author":"rahikkala","year":"0","journal-title":"Astar-jps"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v25i1.7994","article-title":"Online graph pruning for pathfinding on grid maps","author":"harabor","year":"2011","journal-title":"AAAI"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1609\/icaps.v23i1.13568","article-title":"Subgoal graphs for optimal pathfinding in eight-neighbor grids","author":"uras","year":"2013","journal-title":"ICAPS"},{"key":"ref5","article-title":"2D path planning based on Dijkstra's algorithm and pseudo priority queues","author":"guivant","year":"2012","journal-title":"SOCS"},{"key":"ref8","first-page":"1163","article-title":"Using swamps to improve optimal pathfinding","author":"pochter","year":"2009","journal-title":"Proc 8th Int Conf Autonom Agents Multiagent Syst -Volume 2"},{"key":"ref7","article-title":"The JPS pathfinding system","author":"harabor","year":"2012","journal-title":"SOCS"},{"key":"ref2","article-title":"Fast, optimal pathfinding with compressed path databases","author":"botea","year":"2012","journal-title":"SOCS"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1609\/socs.v1i1.18156","article-title":"Search space reduction using swamp hierarchies","author":"pochter","year":"2010","journal-title":"Proc 3rd Annu Symp Combinatorial Search"},{"key":"ref1","first-page":"122","article-title":"Ultra-fast optimal pathfinding without runtime search","author":"botea","year":"2011","journal-title":"Proc 7th Annu Int AIIDE Conf (AIIDE)"}],"container-title":["IEEE Transactions on Computational Intelligence and AI in Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4804728\/7565675\/07084116.pdf?arnumber=7084116","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T10:24:11Z","timestamp":1691576651000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7084116\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":11,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tciaig.2015.2421493","relation":{},"ISSN":["1943-068X","1943-0698"],"issn-type":[{"value":"1943-068X","type":"print"},{"value":"1943-0698","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9]]}}}