{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T22:38:44Z","timestamp":1773268724570,"version":"3.50.1"},"reference-count":39,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"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":[],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1109\/icra40945.2020.9197338","type":"proceedings-article","created":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T21:25:46Z","timestamp":1600205146000},"page":"3191-3198","source":"Crossref","is-referenced-by-count":93,"title":["Adaptively Informed Trees (AIT*): Fast Asymptotically Optimal Path Planning through Adaptive Heuristics"],"prefix":"10.1109","author":[{"given":"Marlin P.","family":"Strub","sequence":"first","affiliation":[{"name":"University of Oxford,Estimation, Search, and Planning (ESP) Group of the Oxford Robotics Institute (ORI),United Kingdom"}]},{"given":"Jonathan D.","family":"Gammell","sequence":"additional","affiliation":[{"name":"University of Oxford,Estimation, Search, and Planning (ESP) Group of the Oxford Robotics Institute (ORI),United Kingdom"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9196580"},{"key":"ref38","article-title":"Better parameter-free anytime search by minimizing time between solutions","author":"thayer","year":"2012","journal-title":"Proceedings of the Annual Symposium on Combinatorial Search (SOCS)"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.01.009"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1177\/0278364917714338"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915577958"},{"key":"ref30","article-title":"Informed anytime search for continuous planning problems","author":"gammell","year":"2017","journal-title":"Ph D Dissertation"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6630906"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.11.009"},{"key":"ref34","article-title":"A generalized framework for lifelong planning a* search","author":"likhachev","year":"2005","journal-title":"Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS)"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1609\/icaps.v21i1.13474","article-title":"Learning inadmissible heuristics during search","author":"thayer","year":"2011","journal-title":"Twenty-First International Conference on Automated Planning and Scheduling"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1082473.1082748"},{"key":"ref12","article-title":"A new principle for incremental heuristic search: Theoretical results","author":"koenig","year":"2006","journal-title":"Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1613\/jair.460"},{"key":"ref14","article-title":"Robust bidirectional search via heuristic improvement","author":"wilt","year":"2013","journal-title":"Proceedings the Association for the Advancement of Artificial Intelligence Conference International Conference (AAAI)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2830331"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2019.2922166"},{"key":"ref28","doi-asserted-by":"crossref","DOI":"10.1609\/icaps.v28i1.13931","article-title":"Lazy receding horizon A* for efficient path planning in graphs with expensive-to-evaluate edges","author":"mandalika","year":"2018","journal-title":"Proceedings of the AAAI International Conference on Automated Planning and Scheduling (ICAPS)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1111\/0824-7935.00065"},{"key":"ref27","doi-asserted-by":"crossref","DOI":"10.1609\/icaps.v26i1.13788","article-title":"A unifying formalism for shortest path problems with expensive edge evaluations via lazy best-first search over paths with edge selectors","author":"dellin","year":"2016","journal-title":"Proceedings of the AAAI International Conference on Automated Planning and Scheduling (ICAPS)"},{"key":"ref3","first-page":"700","article-title":"Finding optimal solutions to Rubik’s cube using pattern databases","author":"korf","year":"1997","journal-title":"Proceedings of the AAAI National Conference on Artificial Intelligence"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2651157"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1613\/jair.1480","article-title":"Additive pattern database heuristics","volume":"22","author":"felner","year":"2004","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"ref8","article-title":"Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning","author":"kleinbort","year":"2016","journal-title":"Proceedings of the International Workshop on the Algorithmic Foundations of Robotics (WAFR)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/rob.21407"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-019-09830-x"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139620"},{"key":"ref21","author":"bellman","year":"1957","journal-title":"Dynamic Programming"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1177\/0278364919890396"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/URAI.2018.8442203"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139603"}],"event":{"name":"2020 IEEE International Conference on Robotics and Automation (ICRA)","location":"Paris, France","start":{"date-parts":[[2020,5,31]]},"end":{"date-parts":[[2020,8,31]]}},"container-title":["2020 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9187508\/9196508\/09197338.pdf?arnumber=9197338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T20:03:01Z","timestamp":1674504181000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9197338\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/icra40945.2020.9197338","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}