{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T18:15:27Z","timestamp":1775326527882,"version":"3.50.1"},"reference-count":28,"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.9196580","type":"proceedings-article","created":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T21:25:46Z","timestamp":1600205146000},"page":"130-136","source":"Crossref","is-referenced-by-count":73,"title":["Advanced BIT* (ABIT*): Sampling-Based Planning with Advanced Graph-Search Techniques"],"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":"ref10","author":"bellman","year":"1957","journal-title":"Dynamic Programming"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1997.619371"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2830331"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.5772\/56718"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6630906"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197338"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/MRA.2012.2205651","article-title":"The Open Motion Planning Library","volume":"19","author":"sucan","year":"2012","journal-title":"IEEE Robotics & Automation Magazine"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1177\/0278364919890396"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139620"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/rob.21407"},{"key":"ref7","first-page":"767","article-title":"ARA*: Anytime A* with provable bounds on sub-optimality","author":"likhachev","year":"2004","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1975.1100984"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139773"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2013.2248309"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915577958"},{"key":"ref24","article-title":"Informed anytime search for continuous planning problems","author":"gammell","year":"2017","journal-title":"Ph D Dissertation"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ROBIO.2017.8324695"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.01.009"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1177\/0278364917714338"}],"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\/09196580.pdf?arnumber=9196580","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T20:03:00Z","timestamp":1674504180000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9196580\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/icra40945.2020.9196580","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}