{"id":"https://openalex.org/W4293768879","doi":"https://doi.org/10.1109/lra.2022.3199674","title":"Monte-Carlo Robot Path Planning","display_name":"Monte-Carlo Robot Path Planning","publication_year":2022,"publication_date":"2022-08-29","ids":{"openalex":"https://openalex.org/W4293768879","doi":"https://doi.org/10.1109/lra.2022.3199674"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2022.3199674","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2022.3199674","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061282536","display_name":"Tuan Dam","orcid":"https://orcid.org/0000-0001-7422-139X"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tuan Dam","raw_affiliation_strings":["Department of Computer Science, Technische Universit&#x00E4;t, Darmstadt, Germany"],"raw_orcid":"https://orcid.org/0000-0001-7422-139X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universit&#x00E4;t, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026055366","display_name":"Georgia Chalvatzaki","orcid":"https://orcid.org/0000-0002-5055-199X"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Georgia Chalvatzaki","raw_affiliation_strings":["Department of Computer Science, Technische Universit&#x00E4;t, Darmstadt, Germany"],"raw_orcid":"https://orcid.org/0000-0002-5055-199X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universit&#x00E4;t, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071367253","display_name":"Jan Peters","orcid":"https://orcid.org/0000-0002-5266-8091"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jan Peters","raw_affiliation_strings":["Department of Computer Science, Technische Universit&#x00E4;t, Darmstadt, Germany"],"raw_orcid":"https://orcid.org/0000-0002-5266-8091","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universit&#x00E4;t, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017983137","display_name":"Joni Pajarinen","orcid":"https://orcid.org/0000-0003-4469-8191"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]},{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["DE","FI"],"is_corresponding":false,"raw_author_name":"Joni Pajarinen","raw_affiliation_strings":["Department of Computer Science, Technische Universit&#x00E4;t, Darmstadt, Germany","Department of Electrical Engineering and Automation, Aalto University, Aalto, Finland"],"raw_orcid":"https://orcid.org/0000-0003-4469-8191","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technische Universit&#x00E4;t, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]},{"raw_affiliation_string":"Department of Electrical Engineering and Automation, Aalto University, Aalto, Finland","institution_ids":["https://openalex.org/I9927081"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.9476,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.94974488,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"7","issue":"4","first_page":"11213","last_page":"11220"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.646451473236084},{"id":"https://openalex.org/keywords/probabilistic-roadmap","display_name":"Probabilistic roadmap","score":0.5972509980201721},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5722001791000366},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5522456765174866},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5278739333152771},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4785776138305664},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.466171532869339},{"id":"https://openalex.org/keywords/observable","display_name":"Observable","score":0.4495188891887665},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4468371868133545},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43032246828079224},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.38788098096847534},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3685850203037262},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31510090827941895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2907385230064392},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08253160119056702}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.646451473236084},{"id":"https://openalex.org/C2778803389","wikidata":"https://www.wikidata.org/wiki/Q7246866","display_name":"Probabilistic roadmap","level":4,"score":0.5972509980201721},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5722001791000366},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5522456765174866},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5278739333152771},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4785776138305664},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.466171532869339},{"id":"https://openalex.org/C32848918","wikidata":"https://www.wikidata.org/wiki/Q845789","display_name":"Observable","level":2,"score":0.4495188891887665},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4468371868133545},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43032246828079224},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.38788098096847534},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3685850203037262},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31510090827941895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2907385230064392},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08253160119056702},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2022.3199674","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2022.3199674","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.46000000834465027,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G2553111511","display_name":null,"funder_award_id":"PA 3179/1-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W183472599","https://openalex.org/W187586930","https://openalex.org/W1625390266","https://openalex.org/W1976930960","https://openalex.org/W1990871591","https://openalex.org/W2013724901","https://openalex.org/W2019738489","https://openalex.org/W2022115960","https://openalex.org/W2037907469","https://openalex.org/W2055201760","https://openalex.org/W2086706470","https://openalex.org/W2125035363","https://openalex.org/W2128990851","https://openalex.org/W2133358493","https://openalex.org/W2134400955","https://openalex.org/W2136265843","https://openalex.org/W2141664020","https://openalex.org/W2144812930","https://openalex.org/W2154645004","https://openalex.org/W2161298439","https://openalex.org/W2168405694","https://openalex.org/W2341848647","https://openalex.org/W2414947275","https://openalex.org/W2557741120","https://openalex.org/W2795496197","https://openalex.org/W2889786920","https://openalex.org/W2893387050","https://openalex.org/W2895647709","https://openalex.org/W2998394761","https://openalex.org/W3034650914","https://openalex.org/W3039584045","https://openalex.org/W3102121895","https://openalex.org/W3108549307","https://openalex.org/W3113605944","https://openalex.org/W6605295560","https://openalex.org/W6605705772","https://openalex.org/W6607530536","https://openalex.org/W6636732284","https://openalex.org/W6637067985","https://openalex.org/W6678541622","https://openalex.org/W6684973485","https://openalex.org/W6780604375"],"related_works":["https://openalex.org/W2107702345","https://openalex.org/W2381469031","https://openalex.org/W2137520303","https://openalex.org/W1536392978","https://openalex.org/W2216928063","https://openalex.org/W2389713625","https://openalex.org/W2134348961","https://openalex.org/W2060743914","https://openalex.org/W4308217561","https://openalex.org/W2115192598"],"abstract_inverted_index":{"Path":[0,122],"planning":[1,28,216],"is":[2],"a":[3,51,102,201,212],"crucial":[4],"algorithmic":[5,24,104,172],"approach":[6],"for":[7,26,59,114,156,187],"designing":[8],"robot":[9,115,188,214],"behaviors.":[10],"Sampling-based":[11],"approaches,":[12],"like":[13],"rapidly":[14],"exploring":[15],"random":[16],"trees":[17],"(RRTs)":[18],"or":[19,81],"probabilistic":[20,57,154],"roadmaps,":[21],"are":[22,77],"prominent":[23],"solutions":[25],"path":[27,116,140,189,215],"problems.":[29],"Despite":[30],"its":[31,133,153],"exponential":[32,134],"convergence":[33,69,135],"rate,":[34],"RRT":[35],"can":[36],"only":[37],"find":[38],"suboptimal":[39],"paths.":[40],"On":[41],"the":[42,87,107,130,138,150,219],"other":[43,151],"hand,":[44],"<inline-formula":[45,90],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[46,91],"xmlns:xlink=\"http://www.w3.org/1999/xlink\"><tex-math":[47,92],"notation=\"LaTeX\">$\\text":[48,93],"{RRT}^*$</tex-math></inline-formula>":[49,94],",":[50],"widely-used":[52],"extension":[53],"to":[54,137,176],"RRT,":[55],"guarantees":[56],"completeness":[58,155],"finding":[60,157],"optimal":[61,139],"paths":[62,159],"but":[63],"suffers":[64],"in":[65,70,95,141,160,194,211,223],"practice":[66],"from":[67],"slow":[68],"complex":[71,96],"environments.":[72],"Furthermore,":[73],"real-world":[74,213],"robotic":[75],"environments":[76,199],"often":[78],"partially":[79,161],"observable":[80,143,162],"with":[82,183,200],"poorly":[83],"described":[84],"dynamics,":[85],"casting":[86],"application":[88],"of":[89,106,181,204,221],"tasks":[97],"suboptimal.":[98],"This":[99],"letter":[100],"studies":[101],"novel":[103],"formulation":[105],"popular":[108],"Monte-Carlo":[109,121],"tree":[110],"search":[111],"(MCTS)":[112],"algorithm":[113],"planning.":[117,190],"Notably,":[118],"we":[119],"study":[120],"Planning":[123],"(MCPP)":[124],"by":[125],"analyzing":[126],"and":[127,148,197],"proving,":[128],"on":[129,149],"one":[131],"part,":[132,152],"rate":[136],"fully":[142],"Markov":[144],"decision":[145],"processes":[146],"(MDPs),":[147],"feasible":[158],"MDPs":[163],"(POMDPs)":[164],"assuming":[165],"limited":[166],"distance":[167],"observability":[168],"(proof":[169],"sketch).":[170],"Our":[171,191],"contribution":[173],"allows":[174],"us":[175],"employ":[177],"recently":[178],"proposed":[179],"variants":[180],"MCTS":[182],"different":[184],"exploration":[185],"strategies":[186],"experimental":[192],"evaluations":[193],"simulated":[195],"2D":[196],"3D":[198],"7":[202],"degrees":[203],"freedom":[205],"(DOF)":[206],"manipulator,":[207],"as":[208,210],"well":[209],"task,":[217],"demonstrate":[218],"superiority":[220],"MCPP":[222],"POMDP":[224],"tasks.":[225]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":19},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":2}],"updated_date":"2026-06-30T13:55:48.251075","created_date":"2025-10-10T00:00:00"}