{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T20:01:39Z","timestamp":1770494499971,"version":"3.49.0"},"reference-count":40,"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"}],"funder":[{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"crossref","award":["PA 3179\/1-1"],"award-info":[{"award-number":["PA 3179\/1-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Emmy Noether Programme","award":["448644653"],"award-info":[{"award-number":["448644653"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1109\/lra.2022.3199674","type":"journal-article","created":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T21:08:34Z","timestamp":1661807314000},"page":"11213-11220","source":"Crossref","is-referenced-by-count":40,"title":["Monte-Carlo Robot Path Planning"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7422-139X","authenticated-orcid":false,"given":"Tuan","family":"Dam","sequence":"first","affiliation":[{"name":"Department of Computer Science, Technische Universität, Darmstadt, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5055-199X","authenticated-orcid":false,"given":"Georgia","family":"Chalvatzaki","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Technische Universität, Darmstadt, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5266-8091","authenticated-orcid":false,"given":"Jan","family":"Peters","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Technische Universität, Darmstadt, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4469-8191","authenticated-orcid":false,"given":"Joni","family":"Pajarinen","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Technische Universität, Darmstadt, Germany"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Rapidly-exploring random trees: A new tool for path planning","author":"LaValle","year":"1998"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2016.2555853"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1177\/02783649922067753"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1177\/027836498600500305"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1985.6313351"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2010.5653275"},{"key":"ref7","first-page":"533","article-title":"Planning paths of complete coverage of an unstructured environment by a mobile robot","volume-title":"Proc. Int. Conf. Adv. Robot.","volume":"13","author":"Zelinsky","year":"1993"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/21.148404"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3390\/sym10100450"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2014.2302442"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14569\/IJACSA.2016.071114"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/0278364914547786"},{"key":"ref13","first-page":"141","article-title":"On finding narrow passages with probabilistic roadmap planners","volume-title":"Proc. Robot.: Algorithmic Perspective: Workshop Algorithmic Found. Robot.","author":"Hsu","year":"1998"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2888947"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-5225-5751-7.ch012"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TRA.2002.802218"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(87)90051-3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2013.09.004"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-011-9642-9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/rob.21522"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84996-089-2_11"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/11871842_29"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/332"},{"key":"ref26","first-page":"2365","article-title":"Convex regularization in Monte-Carlo tree search","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dam","year":"2021"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631372"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487439"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942976"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i06.6546"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2020.3042129"},{"key":"ref32","first-page":"2164","article-title":"Monte-Carlo planning in large POMDPs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"23","author":"Silver","year":"2010"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v28i1.13882"},{"key":"ref34","article-title":"Despot: Online POMDP planning with regularization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"26","author":"Somani","year":"2013"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2100396"},{"key":"ref36","article-title":"Improved Monte-Carlo search","author":"Kocsis","year":"2006"},{"issue":"2","key":"ref37","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1013689704352","article-title":"Finite-time analysis of the multiarmed bandit problem","volume":"47","author":"Auer","year":"2002","journal-title":"Mach. Learn."},{"key":"ref38","first-page":"542","article-title":"Point-based POMDP algorithms: Improved analysis and implementation","volume-title":"Proc. 21st Conf. Uncertainty Artif. Intell.","author":"Smith","year":"2005"},{"key":"ref39","article-title":"Pomdp solution methods","author":"Braziunas","year":"2003"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.3006789"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9831196\/09860036.pdf?arnumber=9860036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T05:16:02Z","timestamp":1709356562000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9860036\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":40,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lra.2022.3199674","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10]]}}}