{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T06:06:18Z","timestamp":1759385178033,"version":"3.37.3"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["IIS-1750489"],"award-info":[{"award-number":["IIS-1750489"]}]},{"DOI":"10.13039\/100015599","name":"Toyota Research Institute","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100015599","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1109\/lra.2020.2972820","type":"journal-article","created":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T02:00:05Z","timestamp":1581386405000},"page":"2873-2880","source":"Crossref","is-referenced-by-count":5,"title":["Fast Planning Over Roadmaps via Selective Densification"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9765-0258","authenticated-orcid":false,"given":"Brad","family":"Saund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9712-109X","authenticated-orcid":false,"given":"Dmitry","family":"Berenson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","article-title":"A generalized framework for lifelong planning A* search","author":"likhachev","year":"0","journal-title":"Proc Int Conf Autom Planning Scheduling"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6943148"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4047"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/855"},{"key":"ref11","article-title":"Lazy receding horizon A* for efficient path planning in graphs with expensive-to-evaluate edges","author":"mandalika","year":"0","journal-title":"Proc Int Conf Autom Planning Scheduling"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913498292"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/0278364909340445"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.3182\/20130626-3-AU-2035.00018"},{"key":"ref16","article-title":"Path planning with adaptive dimensionality","author":"gochev","year":"0","journal-title":"Fourth Annual Symposium on Combinatorial Search"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980550"},{"key":"ref18","article-title":"Incremental planning with adaptive dimensionality","author":"gochev","year":"0","journal-title":"Proc Int Conf Autom Planning Scheduling"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989435"},{"key":"ref28","article-title":"ANA*: Anytime nonparametric A*","author":"berg","year":"0","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref4","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":"0","journal-title":"Proc 26th Int Conf Autom Planning Scheduling (ICAPS 2016)"},{"key":"ref27","article-title":"ARA *: Anytime A* with provable bounds on optimality","author":"likhachev","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139620"},{"key":"ref29","article-title":"When does weighted A* fail?","author":"wilt","year":"0","journal-title":"Proc 5th Int Symp Combinatorial Search"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/AIM.2017.8014187"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942793"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7353652"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1177\/0278364917714338"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989435"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(70)90007-X"},{"article-title":"Completing manipulation tasks efficiently in complex environments","year":"2016","author":"dellin","key":"ref23"},{"key":"ref26","article-title":"Faster than weighted A*: An optimistic approach to bounded suboptimal search","author":"thayer","year":"0","journal-title":"Proc Int Conf Autom Planning Scheduling"},{"article-title":"ARA*: Formal analysis","year":"2003","author":"likhachev","key":"ref25"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/7083369\/8932682\/8988161-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/8932682\/08988161.pdf?arnumber=8988161","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:32:49Z","timestamp":1651080769000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8988161\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":33,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2020.2972820","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"type":"electronic","value":"2377-3766"},{"type":"electronic","value":"2377-3774"}],"subject":[],"published":{"date-parts":[[2020,4]]}}}