{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:47:15Z","timestamp":1761396435886},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T00:00:00Z","timestamp":1666483200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T00:00:00Z","timestamp":1666483200000},"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":[[2022,10,23]]},"DOI":"10.1109\/iros47612.2022.9981136","type":"proceedings-article","created":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T14:38:15Z","timestamp":1672065495000},"page":"5707-5714","source":"Crossref","is-referenced-by-count":3,"title":["Disk-Graph Probabilistic Roadmap: Biased Distance Sampling for Path Planning in a Partially Unknown Environment"],"prefix":"10.1109","volume":"14","author":[{"given":"T.","family":"No\u00ebl","sequence":"first","affiliation":[{"name":"Inria, Univ Rennes, CNRS, IRISA,Rennes,France"}]},{"given":"S.","family":"Kabbour","sequence":"additional","affiliation":[{"name":"Créative Ingénierie,Rennes,France"}]},{"given":"A.","family":"Lehuger","sequence":"additional","affiliation":[{"name":"Créative Ingénierie,Rennes,France"}]},{"given":"E.","family":"Marchand","sequence":"additional","affiliation":[{"name":"Univ Rennes, Inria, CNRS, IRISA,Rennes,France"}]},{"given":"F.","family":"Chaumette","sequence":"additional","affiliation":[{"name":"Inria, Univ Rennes, CNRS, IRISA,Rennes,France"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/ROBOT.2000.844730"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/SSRR.2011.6106777"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1177\/0278364911421039"},{"year":"1998","author":"lavalle","journal-title":"Rapidly-Exploring Random Trees A New Tool for Path Planning","key":"ref14"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/70.508439"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1177\/0278364911406761"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1007\/BF01386390"},{"key":"ref1","first-page":"121","author":"de wit","year":"1994","journal-title":"Nonlinear Control Design for Mobile Robots"},{"key":"ref17","article-title":"Real-time modification of collision-free paths","author":"quinlan","year":"1994","journal-title":"PhD Thesis Stanford University June"},{"key":"ref16","article-title":"Signed distance fields: A natural representation for both mapping and planning","author":"oleynikova","year":"2016","journal-title":"Workshop on Geometry and Beyond RSS'2016"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1177\/0278364916684382"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/ROBOT.1993.291936"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1163\/156855300741960","article-title":"Visibility-based probabilistic roadmaps for motion planning. journal of advanced robotics","volume":"14","author":"thierry","year":"2000","journal-title":"Advanced Robotics"},{"key":"ref23","article-title":"Sparsification of motion-planning roadmaps by edge contraction","volume":"33","author":"shaharabani","year":"2012","journal-title":"The International Journal of Robotics Research"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/CIRA.1997.613851"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1007\/978-3-642-01097-2"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/LRA.2021.3068886"},{"key":"ref22","first-page":"458","article-title":"Bayesian hilbert maps for dynamic continuous occupancy mapping","author":"senanayake","year":"0","journal-title":"1st Annual Conference on Robot Learning (CoRL)"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/ICRA40945.2020.9196882"},{"key":"ref8","first-page":"141","article-title":"On finding narrow passages with probabilistic roadmap planners","author":"hsu","year":"0","journal-title":"Workshop on Algorithmic Foundations of Robotics WAFR'96"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/ICRA40945.2020.9196592"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1177\/0278364915577958"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1007\/978-3-030-28619-4_59"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1177\/0278364913498292"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/IROS.2014.6942976"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/ICRA.2015.7139620"}],"event":{"name":"2022 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","start":{"date-parts":[[2022,10,23]]},"location":"Kyoto, Japan","end":{"date-parts":[[2022,10,27]]}},"container-title":["2022 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9981026\/9981028\/09981136.pdf?arnumber=9981136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T18:29:50Z","timestamp":1701368990000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9981136\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,23]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/iros47612.2022.9981136","relation":{},"subject":[],"published":{"date-parts":[[2022,10,23]]}}}