{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:04:10Z","timestamp":1725797050933},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/innovations.2018.8606025","type":"proceedings-article","created":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T23:21:01Z","timestamp":1547162461000},"page":"81-87","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Area Search with Shared Memory: A Meta-Framework to Improve Pathfinding Algorithms"],"prefix":"10.1109","author":[{"given":"Obada Al","family":"Zoubi","sequence":"first","affiliation":[]},{"given":"Mariette","family":"Awad","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2172\/4785039"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/322003.322004"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90040-X"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(95)00017-9"},{"key":"ref14","article-title":"Single-frontier bidirectional search","author":"felner","year":"2010","journal-title":"AAAI"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"ref16","first-page":"24","article-title":"Recent results in analyzing the performance of heuristic search","author":"breyer","year":"2008","journal-title":"Proceedings of the First International Workshop on Search in Artificial Intelligence and Robotics (held in conjunction with AAAI)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(89)90010-6"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1982.4767270"},{"key":"ref19","article-title":"Optimal graph search with iterated graph cuts","author":"burkett","year":"2011","journal-title":"AAAI"},{"key":"ref4","first-page":"203","article-title":"Memory-bounded A* graph search","author":"zhou","year":"2002","journal-title":"FLAIRS Conference"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(93)90045-D"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1207\/s15326985ep2101&2_6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(70)90007-X"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/11527862_9"},{"key":"ref7","article-title":"Searching without a heuristic Efficient use of abstraction","author":"larsen","year":"2010","journal-title":"AAAI"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.12.003"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1613\/jair.460"},{"journal-title":"Priority Queueing","year":"2016","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2015.2421493"},{"journal-title":"Grid-based Bechmarks","year":"2016","author":"ai","key":"ref23"}],"event":{"name":"2018 International Conference on Innovations in Information Technology (IIT)","start":{"date-parts":[[2018,11,18]]},"location":"Al Ain","end":{"date-parts":[[2018,11,19]]}},"container-title":["2018 International Conference on Innovations in Information Technology (IIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8593336\/8605941\/08606025.pdf?arnumber=8606025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T22:10:00Z","timestamp":1643148600000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8606025\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/innovations.2018.8606025","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}