{"id":"https://openalex.org/W2106473816","doi":"https://doi.org/10.1109/robot.2008.4543785","title":"An efficient retraction-based RRT planner","display_name":"An efficient retraction-based RRT planner","publication_year":2008,"publication_date":"2008-05-01","ids":{"openalex":"https://openalex.org/W2106473816","doi":"https://doi.org/10.1109/robot.2008.4543785","mag":"2106473816"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2008.4543785","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2008.4543785","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Robotics and Automation","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/A5101843628","display_name":"Liangjun Zhang","orcid":"https://orcid.org/0000-0003-1237-3384"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Liangjun Zhang","raw_affiliation_strings":["Department of Computer Science, University of North Carolina, Chapel Hill, USA","Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Carolina, Chapel Hill, USA","institution_ids":["https://openalex.org/I114027177"]},{"raw_affiliation_string":"Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC#TAB#","institution_ids":["https://openalex.org/I114027177"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004194238","display_name":"Dinesh Manocha","orcid":"https://orcid.org/0000-0001-7047-9801"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dinesh Manocha","raw_affiliation_strings":["Department of Computer Science, University of North Carolina, Chapel Hill, USA","Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Carolina, Chapel Hill, USA","institution_ids":["https://openalex.org/I114027177"]},{"raw_affiliation_string":"Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC#TAB#","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101843628"],"corresponding_institution_ids":["https://openalex.org/I114027177"],"apc_list":null,"apc_paid":null,"fwci":8.4283,"has_fulltext":false,"cited_by_count":117,"citation_normalized_percentile":{"value":0.97945817,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"3743","last_page":"3750"},"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/T10653","display_name":"Robot Manipulation and Learning","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9980000257492065,"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/voronoi-diagram","display_name":"Voronoi diagram","score":0.8445460200309753},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.7583420276641846},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.6787845492362976},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.6761792302131653},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6456936597824097},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6397771835327148},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5771376490592957},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5551486015319824},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4801473021507263},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.47699597477912903},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46100398898124695},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44916045665740967},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37011000514030457},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2555335760116577},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2183811366558075},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.13548153638839722}],"concepts":[{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.8445460200309753},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.7583420276641846},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.6787845492362976},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.6761792302131653},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6456936597824097},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6397771835327148},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5771376490592957},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5551486015319824},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4801473021507263},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.47699597477912903},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46100398898124695},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44916045665740967},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37011000514030457},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2555335760116577},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2183811366558075},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13548153638839722},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C43617362","wikidata":"https://www.wikidata.org/wiki/Q170050","display_name":"Chromatography","level":1,"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/robot.2008.4543785","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2008.4543785","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5400000214576721,"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":40,"referenced_works":["https://openalex.org/W5006391","https://openalex.org/W142807283","https://openalex.org/W1424654272","https://openalex.org/W1495392417","https://openalex.org/W1532788009","https://openalex.org/W1670942551","https://openalex.org/W1888958121","https://openalex.org/W1971355878","https://openalex.org/W1990451985","https://openalex.org/W2022854905","https://openalex.org/W2025998811","https://openalex.org/W2046356179","https://openalex.org/W2056579540","https://openalex.org/W2063668492","https://openalex.org/W2066011869","https://openalex.org/W2084126027","https://openalex.org/W2101043416","https://openalex.org/W2107535513","https://openalex.org/W2111994433","https://openalex.org/W2114627166","https://openalex.org/W2115243734","https://openalex.org/W2118356379","https://openalex.org/W2122724557","https://openalex.org/W2127894944","https://openalex.org/W2128990851","https://openalex.org/W2139839984","https://openalex.org/W2141664020","https://openalex.org/W2152128591","https://openalex.org/W2155441094","https://openalex.org/W2157543942","https://openalex.org/W2161473822","https://openalex.org/W2163913482","https://openalex.org/W2611243847","https://openalex.org/W3115270213","https://openalex.org/W6605809391","https://openalex.org/W6629573421","https://openalex.org/W6631880011","https://openalex.org/W6637067985","https://openalex.org/W6639683388","https://openalex.org/W6680373910"],"related_works":["https://openalex.org/W3020555194","https://openalex.org/W2793256277","https://openalex.org/W4360958759","https://openalex.org/W2348235448","https://openalex.org/W2116218375","https://openalex.org/W2389906634","https://openalex.org/W176898926","https://openalex.org/W288156810","https://openalex.org/W2394276631","https://openalex.org/W3216096898"],"abstract_inverted_index":{"We":[0,66],"present":[1],"a":[2],"novel":[3],"optimization-based":[4],"retraction":[5,22],"algorithm":[6,40,90],"to":[7,56,95],"improve":[8,57],"the":[9,36,44,58,68,79],"performance":[10,59,69],"of":[11,46,60,70],"sample-based":[12],"planners":[13,62,108],"in":[14,35,63],"narrow":[15,64,113],"passages":[16],"for":[17],"3D":[18],"rigid":[19],"robots.":[20],"The":[21],"step":[23],"is":[24,91],"formulated":[25],"as":[26],"an":[27,31],"optimization":[28],"problem":[29],"using":[30,48,73],"appropriate":[32],"distance":[33],"metric":[34],"configuration":[37],"space.":[38],"Our":[39,89],"computes":[41],"samples":[42,55],"near":[43],"boundary":[45],"C-obstacle":[47],"local":[49],"contact":[50],"analysis":[51],"and":[52,76,93],"uses":[53],"those":[54],"RRT":[61,107],"passages.":[65,114],"analyze":[67],"our":[71],"planner":[72],"Voronoi":[74],"diagrams":[75],"show":[77],"that":[78],"tree":[80],"can":[81],"grow":[82],"closely":[83],"towards":[84],"any":[85],"randomly":[86],"generated":[87],"sample.":[88],"general":[92],"applicable":[94],"all":[96],"polygonal":[97],"models.":[98],"In":[99],"practice,":[100],"we":[101],"observe":[102],"significant":[103],"speedups":[104],"over":[105],"prior":[106],"on":[109],"challenging":[110],"scenarios":[111],"with":[112]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}