{"id":"https://openalex.org/W1986210666","doi":"https://doi.org/10.1109/iros.2010.5650614","title":"Extending rapidly-exploring random trees for asymptotically optimal anytime motion planning","display_name":"Extending rapidly-exploring random trees for asymptotically optimal anytime motion planning","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W1986210666","doi":"https://doi.org/10.1109/iros.2010.5650614","mag":"1986210666"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2010.5650614","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2010.5650614","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE/RSJ International Conference on Intelligent Robots and Systems","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/A5047010941","display_name":"Yasin Abbasi-Yadkori","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Yasin Abbasi-Yadkori","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Canada","Dept. of Computing Science, Univ. of Alberta, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Dept. of Computing Science, Univ. of Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054065284","display_name":"Joseph Modayil","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Joseph Modayil","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Canada","Dept. of Computing Science, Univ. of Alberta, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Dept. of Computing Science, Univ. of Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069856068","display_name":"Csaba Szepesv\u00e1ri","orcid":"https://orcid.org/0000-0002-9286-2892"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Csaba Szepesvari","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Canada","Dept. of Computing Science, Univ. of Alberta, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Dept. of Computing Science, Univ. of Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047010941"],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":0.9698,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.75861646,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"127","last_page":"132"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9955000281333923,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5821795463562012},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5775789022445679},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.5621457695960999},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5609104037284851},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5340859889984131},{"id":"https://openalex.org/keywords/action","display_name":"Action (physics)","score":0.5274441838264465},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4587893486022949},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4531668424606323},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3526277542114258},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3268303871154785},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21546080708503723},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.16701024770736694},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1240057647228241}],"concepts":[{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5821795463562012},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5775789022445679},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.5621457695960999},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5609104037284851},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5340859889984131},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.5274441838264465},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4587893486022949},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4531668424606323},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3526277542114258},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3268303871154785},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21546080708503723},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.16701024770736694},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1240057647228241},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iros.2010.5650614","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2010.5650614","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.232.2723","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.2723","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ualberta.ca/%7Eszepesva/papers/iros-2010.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.75,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W1777783943","https://openalex.org/W2000359213","https://openalex.org/W2128990851","https://openalex.org/W2143826757","https://openalex.org/W2296385533","https://openalex.org/W2611243847","https://openalex.org/W2949623849","https://openalex.org/W3104753760","https://openalex.org/W4242811155","https://openalex.org/W6638062875"],"related_works":["https://openalex.org/W2075768550","https://openalex.org/W3022218857","https://openalex.org/W2369178846","https://openalex.org/W2082716031","https://openalex.org/W2370289839","https://openalex.org/W2933494595","https://openalex.org/W2118356379","https://openalex.org/W1976930960","https://openalex.org/W4211055164","https://openalex.org/W2288650507"],"abstract_inverted_index":{"We":[0,17,75,90],"consider":[1],"the":[2,19,51,64,86,93],"problem":[3,24,49],"of":[4,85],"anytime":[5,83],"planning":[6],"in":[7],"continuous":[8],"state":[9],"and":[10,25,35,100],"action":[11],"spaces":[12],"with":[13,41,72],"non-linear":[14],"deterministic":[15],"dynamics.":[16],"review":[18],"existing":[20],"approaches":[21],"to":[22,47],"this":[23,48],"find":[26,32],"no":[27],"algorithms":[28],"that":[29,57,92,103],"both":[30],"quickly":[31,58],"feasible":[33,61],"solutions":[34,40],"also":[36],"eventually":[37],"approach":[38],"optimal":[39,108],"additional":[42,73],"time.":[43,74],"The":[44],"state-of-the-art":[45],"solution":[46],"is":[50],"rapidly-exploring":[52],"random":[53],"tree":[54],"(RRT)":[55],"algorithm":[56,66,95],"finds":[59,106],"a":[60],"solution.":[62],"However,":[63],"RRT":[65,77,88],"does":[67],"not":[68],"return":[69],"better":[70],"results":[71],"introduce":[76],"<sup":[78],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[79],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">++</sup>":[80],",":[81],"an":[82],"extension":[84],"basic":[87],"algorithm.":[89],"show":[91,102],"new":[94],"has":[96],"desirable":[97],"theoretical":[98],"properties":[99],"experimentally":[101],"it":[104],"efficiently":[105],"near":[107],"solutions.":[109]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}