{"id":"https://openalex.org/W2103052138","doi":"https://doi.org/10.1109/icra.2011.5980508","title":"Rapidly-exploring Random Belief Trees for motion planning under uncertainty","display_name":"Rapidly-exploring Random Belief Trees for motion planning under uncertainty","publication_year":2011,"publication_date":"2011-05-01","ids":{"openalex":"https://openalex.org/W2103052138","doi":"https://doi.org/10.1109/icra.2011.5980508","mag":"2103052138"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2011.5980508","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2011.5980508","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/66703","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047906613","display_name":"Adam Bry","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Adam Bry","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology, Cambridge , USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge , USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004980809","display_name":"Nicholas Roy","orcid":"https://orcid.org/0000-0002-4277-2928"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nicholas Roy","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology, Cambridge , USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge , USA#TAB#","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047906613"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":15.437,"has_fulltext":false,"cited_by_count":447,"citation_normalized_percentile":{"value":0.99315295,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"723","last_page":"730"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9958000183105469,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7859675884246826},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5891846418380737},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.582663357257843},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5069010853767395},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.4942805767059326},{"id":"https://openalex.org/keywords/estimator","display_name":"Estimator","score":0.4826824963092804},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.4757387638092041},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4709625840187073},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.4476626217365265},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4114505648612976},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3512671887874603},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3127739429473877},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.28622519969940186},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.264820396900177}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7859675884246826},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5891846418380737},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.582663357257843},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5069010853767395},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.4942805767059326},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.4826824963092804},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.4757387638092041},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4709625840187073},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.4476626217365265},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4114505648612976},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3512671887874603},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3127739429473877},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28622519969940186},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.264820396900177},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icra.2011.5980508","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2011.5980508","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/66703","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/66703","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/66703","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/66703","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[{"score":0.75,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W170770739","https://openalex.org/W977458031","https://openalex.org/W1424654272","https://openalex.org/W1529817735","https://openalex.org/W1556467816","https://openalex.org/W1777783943","https://openalex.org/W1982809790","https://openalex.org/W2000359213","https://openalex.org/W2098432798","https://openalex.org/W2098836126","https://openalex.org/W2102585663","https://openalex.org/W2102884619","https://openalex.org/W2106237563","https://openalex.org/W2128582898","https://openalex.org/W2135043890","https://openalex.org/W2138693458","https://openalex.org/W2142424817","https://openalex.org/W2156013594","https://openalex.org/W2166377112","https://openalex.org/W2168359464","https://openalex.org/W2171771720","https://openalex.org/W2295789115","https://openalex.org/W2399880942","https://openalex.org/W2611243847","https://openalex.org/W4232554840","https://openalex.org/W4245959779","https://openalex.org/W6625654502","https://openalex.org/W6631664056","https://openalex.org/W6675657953","https://openalex.org/W6680368953","https://openalex.org/W6680714886","https://openalex.org/W6697179419"],"related_works":["https://openalex.org/W2794103424","https://openalex.org/W4245435724","https://openalex.org/W1996530509","https://openalex.org/W3028317537","https://openalex.org/W2389515972","https://openalex.org/W2055301889","https://openalex.org/W1505959757","https://openalex.org/W2376554934","https://openalex.org/W2394276631","https://openalex.org/W2067790096"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,45],"address":[4],"the":[5,11,42,47,85,103,122,127],"problem":[6,43],"of":[7,13,83,91],"motion":[8,48],"planning":[9,19,28],"in":[10,20,111,115],"presence":[12],"state":[14,94],"uncertainty,":[15],"also":[16,131],"known":[17],"as":[18],"belief":[21,116],"space.":[22],"The":[23],"work":[24],"is":[25],"motivated":[26],"by":[27],"domains":[29],"involving":[30],"nontrivial":[31],"dynamics,":[32],"spatially":[33],"varying":[34],"measurement":[35],"properties,":[36],"and":[37,59,130,145],"obstacle":[38],"constraints.":[39],"To":[40],"make":[41],"tractable,":[44],"restrict":[46],"plan":[49],"to":[50,64,78,121,142],"a":[51,56,71,80,89,112],"nominal":[52,73],"trajectory":[53],"stabilized":[54],"with":[55],"linear":[57],"estimator":[58],"controller.":[60],"This":[61,108],"allows":[62],"us":[63],"predict":[65],"distributions":[66,77],"over":[67,99],"future":[68],"states":[69],"given":[70],"candidate":[72,100],"trajectory.":[74],"Using":[75],"these":[76],"ensure":[79],"bounded":[81],"probability":[82],"collision,":[84],"algorithm":[86,128],"incrementally":[87],"constructs":[88],"graph":[90,104],"trajectories":[92],"through":[93,102],"space,":[95],"while":[96],"efficiently":[97],"searching":[98],"paths":[101],"at":[105],"each":[106],"iteration.":[107],"process":[109],"results":[110,134],"search":[113],"tree":[114],"space":[117],"that":[118],"provably":[119],"converges":[120],"optimal":[123],"path.":[124],"We":[125],"analyze":[126],"theoretically":[129],"provide":[132],"simulation":[133],"demonstrating":[135],"its":[136],"utility":[137],"for":[138],"balancing":[139],"information":[140],"gathering":[141],"reduce":[143],"uncertainty":[144],"finding":[146],"low":[147],"cost":[148],"paths.":[149]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":15},{"year":2024,"cited_by_count":16},{"year":2023,"cited_by_count":23},{"year":2022,"cited_by_count":34},{"year":2021,"cited_by_count":57},{"year":2020,"cited_by_count":54},{"year":2019,"cited_by_count":43},{"year":2018,"cited_by_count":34},{"year":2017,"cited_by_count":47},{"year":2016,"cited_by_count":40},{"year":2015,"cited_by_count":23},{"year":2014,"cited_by_count":28},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":10}],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}