{"id":"https://openalex.org/W2592467019","doi":"https://doi.org/10.1109/robio.2016.7866641","title":"Fast Convergence RRT for asymptotically-optimal Motion Planning","display_name":"Fast Convergence RRT for asymptotically-optimal Motion Planning","publication_year":2016,"publication_date":"2016-12-01","ids":{"openalex":"https://openalex.org/W2592467019","doi":"https://doi.org/10.1109/robio.2016.7866641","mag":"2592467019"},"language":"en","primary_location":{"id":"doi:10.1109/robio.2016.7866641","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robio.2016.7866641","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Robotics and Biomimetics (ROBIO)","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/A5088918452","display_name":"Risheng Kang","orcid":"https://orcid.org/0000-0001-9157-2458"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Risheng Kang","raw_affiliation_strings":["Key Laboratory of Machine perception and Intelligence, Shenzhen Graduate School, CHINA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Key Laboratory of Machine perception and Intelligence, Shenzhen Graduate School, CHINA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100410326","display_name":"Hong Liu","orcid":"https://orcid.org/0000-0002-7498-6541"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hong Liu","raw_affiliation_strings":["Key Laboratory of Machine perception and Intelligence, Shenzhen Graduate School, CHINA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Key Laboratory of Machine perception and Intelligence, Shenzhen Graduate School, CHINA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058768147","display_name":"Zhi Wang","orcid":"https://orcid.org/0000-0002-2227-8092"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhi Wang","raw_affiliation_strings":["Key Laboratory of Machine perception and Intelligence, Shenzhen Graduate School, CHINA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Key Laboratory of Machine perception and Intelligence, Shenzhen Graduate School, CHINA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.169,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61692009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"3","issue":null,"first_page":"2111","last_page":"2116"},"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.9986000061035156,"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/T10653","display_name":"Robot Manipulation and Learning","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/random-tree","display_name":"Random tree","score":0.7861413955688477},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.716102123260498},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.6675261855125427},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6510429382324219},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.6389923691749573},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5893233418464661},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5850534439086914},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5363152623176575},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5337086319923401},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5052343010902405},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.4802551567554474},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34897416830062866},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2786768078804016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26354628801345825}],"concepts":[{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.7861413955688477},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.716102123260498},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.6675261855125427},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6510429382324219},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.6389923691749573},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5893233418464661},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5850534439086914},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5363152623176575},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5337086319923401},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5052343010902405},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.4802551567554474},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34897416830062866},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2786768078804016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26354628801345825},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/robio.2016.7866641","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robio.2016.7866641","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Robotics and Biomimetics (ROBIO)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5299999713897705,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W157296195","https://openalex.org/W181534116","https://openalex.org/W1424654272","https://openalex.org/W1583541992","https://openalex.org/W1602983335","https://openalex.org/W1643513940","https://openalex.org/W1971086298","https://openalex.org/W1976930960","https://openalex.org/W1999250663","https://openalex.org/W2018740177","https://openalex.org/W2031179071","https://openalex.org/W2034801091","https://openalex.org/W2076162824","https://openalex.org/W2084501107","https://openalex.org/W2103524001","https://openalex.org/W2103807566","https://openalex.org/W2109212155","https://openalex.org/W2112765698","https://openalex.org/W2133820736","https://openalex.org/W2154038478","https://openalex.org/W2159722616","https://openalex.org/W2168430074","https://openalex.org/W2952264980","https://openalex.org/W3102121895","https://openalex.org/W3104753760","https://openalex.org/W3115270213","https://openalex.org/W3140434919","https://openalex.org/W6606399625","https://openalex.org/W6636841669","https://openalex.org/W6658068740","https://openalex.org/W6679634330"],"related_works":["https://openalex.org/W1991478428","https://openalex.org/W1987694097","https://openalex.org/W3158818664","https://openalex.org/W2797949337","https://openalex.org/W2863424594","https://openalex.org/W2372633663","https://openalex.org/W4388720133","https://openalex.org/W2564325388","https://openalex.org/W2108906364","https://openalex.org/W2118356379"],"abstract_inverted_index":{"Recently,":[0],"the":[1,31,69,81,84,94,109,113,120,124,133],"optimal":[2],"motion":[3,58],"planning":[4,59],"problem":[5],"has":[6,76],"attracted":[7],"a":[8,38,45,54,102,143],"considerable":[9],"amount":[10,40],"of":[11,41,97,108,123,142],"attention,":[12],"giving":[13],"rise":[14],"to":[15,43,71,92,118,150],"new":[16],"algorithms":[17,25],"like":[18,34],"RRG,":[19],"RRT*":[20],"and":[21,83,89,111,136,139],"PRM*.":[22],"However,":[23],"these":[24],"have":[26],"some":[27],"difficulty":[28],"in":[29],"handling":[30],"high-dimensional":[32],"situation":[33],"manipulation,":[35],"which":[36],"needs":[37],"large":[39],"samples":[42],"explore":[44],"huge":[46],"configuration":[47],"space.":[48],"In":[49],"this":[50],"context,":[51],"we":[52],"present":[53],"novel":[55],"incremental":[56],"sampling-based":[57],"algorithm":[60],"called":[61],"Fast":[62],"Convergence":[63],"Rapidly-exploring":[64],"Random":[65],"Tree":[66],"(FCRRT).":[67],"Besides":[68],"guarantee":[70],"asymptotic":[72],"optimality,":[73],"our":[74],"method":[75],"two":[77],"key":[78],"improvements:":[79],"(1)":[80],"exploration":[82,95,134],"optimization":[85],"procedures":[86],"are":[87],"implemented":[88],"executed":[90],"independently":[91],"retain":[93],"strength":[96],"RRT":[98],"that":[99,129],"rapidly":[100],"grows":[101],"random":[103],"tree":[104],"toward":[105],"unexplored":[106],"regions":[107],"C-space,":[110],"(2),":[112],"Lazy-RRG":[114],"technique":[115],"is":[116],"used":[117],"accelerate":[119],"convergence":[121],"rate":[122,135],"method.":[125],"Experimental":[126],"results":[127],"indicate":[128],"FCRRT":[130],"significantly":[131],"improves":[132],"success":[137],"rate,":[138],"finds":[140],"paths":[141],"similar":[144],"quality":[145],"much":[146],"more":[147],"quickly":[148],"compared":[149],"RRT*.":[151]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}