{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T21:55:49Z","timestamp":1725400549760},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1109\/iros.2009.5354804","type":"proceedings-article","created":{"date-parts":[[2009,12,18]],"date-time":"2009-12-18T18:17:52Z","timestamp":1261160272000},"page":"4893-4898","source":"Crossref","is-referenced-by-count":0,"title":["FAHR: Focused A* Heuristic Recomputation"],"prefix":"10.1109","author":[{"given":"Matthew","family":"McNaughton","sequence":"first","affiliation":[]},{"given":"Chris","family":"Urmson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1994.351061"},{"key":"14","article-title":"Space-efficient memory-based heuristics","author":"zhou","year":"2004","journal-title":"National Conf Artificial Intelligence (AAAI-04)"},{"key":"11","article-title":"Memory-efficient a* heuristics for multiple sequence alignment","author":"mcnaughton","year":"2002","journal-title":"Eighteenth national conference on Artificial intelligence"},{"journal-title":"Principles of Artificial Intelligence","year":"1980","author":"nilsson","key":"12"},{"key":"3","article-title":"Practical search techniques in path planning for autonomous driving","author":"dolgov","year":"2008","journal-title":"Proceedings of the First International Symposium on Search Techniques in Artificial Intelligence and Robotics (STAIR-08)"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61291-2_68"},{"key":"10","first-page":"700","article-title":"Finding optimal solutions to rubik's cube using pattern databases","author":"korf","year":"1997","journal-title":"AAAI-97"},{"key":"7","first-page":"530","article-title":"Hierarchical a*: Searching abstraction hierarchies efficiently","author":"holte","year":"1996","journal-title":"AAAI"},{"key":"6","first-page":"121","author":"holte","year":"2005","journal-title":"Abstraction Reformulation and Approximation volume 3607 of Lecture Notes in Computer Science"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2008.4651120"},{"article-title":"Distance transforms of sampled functions","year":"2004","author":"felzenszwalb","key":"4"},{"key":"9","first-page":"476","article-title":"D* lite","author":"koenig","year":"2002","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00109-6"}],"event":{"name":"2009 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS 2009)","start":{"date-parts":[[2009,10,10]]},"location":"St. Louis, MO, USA","end":{"date-parts":[[2009,10,15]]}},"container-title":["2009 IEEE\/RSJ International Conference on Intelligent Robots and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5342790\/5353884\/05354804.pdf?arnumber=5354804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T19:38:03Z","timestamp":1489865883000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5354804\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/iros.2009.5354804","relation":{},"subject":[],"published":{"date-parts":[[2009,10]]}}}