{"id":"https://openalex.org/W2752924159","doi":"https://doi.org/10.1109/lra.2017.2745542","title":"An Adaptive Stepsize RRT Planning Algorithm for Open-Chain Robots","display_name":"An Adaptive Stepsize RRT Planning Algorithm for Open-Chain Robots","publication_year":2017,"publication_date":"2017-08-28","ids":{"openalex":"https://openalex.org/W2752924159","doi":"https://doi.org/10.1109/lra.2017.2745542","mag":"2752924159"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2017.2745542","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2017.2745542","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-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/A5071356164","display_name":"Byungchul An","orcid":"https://orcid.org/0000-0002-3320-7943"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Byungchul An","raw_affiliation_strings":["Robotics Laboratory, Korea Institute of Technology, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Robotics Laboratory, Korea Institute of Technology, Seoul, South Korea","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061842716","display_name":"Jinkyu Kim","orcid":"https://orcid.org/0000-0001-6520-2074"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jinkyu Kim","raw_affiliation_strings":["Robotics Laboratory, Seoul National University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Robotics Laboratory, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009036246","display_name":"Frank C. Park","orcid":"https://orcid.org/0000-0002-0293-6975"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Frank C. Park","raw_affiliation_strings":["Robotics Laboratory, Seoul National University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Robotics Laboratory, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5071356164"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7392,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.80972085,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"3","issue":"1","first_page":"312","last_page":"319"},"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/T10653","display_name":"Robot Manipulation and Learning","score":0.9991999864578247,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.667702317237854},{"id":"https://openalex.org/keywords/inverse-kinematics","display_name":"Inverse kinematics","score":0.5340425372123718},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5328204035758972},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4967067837715149},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48685377836227417},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48663529753685},{"id":"https://openalex.org/keywords/kinematics","display_name":"Kinematics","score":0.45791545510292053},{"id":"https://openalex.org/keywords/cartesian-coordinate-system","display_name":"Cartesian coordinate system","score":0.4340290427207947},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40284720063209534},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38167569041252136},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14509785175323486}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.667702317237854},{"id":"https://openalex.org/C17816587","wikidata":"https://www.wikidata.org/wiki/Q1501872","display_name":"Inverse kinematics","level":3,"score":0.5340425372123718},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5328204035758972},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4967067837715149},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48685377836227417},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48663529753685},{"id":"https://openalex.org/C39920418","wikidata":"https://www.wikidata.org/wiki/Q11476","display_name":"Kinematics","level":2,"score":0.45791545510292053},{"id":"https://openalex.org/C16038011","wikidata":"https://www.wikidata.org/wiki/Q62912","display_name":"Cartesian coordinate system","level":2,"score":0.4340290427207947},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40284720063209534},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38167569041252136},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14509785175323486},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2017.2745542","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2017.2745542","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W134451811","https://openalex.org/W1564897360","https://openalex.org/W1904809838","https://openalex.org/W2010125957","https://openalex.org/W2022806724","https://openalex.org/W2032711963","https://openalex.org/W2055201760","https://openalex.org/W2141664020","https://openalex.org/W2166063021","https://openalex.org/W2189076595","https://openalex.org/W2564325388","https://openalex.org/W3104753760","https://openalex.org/W4240087212","https://openalex.org/W4399469378","https://openalex.org/W6605295560","https://openalex.org/W6639678157","https://openalex.org/W6684451488"],"related_works":["https://openalex.org/W2084494155","https://openalex.org/W2119963650","https://openalex.org/W2972304526","https://openalex.org/W2380210784","https://openalex.org/W2770397302","https://openalex.org/W998473388","https://openalex.org/W2391000165","https://openalex.org/W2375415610","https://openalex.org/W1996912299","https://openalex.org/W4235013387"],"abstract_inverted_index":{"Motion":[0],"planning":[1,41,131],"algorithms":[2],"that":[3],"rely":[4],"upon":[5],"the":[6,14,59,75,90,121],"randomly":[7],"exploring":[8],"random":[9],"tree":[10],"(RRT)":[11],"typically":[12],"require":[13],"user":[15],"to":[16,97],"choose":[17],"an":[18,36,62],"appropriate":[19],"stepsize;":[20],"this":[21,95],"is":[22,54],"generally":[23],"a":[24,49,70,81,99,109,115],"highly":[25],"problem-dependent":[26],"and":[27,32,93,114],"time-consuming":[28],"process":[29],"requiring":[30],"trial":[31],"error.":[33],"We":[34],"propose":[35],"adaptive":[37],"stepsize":[38,102],"RRT":[39,130],"path":[40],"algorithm":[42,126],"for":[43],"open-chain":[44],"robots":[45],"in":[46],"which":[47],"only":[48],"minimum":[50],"obstacle":[51],"size":[52],"parameter":[53],"required":[55],"as":[56,67,69],"input.":[57],"Exploiting":[58],"structure":[60],"of":[61,89,124],"open":[63,112],"chain's":[64],"forward":[65],"kinematics":[66],"well":[68],"standard":[71,128],"inequality":[72],"bound":[73,85,96],"on":[74],"operator-induced":[76],"matrix":[77],"norm,":[78],"we":[79],"derive":[80],"maximum":[82,100],"Cartesian":[83],"displacement":[84],"between":[86],"two":[87],"configurations":[88],"same":[91],"robot,":[92],"use":[94],"determine":[98],"allowable":[101],"at":[103],"each":[104],"iteration.":[105],"Numerical":[106],"experiments":[107],"involving":[108],"ten-DOF":[110],"planar":[111],"chain":[113],"seven-axis":[116],"industrial":[117],"robot":[118],"arm":[119],"demonstrate":[120],"practical":[122],"advantages":[123],"our":[125],"over":[127],"fixed-stepsize":[129],"algorithms.":[132]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-15T09:29:46.208133","created_date":"2025-10-10T00:00:00"}