{"id":"https://openalex.org/W2335799662","doi":"https://doi.org/10.1177/0278364915594679","title":"RRT <sup>X</sup> : Asymptotically optimal single-query sampling-based motion planning with quick replanning","display_name":"RRT <sup>X</sup> : Asymptotically optimal single-query sampling-based motion planning with quick replanning","publication_year":2015,"publication_date":"2015-09-20","ids":{"openalex":"https://openalex.org/W2335799662","doi":"https://doi.org/10.1177/0278364915594679","mag":"2335799662"},"language":"en","primary_location":{"id":"doi:10.1177/0278364915594679","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364915594679","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","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/A5010568864","display_name":"Michael Otte","orcid":"https://orcid.org/0000-0001-7432-0734"},"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":"Michael Otte","raw_affiliation_strings":["Laboratory for Information and Decision, Massachusetts Institute of Technology, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory for Information and Decision, Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029069358","display_name":"Emilio Frazzoli","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":false,"raw_author_name":"Emilio Frazzoli","raw_affiliation_strings":["Laboratory for Information and Decision, Massachusetts Institute of Technology, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory for Information and Decision, Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010568864"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":6.8387,"has_fulltext":false,"cited_by_count":232,"citation_normalized_percentile":{"value":0.97467852,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"35","issue":"7","first_page":"797","last_page":"822"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.994700014591217,"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"}},{"id":"https://openalex.org/T11714","display_name":"Multimodal Machine Learning Applications","score":0.9815000295639038,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.6736570596694946},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5777850151062012},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5385549664497375},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45098647475242615},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43045127391815186},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4287058413028717},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.42683690786361694},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.3912346661090851},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3755192756652832},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3741978406906128},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3569062054157257},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3226468563079834},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21490809321403503},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19328609108924866}],"concepts":[{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.6736570596694946},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5777850151062012},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5385549664497375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45098647475242615},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43045127391815186},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4287058413028717},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.42683690786361694},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3912346661090851},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3755192756652832},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3741978406906128},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3569062054157257},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3226468563079834},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21490809321403503},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19328609108924866}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/0278364915594679","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364915594679","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W966818798","https://openalex.org/W1424654272","https://openalex.org/W1498606418","https://openalex.org/W1970405566","https://openalex.org/W1971086298","https://openalex.org/W1971672424","https://openalex.org/W1979743043","https://openalex.org/W1982809790","https://openalex.org/W1992157405","https://openalex.org/W1993115704","https://openalex.org/W2000359213","https://openalex.org/W2004100691","https://openalex.org/W2036016432","https://openalex.org/W2055891854","https://openalex.org/W2064755319","https://openalex.org/W2069522844","https://openalex.org/W2070092132","https://openalex.org/W2084501107","https://openalex.org/W2091338725","https://openalex.org/W2099593662","https://openalex.org/W2100538121","https://openalex.org/W2104186994","https://openalex.org/W2108643443","https://openalex.org/W2110144538","https://openalex.org/W2113029345","https://openalex.org/W2128990851","https://openalex.org/W2135639338","https://openalex.org/W2141517821","https://openalex.org/W2145089737","https://openalex.org/W2153219011","https://openalex.org/W2156123119","https://openalex.org/W2156176003","https://openalex.org/W2159722616","https://openalex.org/W2161675447","https://openalex.org/W2165216595","https://openalex.org/W2167869989","https://openalex.org/W2167918262","https://openalex.org/W2294319407","https://openalex.org/W2294808847","https://openalex.org/W2312064194","https://openalex.org/W2516826564","https://openalex.org/W2519453022","https://openalex.org/W2570852788","https://openalex.org/W2611243847","https://openalex.org/W2613832771","https://openalex.org/W2645793119","https://openalex.org/W4213026089","https://openalex.org/W4231761304","https://openalex.org/W4256361765"],"related_works":["https://openalex.org/W3148718598","https://openalex.org/W2163788280","https://openalex.org/W2012749513","https://openalex.org/W1764572413","https://openalex.org/W2118356379","https://openalex.org/W1976930960","https://openalex.org/W4211055164","https://openalex.org/W2288650507","https://openalex.org/W1941306591","https://openalex.org/W150528880"],"abstract_inverted_index":{"Dynamic":[0],"environments":[1,220],"have":[2],"obstacles":[3,70],"that":[4,17,58,167,282],"unpredictably":[5,146],"appear,":[6],"disappear,":[7],"or":[8,64],"move.":[9],"We":[10],"present":[11],"the":[12,42,46,67,73,82,92,103,107,111,114,168,224,265],"first":[13],"sampling-based":[14],"replanning":[15,56],"algorithm":[16],"is":[18,32,124,153,184,203,210,235,285],"asymptotically":[19,196],"optimal":[20,197],"and":[21,40,60,85,97,116,127,133,207,230,234,264,274,280,290],"single-query":[22,55,198],"(designed":[23],"for":[24,141,155,189,269],"situation":[25],"in":[26,102,162,287],"which":[27],"a":[28,76,175,257,270],"priori":[29],"offline":[30],"computation":[31],"unavailable).":[33],"Our":[34],"algorithm,":[35],"RRT":[36,122,157,190,208,221,229,238,283],"X":[37,123,158,191,222,284],",":[38,240],"refines":[39],"repairs":[41,86],"same":[43,225],"search-graph":[44,84,266],"over":[45],"entire":[47],"duration":[48],"of":[49,66,113,177,259],"navigation":[50,144],"(in":[51],"contrast":[52],"to":[53,90,118,159,173,248],"previous":[54],"algorithms":[57,199],"prune":[59],"then":[61],"regrow":[62],"some":[63],"all":[65],"search-tree).":[68],"Whenever":[69],"change":[71],"and/or":[72],"robot":[74,115],"moves,":[75],"graph":[77,96,176],"rewiring":[78],"cascade":[79],"quickly":[80,139,161],"remodels":[81],"existing":[83],"its":[87],"shortest-path-to-goal":[88],"sub-tree":[89],"reflect":[91],"new":[93],"information.":[94],"Both":[95],"tree":[98],"are":[99],"built":[100],"directly":[101],"robot\u2019s":[104],"state-space;":[105],"thus,":[106],"resulting":[108],"plan(s)":[109],"respect":[110],"kinematics":[112],"continue":[117],"improve":[119],"during":[120],"navigation.":[121],"probabilistically":[125],"complete":[126],"makes":[128],"no":[129],"distinction":[130],"between":[131],"local":[132],"global":[134],"planning,":[135],"yet":[136],"it":[137],"reacts":[138],"enough":[140],"real-time":[142],"high-speed":[143],"through":[145],"changing":[147],"environments.":[148,292],"Low":[149],"information":[150,169],"transfer":[151,170],"time":[152,171],"essential":[154],"enabling":[156],"react":[160],"dynamic":[163,291],"environments;":[164],"we":[165],"prove":[166,201],"required":[172],"inform":[174],"size":[178],"n":[179,186,214],"about":[180],"an":[181],"\u03b5-cost":[182],"decrease":[183],"O(":[185],"log":[187,215],"n)":[188,251,261],"\u2014faster":[192],"than":[193,237],"other":[194],"current":[195],"(we":[200],"RRT*":[202],"[Formula:":[204,211,241],"see":[205,212,242],"text]":[206],"#":[209,239],"text](":[213],"2":[216,244],"n)).":[217],"In":[218,246],"static":[219,289],"has":[223],"amortized":[226],"runtime":[227],"as":[228],"RRT*,":[231],"\u0398(log":[232],"n),":[233],"faster":[236],"text](log":[243],"n).":[245],"order":[247],"achieve":[249],"O(log":[250,260],"iteration":[252],"time,":[253],"each":[254],"node":[255],"maintains":[256,267],"set":[258],"expected":[262],"neighbors,":[263],"\u03b5-consistency":[268],"predefined":[271],"\u03b5.":[272],"Experiments":[273],"simulations":[275],"confirm":[276],"our":[277],"theoretical":[278],"analysis":[279],"demonstrate":[281],"useful":[286],"both":[288]},"counts_by_year":[{"year":2026,"cited_by_count":12},{"year":2025,"cited_by_count":31},{"year":2024,"cited_by_count":28},{"year":2023,"cited_by_count":34},{"year":2022,"cited_by_count":23},{"year":2021,"cited_by_count":30},{"year":2020,"cited_by_count":23},{"year":2019,"cited_by_count":22},{"year":2018,"cited_by_count":20},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":1}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}