{"id":"https://openalex.org/W2156244480","doi":"https://doi.org/10.1109/robot.2006.1641175","title":"RRT path planner with 3DOF local planner","display_name":"RRT path planner with 3DOF local planner","publication_year":2006,"publication_date":"2006-07-10","ids":{"openalex":"https://openalex.org/W2156244480","doi":"https://doi.org/10.1109/robot.2006.1641175","mag":"2156244480"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2006.1641175","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2006.1641175","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/A5110261094","display_name":"Jade Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jade Yang","raw_affiliation_strings":["Computer Science Department, Purdue University, West Lafayette, IN, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035745117","display_name":"Elisha Sacks","orcid":"https://orcid.org/0009-0002-6955-2754"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. Sacks","raw_affiliation_strings":["Computer Science Department, Purdue University, West Lafayette, IN, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110261094"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.19004512,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":null,"first_page":"145","last_page":"149"},"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.9980000257492065,"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/T12288","display_name":"Optimization and Search Problems","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/planner","display_name":"Planner","score":0.8948513865470886},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.7049916982650757},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7011356353759766},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.6493432521820068},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6216550469398499},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6178017854690552},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6061356067657471},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5141987800598145},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4506146013736725},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.42279669642448425},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33774086833000183},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2733396291732788},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.061106204986572266},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.05915862321853638},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0556509792804718}],"concepts":[{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.8948513865470886},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.7049916982650757},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7011356353759766},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.6493432521820068},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6216550469398499},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6178017854690552},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6061356067657471},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5141987800598145},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4506146013736725},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.42279669642448425},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33774086833000183},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2733396291732788},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.061106204986572266},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.05915862321853638},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0556509792804718},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/robot.2006.1641175","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2006.1641175","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.414.7084","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.414.7084","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.purdue.edu/cgvlab/papers/eps/sacks-yang06.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6899999976158142,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1495392417","https://openalex.org/W1531225991","https://openalex.org/W1617800291","https://openalex.org/W1670942551","https://openalex.org/W2037907469","https://openalex.org/W2101902009","https://openalex.org/W2114375336","https://openalex.org/W2128990851","https://openalex.org/W2134741043","https://openalex.org/W2141664020","https://openalex.org/W2143826757","https://openalex.org/W2158207287","https://openalex.org/W2161473822","https://openalex.org/W2171205311","https://openalex.org/W3115270213","https://openalex.org/W6629573421","https://openalex.org/W6631813400","https://openalex.org/W6637067985","https://openalex.org/W6683392559"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W2394276631","https://openalex.org/W3216096898","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W4395071568","https://openalex.org/W2904203243","https://openalex.org/W3139139461","https://openalex.org/W2125569607"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,7,17,24,30,46,51],"path":[3],"planning":[4],"algorithm":[5,27],"for":[6],"polyhedral":[8],"robot":[9,40],"with":[10,91],"six":[11],"degrees":[12],"of":[13,23,54,77],"freedom":[14],"(6DOF)":[15],"and":[16,94],"static":[18],"obstacle.":[19],"The":[20],"planner":[21,36,85],"consists":[22],"dual-tree":[25],"RRT":[26],"that":[28,66,74],"uses":[29],"novel":[31],"local":[32,35],"planner.":[33],"A":[34],"tests":[37],"if":[38],"two":[39,69],"configurations":[41],"can":[42],"be":[43],"connected":[44],"by":[45],"simple":[47],"path.":[48],"Ours":[49],"searches":[50],"3DOF":[52,79],"subspace":[53],"the":[55,63,68,75,78,82],"robot/obstacle":[56],"configuration":[57],"space,":[58],"whereas":[59],"prior":[60,87],"planners":[61,88],"search":[62,80],"line":[64],"segment":[65],"connects":[67],"configurations.":[70],"Empirical":[71],"evidence":[72],"suggests":[73],"benefit":[76],"outweighs":[81],"cost.":[83],"Our":[84],"outperforms":[86],"on":[89,102],"problems":[90,104],"narrow":[92],"channels":[93],"performs":[95],"comparably":[96],"(shorter":[97],"paths,":[98],"similar":[99],"running":[100],"times)":[101],"other":[103]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}