{"id":"https://openalex.org/W2118730279","doi":"https://doi.org/10.1109/icra.2011.5979540","title":"Minimising computational complexity of the RRT algorithm a practical approach","display_name":"Minimising computational complexity of the RRT algorithm a practical approach","publication_year":2011,"publication_date":"2011-05-01","ids":{"openalex":"https://openalex.org/W2118730279","doi":"https://doi.org/10.1109/icra.2011.5979540","mag":"2118730279"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2011.5979540","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2011.5979540","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":"https://vbn.aau.dk/ws/files/52820007/minimise_complexity_of_rrt.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071575048","display_name":"Mikael Svenstrup","orcid":null},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Mikael Svenstrup","raw_affiliation_strings":["Department of Electronic Systems, Automation & Control, University of Aalborg, Aalborg, Denmark","Department of Electronic Systems, Automation and Control, Aalborg University, 9220, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Systems, Automation & Control, University of Aalborg, Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Department of Electronic Systems, Automation and Control, Aalborg University, 9220, Denmark","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000342673","display_name":"Thomas Bak","orcid":"https://orcid.org/0000-0002-8282-5932"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Thomas Bak","raw_affiliation_strings":["Department of Electronic Systems, Automation & Control, University of Aalborg, Aalborg, Denmark","Department of Electronic Systems, Automation and Control, Aalborg University, 9220, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Systems, Automation & Control, University of Aalborg, Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Department of Electronic Systems, Automation and Control, Aalborg University, 9220, Denmark","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059348042","display_name":"Hans J\u00f8rgen Andersen","orcid":"https://orcid.org/0000-0002-0940-0698"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Hans Jorgen Andersen","raw_affiliation_strings":["Department for Media Technology, University of Aalborg, Aalborg, Denmark","Department for Media Technology, Aalborg University, 9220, Denmark"],"affiliations":[{"raw_affiliation_string":"Department for Media Technology, University of Aalborg, Aalborg, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Department for Media Technology, Aalborg University, 9220, Denmark","institution_ids":["https://openalex.org/I891191580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5071575048"],"corresponding_institution_ids":["https://openalex.org/I891191580"],"apc_list":null,"apc_paid":null,"fwci":0.7848,"has_fulltext":true,"cited_by_count":31,"citation_normalized_percentile":{"value":0.76518494,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"5602","last_page":"5607"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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":0.9998999834060669,"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.9940999746322632,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9914000034332275,"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/computer-science","display_name":"Computer science","score":0.6438004970550537},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6265296936035156},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5950022339820862},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5754780173301697},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5646297931671143},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5523788928985596},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5331019163131714},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5125815272331238},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.49175599217414856},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4599460959434509},{"id":"https://openalex.org/keywords/configuration-space","display_name":"Configuration space","score":0.45298370718955994},{"id":"https://openalex.org/keywords/nearest-neighbour","display_name":"Nearest neighbour","score":0.45259711146354675},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.44806140661239624},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26302504539489746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2600623071193695}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6438004970550537},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6265296936035156},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5950022339820862},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5754780173301697},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5646297931671143},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5523788928985596},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5331019163131714},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5125815272331238},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.49175599217414856},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4599460959434509},{"id":"https://openalex.org/C90738871","wikidata":"https://www.wikidata.org/wiki/Q41642869","display_name":"Configuration space","level":2,"score":0.45298370718955994},{"id":"https://openalex.org/C2983946233","wikidata":"https://www.wikidata.org/wiki/Q4088109","display_name":"Nearest neighbour","level":2,"score":0.45259711146354675},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.44806140661239624},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26302504539489746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2600623071193695},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icra.2011.5979540","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2011.5979540","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:pure.atira.dk:publications/98440dff-586a-4e83-a119-54d9eadb220a","is_oa":true,"landing_page_url":"https://vbn.aau.dk/da/publications/98440dff-586a-4e83-a119-54d9eadb220a","pdf_url":"https://vbn.aau.dk/ws/files/52820007/minimise_complexity_of_rrt.pdf","source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Svenstrup, M, Bak, T & Andersen, H J 2011, 'Minimising Computational Complexity of the RRT Algorithm : A Practical Approach', I E E E International Conference on Robotics and Automation. Proceedings. https://doi.org/10.1109/ICRA.2011.5979540","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.302.8618","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.302.8618","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://vbn.aau.dk/files/52820007/minimise_complexity_of_rrt.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/98440dff-586a-4e83-a119-54d9eadb220a","is_oa":true,"landing_page_url":"https://vbn.aau.dk/da/publications/98440dff-586a-4e83-a119-54d9eadb220a","pdf_url":"https://vbn.aau.dk/ws/files/52820007/minimise_complexity_of_rrt.pdf","source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Svenstrup, M, Bak, T & Andersen, H J 2011, 'Minimising Computational Complexity of the RRT Algorithm : A Practical Approach', I E E E International Conference on Robotics and Automation. Proceedings. https://doi.org/10.1109/ICRA.2011.5979540","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"score":0.800000011920929,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2118730279.pdf","grobid_xml":"https://content.openalex.org/works/W2118730279.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1709754610","https://openalex.org/W1777783943","https://openalex.org/W2000359213","https://openalex.org/W2027693953","https://openalex.org/W2051410615","https://openalex.org/W2071866949","https://openalex.org/W2103639171","https://openalex.org/W2114193135","https://openalex.org/W2130403814","https://openalex.org/W2147497140","https://openalex.org/W2220451813","https://openalex.org/W2296356821","https://openalex.org/W2296385533","https://openalex.org/W2427881153","https://openalex.org/W2611243847","https://openalex.org/W6638062875","https://openalex.org/W6668499198","https://openalex.org/W6677136972"],"related_works":["https://openalex.org/W1991478428","https://openalex.org/W2005695917","https://openalex.org/W1987694097","https://openalex.org/W3158818664","https://openalex.org/W2797949337","https://openalex.org/W2333571655","https://openalex.org/W2372633663","https://openalex.org/W2863424594","https://openalex.org/W2268712943","https://openalex.org/W3033127545"],"abstract_inverted_index":{"Sampling":[0],"based":[1,100],"techniques":[2],"for":[3,21,162],"robot":[4,175],"motion":[5],"planning":[6],"have":[7],"become":[8],"more":[9,82,170],"widespread":[10],"during":[11],"the":[12,26,56,77,88,103,118,125,158],"last":[13],"decade.":[14],"The":[15,97,136],"algorithms":[16],"however,":[17],"still":[18],"struggle":[19],"with":[20,52],"example":[22],"narrow":[23],"passages":[24],"in":[25,38,87,168],"configuration":[27,104],"space":[28,105],"and":[29,167],"suffer":[30],"from":[31,130],"high":[32],"number":[33,68],"of":[34,69,91,134],"necessary":[35],"samples,":[36],"especially":[37],"higher":[39],"dimensions.":[40],"A":[41],"widely":[42],"used":[43],"method":[44,54],"is":[45,55,99,122,128,138,160],"Rapidly-exploring":[46],"Random":[47],"Trees":[48],"(RRT's).":[49],"One":[50],"problem":[51],"this":[53],"nearest":[57,119],"neighbour":[58],"search":[59],"time,":[60,79],"which":[61,75],"grows":[62],"significantly":[63],"when":[64],"adding":[65],"a":[66,131,147,163,169,174,179,182],"large":[67],"vertices.":[70],"We":[71],"propose":[72],"an":[73,139],"algorithm":[74,98,140,159],"decreases":[76],"computation":[78],"such":[80],"that":[81,124,141],"vertices":[83],"can":[84,142],"be":[85,114],"added":[86],"same":[89],"amount":[90],"time":[92,149],"to":[93,113,116,177],"generate":[94],"better":[95,144],"trajectories.":[96],"on":[101],"subdividing":[102],"into":[106],"boxes,":[107],"where":[108,173],"only":[109],"specific":[110,171],"boxes":[111],"needs":[112],"searched":[115],"find":[117],"neighbour.":[120],"It":[121],"shown":[123],"computational":[126],"complexity":[127],"lowered":[129],"theoretical":[132],"point":[133],"view.":[135],"result":[137],"provide":[143],"trajectories":[145,154],"within":[146],"given":[148],"period,":[150],"or":[151],"alternatively":[152],"compute":[153],"faster.":[155],"In":[156],"simulation":[157],"verified":[161],"simple":[164],"RRT":[165],"implementation":[166],"case":[172],"has":[176],"plan":[178],"path":[180],"through":[181],"human":[183],"inhabited":[184],"environment.":[185]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}