{"id":"https://openalex.org/W4383066377","doi":"https://doi.org/10.1109/icra48891.2023.10161560","title":"Kinodynamic Rapidly-exploring Random Forest for Rearrangement-Based Nonprehensile Manipulation","display_name":"Kinodynamic Rapidly-exploring Random Forest for Rearrangement-Based Nonprehensile Manipulation","publication_year":2023,"publication_date":"2023-05-29","ids":{"openalex":"https://openalex.org/W4383066377","doi":"https://doi.org/10.1109/icra48891.2023.10161560"},"language":"en","primary_location":{"id":"doi:10.1109/icra48891.2023.10161560","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48891.2023.10161560","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Conference on Robotics and Automation (ICRA)","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/A5079959899","display_name":"Kejia Ren","orcid":"https://orcid.org/0000-0002-6970-2268"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kejia Ren","raw_affiliation_strings":["Rice University,Department of Computer Science,Houston,TX,USA,77005"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rice University,Department of Computer Science,Houston,TX,USA,77005","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026417037","display_name":"Podshara Chanrungmaneekul","orcid":null},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Podshara Chanrungmaneekul","raw_affiliation_strings":["Rice University,Department of Computer Science,Houston,TX,USA,77005"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rice University,Department of Computer Science,Houston,TX,USA,77005","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067205988","display_name":"Lydia E. Kavraki","orcid":"https://orcid.org/0000-0003-0699-8038"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lydia E. Kavraki","raw_affiliation_strings":["Rice University,Department of Computer Science,Houston,TX,USA,77005"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rice University,Department of Computer Science,Houston,TX,USA,77005","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011451275","display_name":"Kaiyu Hang","orcid":"https://orcid.org/0000-0003-4132-1217"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kaiyu Hang","raw_affiliation_strings":["Rice University,Department of Computer Science,Houston,TX,USA,77005"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rice University,Department of Computer Science,Houston,TX,USA,77005","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4491,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63000169,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"8127","last_page":"8133"},"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.9987999796867371,"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.9983999729156494,"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/interleaving","display_name":"Interleaving","score":0.7266213893890381},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6774590015411377},{"id":"https://openalex.org/keywords/linear-subspace","display_name":"Linear subspace","score":0.5530446767807007},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5041314363479614},{"id":"https://openalex.org/keywords/action","display_name":"Action (physics)","score":0.48830628395080566},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4770438075065613},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4631328880786896},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.44370871782302856},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4414082169532776},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3274444043636322},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2136087417602539},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1903354525566101},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.16579443216323853}],"concepts":[{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.7266213893890381},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6774590015411377},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.5530446767807007},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5041314363479614},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.48830628395080566},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4770438075065613},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4631328880786896},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.44370871782302856},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4414082169532776},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3274444043636322},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2136087417602539},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1903354525566101},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.16579443216323853},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra48891.2023.10161560","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48891.2023.10161560","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.4000000059604645,"id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G1356726022","display_name":null,"funder_award_id":"CMMI-2133110,2008720","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"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":31,"referenced_works":["https://openalex.org/W128414051","https://openalex.org/W1522963174","https://openalex.org/W1586146481","https://openalex.org/W1608892862","https://openalex.org/W1989021449","https://openalex.org/W1989604857","https://openalex.org/W2000359213","https://openalex.org/W2044995998","https://openalex.org/W2065786943","https://openalex.org/W2104186994","https://openalex.org/W2105248582","https://openalex.org/W2125188427","https://openalex.org/W2141664020","https://openalex.org/W2141753064","https://openalex.org/W2158782408","https://openalex.org/W2164062812","https://openalex.org/W2216759066","https://openalex.org/W2293949132","https://openalex.org/W2551182329","https://openalex.org/W2736647539","https://openalex.org/W2883221329","https://openalex.org/W2883654928","https://openalex.org/W2953431737","https://openalex.org/W2963566599","https://openalex.org/W2967171277","https://openalex.org/W2981168246","https://openalex.org/W3021544315","https://openalex.org/W4205825555","https://openalex.org/W4313048393","https://openalex.org/W6603146607","https://openalex.org/W6605245639"],"related_works":["https://openalex.org/W1655266410","https://openalex.org/W2389051085","https://openalex.org/W2330343234","https://openalex.org/W1901012776","https://openalex.org/W2463883322","https://openalex.org/W2229382548","https://openalex.org/W2391789612","https://openalex.org/W2389236462","https://openalex.org/W2814468324","https://openalex.org/W1614034078"],"abstract_inverted_index":{"Rearrangement-based":[0],"nonprehensile":[1],"manipulation":[2,110],"still":[3],"remains":[4],"as":[5,28,63],"a":[6,29,50],"challenging":[7],"problem":[8,13,31,60],"due":[9],"to":[10,55,64],"the":[11,16,69,106],"high-dimensional":[12],"space":[14],"and":[15,35,86,109],"complex":[17],"physical":[18],"uncertainties":[19],"it":[20],"entails.":[21],"We":[22,48],"formulate":[23],"this":[24],"class":[25],"of":[26,32,68],"problems":[27],"coupled":[30],"local":[33,78],"rearrangement":[34],"global":[36,66],"action":[37,87],"optimization":[38],"by":[39],"incorporating":[40],"free-space":[41],"transit":[42],"motions":[43],"between":[44,77],"constrained":[45],"rearranging":[46,79],"actions.":[47,80],"propose":[49],"forest-based":[51],"kinodynamic":[52],"planning":[53,85,107],"framework":[54,90,103],"concurrently":[56],"search":[57],"in":[58],"multiple":[59],"regions,":[61],"so":[62],"enable":[65],"exploration":[67],"most":[70],"task-relevant":[71],"subspaces,":[72],"while":[73,112],"facilitating":[74],"effective":[75],"switches":[76],"By":[81],"interleaving":[82],"dynamic":[83],"horizon":[84],"execution,":[88],"our":[89,102],"can":[91],"adaptively":[92],"handle":[93],"real-world":[94],"uncertainties.":[95,117],"With":[96],"extensive":[97],"experiments,":[98],"we":[99],"show":[100],"that":[101],"significantly":[104],"improves":[105],"efficiency":[108],"effectiveness":[111],"being":[113],"robust":[114],"against":[115],"various":[116]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}