{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T09:20:36Z","timestamp":1759483236852,"version":"3.37.3"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"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":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1109\/lra.2022.3191944","type":"journal-article","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T20:25:51Z","timestamp":1658175951000},"page":"10160-10167","source":"Crossref","is-referenced-by-count":4,"title":["Path-Tree Optimization in Discrete Partially Observable Environments Using Rapidly-Exploring Belief-Space Graphs"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3242-8090","authenticated-orcid":false,"given":"Camille","family":"Phiquepal","sequence":"first","affiliation":[{"name":"Machine Learning and Robotics Lab, University of Stuttgart, München, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1478-1405","authenticated-orcid":false,"given":"Andreas","family":"Orthey","sequence":"additional","affiliation":[{"name":"Learning and Intelligent Systems Lab, TU Berlin, Berlin, Germany"}]},{"given":"Nicolas","family":"Viennot","sequence":"additional","affiliation":[{"name":"Software Systems Laboratory, Columbia University, New York, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5487-6767","authenticated-orcid":false,"given":"Marc","family":"Toussaint","sequence":"additional","affiliation":[{"name":"Learning and Intelligent Systems Lab, TU Berlin, Berlin, Germany"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8793260"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561664"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IROS45743.2020.9341384"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-017-9626-0"},{"article-title":"Rapidly-exploring random trees: A new tool for path planning","year":"1998","author":"LaValle","key":"ref5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1177\/0278364914533443"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.2514\/6.2010-3360"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/rob.21993"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14743-2_25"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913501564"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/0278364919846340"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9811560"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8594365"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43089-4_34"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-66723-8_28"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2012.2205651"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9196553"},{"key":"ref19","first-page":"599","article-title":"Dijkstras algorithm revisited: The dynamic programming connexion","volume":"35","author":"Sniedovich","year":"2006","journal-title":"Control Cybern."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1177\/0278364907079280"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2692956.2663188"},{"issue":"1","key":"ref23","first-page":"3","article-title":"Reducing the barrier to entry of complex robotic software: A moveit! case study","volume-title":"J. Softw. Eng. Robot.","volume":"5","author":"Coleman","year":"2014"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2016.01.005"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9831196\/09832748.pdf?arnumber=9832748","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T06:51:54Z","timestamp":1706770314000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9832748\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":24,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lra.2022.3191944","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"type":"electronic","value":"2377-3766"},{"type":"electronic","value":"2377-3774"}],"subject":[],"published":{"date-parts":[[2022,10]]}}}