{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T16:05:03Z","timestamp":1784390703108,"version":"3.55.0"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Wallenberg AI, Autonomous Systems and Software Program"},{"DOI":"10.13039\/501100004063","name":"Knut och Alice Wallenbergs Stiftelse","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004063","id-type":"DOI","asserted-by":"publisher"}]},{"name":"SSF Project FACT"},{"name":"VR Grant XPLORE3D"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1109\/lra.2022.3142923","type":"journal-article","created":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T20:30:04Z","timestamp":1642105804000},"page":"2487-2494","source":"Crossref","is-referenced-by-count":68,"title":["UFOExplorer: Fast and Scalable Sampling-Based Exploration With a Graph-Based Planning Structure"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4815-9689","authenticated-orcid":false,"given":"Daniel","family":"Duberg","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1170-7162","authenticated-orcid":false,"given":"Patric","family":"Jensfelt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487281"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2969191"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2897343"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2926669"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2017.8206030"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9196964"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3051563"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989737"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/AERO.2018.8396632"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139494"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CIRA.1997.613851"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1985.1087372"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989531"},{"key":"ref15","article-title":"Rapidly-exploring random trees: A new tool for path planning","author":"LaValle","year":"1998"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8594502"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9196707"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2822013.2822036"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2655144"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.3013861"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ECMR50962.2021.9568793"},{"key":"ref23","first-page":"322","volume-title":"Proc. ACM SIGMOD Int. Conf. Manage. Data","author":"Beckmann","year":"1990"},{"key":"ref24","article-title":"Implementation of the pure pursuit path tracking algorithm","volume-title":"Robot. Inst.","author":"Coulter","year":"1992"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICARCV.2018.8581381"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26054-9_23"},{"issue":"34","key":"ref28","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"Ester","year":"1996","journal-title":"KDD"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9647862\/09681328.pdf?arnumber=9681328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T22:50:43Z","timestamp":1705186243000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9681328\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":28,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2022.3142923","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4]]}}}