{"id":"https://openalex.org/W2118356379","doi":"https://doi.org/10.1109/robot.2006.1641823","title":"An obstacle-based rapidly-exploring random tree","display_name":"An obstacle-based rapidly-exploring random tree","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2118356379","doi":"https://doi.org/10.1109/robot.2006.1641823","mag":"2118356379"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2006.1641823","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2006.1641823","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006.","raw_type":"proceedings-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/A5101107466","display_name":"Rodriguez","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rodriguez","raw_affiliation_strings":["Parasol Lab., Texas A&M Univ., Galveston, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Parasol Lab., Texas A&M Univ., Galveston, TX","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101539896","display_name":"Xinyu Tang","orcid":"https://orcid.org/0000-0003-1761-6664"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xinyu Tang","raw_affiliation_strings":["Parasol Laboratory, CS Department, Texas A and M University, USA","Parasol Lab., Texas A&M Univ., Galveston, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Parasol Laboratory, CS Department, Texas A and M University, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Parasol Lab., Texas A&M Univ., Galveston, TX","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019967864","display_name":"Jyh\u2010Ming Lien","orcid":"https://orcid.org/0000-0002-0840-6131"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jyh-Ming Lien","raw_affiliation_strings":["Parasol Laboratory, CS Department, Texas A and M University, USA","Parasol Lab., Texas A&M Univ., Galveston, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Parasol Laboratory, CS Department, Texas A and M University, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Parasol Lab., Texas A&M Univ., Galveston, TX","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050205557","display_name":"Nancy M. Amato","orcid":"https://orcid.org/0000-0001-5817-5290"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"N.M. Amato","raw_affiliation_strings":["Parasol Laboratory, CS Department, Texas A and M University, USA","Parasol Lab., Texas A&M Univ., Galveston, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Parasol Laboratory, CS Department, Texas A and M University, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Parasol Lab., Texas A&M Univ., Galveston, TX","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101107466"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":3.7846,"has_fulltext":false,"cited_by_count":203,"citation_normalized_percentile":{"value":0.93893613,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"895","last_page":"900"},"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.9976999759674072,"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/T10879","display_name":"Robotic Locomotion and Control","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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.8593182563781738},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.8450789451599121},{"id":"https://openalex.org/keywords/workspace","display_name":"Workspace","score":0.8029650449752808},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.7940737009048462},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.780290424823761},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.7665513753890991},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7003557085990906},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6187581419944763},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5386360287666321},{"id":"https://openalex.org/keywords/face","display_name":"Face (sociological concept)","score":0.45286792516708374},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4441837966442108},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.42163950204849243},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35919421911239624},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21363726258277893},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17168200016021729},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.14003601670265198},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.07793480157852173},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07005858421325684}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8593182563781738},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.8450789451599121},{"id":"https://openalex.org/C58581272","wikidata":"https://www.wikidata.org/wiki/Q12741163","display_name":"Workspace","level":3,"score":0.8029650449752808},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.7940737009048462},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.780290424823761},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7665513753890991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7003557085990906},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6187581419944763},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5386360287666321},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.45286792516708374},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4441837966442108},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.42163950204849243},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35919421911239624},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21363726258277893},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17168200016021729},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.14003601670265198},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.07793480157852173},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07005858421325684},{"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/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C36289849","wikidata":"https://www.wikidata.org/wiki/Q34749","display_name":"Social science","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/robot.2006.1641823","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2006.1641823","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.75}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1495392417","https://openalex.org/W1586438301","https://openalex.org/W1670942551","https://openalex.org/W1937587174","https://openalex.org/W1978301848","https://openalex.org/W2016828152","https://openalex.org/W2042106485","https://openalex.org/W2105248582","https://openalex.org/W2107535513","https://openalex.org/W2109212155","https://openalex.org/W2114627166","https://openalex.org/W2127894944","https://openalex.org/W2128990851","https://openalex.org/W2140581373","https://openalex.org/W2141664020","https://openalex.org/W2146467128","https://openalex.org/W2153996255","https://openalex.org/W2154574107","https://openalex.org/W2155559957","https://openalex.org/W2171266831","https://openalex.org/W2295904058","https://openalex.org/W2397499736","https://openalex.org/W3104753760","https://openalex.org/W3115270213","https://openalex.org/W4229866769","https://openalex.org/W4247382745","https://openalex.org/W6629573421","https://openalex.org/W6635058101","https://openalex.org/W6637067985","https://openalex.org/W6680635171","https://openalex.org/W6697152052","https://openalex.org/W6712734153"],"related_works":["https://openalex.org/W1991478428","https://openalex.org/W2797949337","https://openalex.org/W3158818664","https://openalex.org/W4388720133","https://openalex.org/W2372633663","https://openalex.org/W2863424594","https://openalex.org/W2564325388","https://openalex.org/W2108906364","https://openalex.org/W2371294653","https://openalex.org/W1660309994"],"abstract_inverted_index":{"Tree-based":[0],"path":[1,29],"planners":[2],"have":[3],"been":[4],"shown":[5],"to":[6,10,35,61,68],"be":[7,55],"well":[8],"suited":[9],"solve":[11],"various":[12],"high":[13],"dimensional":[14],"motion":[15],"planning":[16,30,89,105],"problems.":[17],"Here":[18],"we":[19],"present":[20],"a":[21,107],"variant":[22],"of":[23],"the":[24,70,76,79,99,110],"Rapidly-Exploring":[25],"Random":[26],"Tree":[27],"(RRT)":[28],"algorithm":[31],"that":[32,46],"is":[33],"able":[34],"explore":[36],"narrow":[37,108],"passages":[38],"or":[39,94],"difficult":[40,86],"areas":[41,87,120],"more":[42],"effectively.":[43],"We":[44],"show":[45],"both":[47],"workspace":[48],"obstacle":[49],"information":[50,53],"and":[51],"C-space":[52],"can":[54,102],"used":[56],"when":[57,88],"deciding":[58],"which":[59],"direction":[60],"grow.":[62],"The":[63],"method":[64],"includes":[65],"many":[66],"ways":[67],"grow":[69],"tree,":[71],"some":[72],"taking":[73],"into":[74],"account":[75],"obstacles":[77],"in":[78,85,106,118],"environment.":[80],"This":[81],"planner":[82,113],"works":[83,116],"best":[84,117],"for":[90],"free":[91],"flying":[92],"rigid":[93],"articulated":[95],"robots.":[96],"Indeed,":[97],"whereas":[98],"standard":[100],"RRT":[101],"face":[103],"difficulties":[104],"passage,":[109],"tree":[111],"based":[112],"presented":[114],"here":[115],"these":[119]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":17},{"year":2022,"cited_by_count":14},{"year":2021,"cited_by_count":19},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":17},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":6}],"updated_date":"2026-05-03T08:25:01.440150","created_date":"2025-10-10T00:00:00"}