{"id":"https://openalex.org/W3206936826","doi":"https://doi.org/10.1109/icra48506.2021.9560836","title":"Asymptotically Optimal Kinodynamic Planning Using Bundles of Edges","display_name":"Asymptotically Optimal Kinodynamic Planning Using Bundles of Edges","publication_year":2021,"publication_date":"2021-05-30","ids":{"openalex":"https://openalex.org/W3206936826","doi":"https://doi.org/10.1109/icra48506.2021.9560836","mag":"3206936826"},"language":"en","primary_location":{"id":"doi:10.1109/icra48506.2021.9560836","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48506.2021.9560836","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5076976011","display_name":"Rahul Shome","orcid":"https://orcid.org/0000-0002-1689-9220"},"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":"Rahul Shome","raw_affiliation_strings":["Dept. of Computer Science, Rice University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Rice University","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"last","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":["Dept. of Computer Science, Rice University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Rice University","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74775410"],"apc_list":null,"apc_paid":null,"fwci":1.8141,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.90907058,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"9988","last_page":"9994"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/motion-planning","display_name":"Motion planning","score":0.742035984992981},{"id":"https://openalex.org/keywords/configuration-space","display_name":"Configuration space","score":0.5322840809822083},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5101814270019531},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5005836486816406},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.42827779054641724},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.41092804074287415},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4093686044216156},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20125845074653625},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.13060003519058228}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.742035984992981},{"id":"https://openalex.org/C90738871","wikidata":"https://www.wikidata.org/wiki/Q41642869","display_name":"Configuration space","level":2,"score":0.5322840809822083},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5101814270019531},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5005836486816406},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.42827779054641724},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.41092804074287415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4093686044216156},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20125845074653625},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.13060003519058228},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra48506.2021.9560836","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra48506.2021.9560836","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.75,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1502517891","https://openalex.org/W1509540129","https://openalex.org/W1742473997","https://openalex.org/W1864112212","https://openalex.org/W1971086298","https://openalex.org/W2000194319","https://openalex.org/W2000359213","https://openalex.org/W2128990851","https://openalex.org/W2132990760","https://openalex.org/W2136323427","https://openalex.org/W2166077797","https://openalex.org/W2171266831","https://openalex.org/W2399501438","https://openalex.org/W2751681639","https://openalex.org/W2889786920","https://openalex.org/W2910893906","https://openalex.org/W2912551019","https://openalex.org/W2987233852","https://openalex.org/W3089866190","https://openalex.org/W3106159194","https://openalex.org/W3139860299","https://openalex.org/W6713241665"],"related_works":["https://openalex.org/W2005695917","https://openalex.org/W2333571655","https://openalex.org/W2104320275","https://openalex.org/W3004930912","https://openalex.org/W2111158727","https://openalex.org/W1510039162","https://openalex.org/W2120794627","https://openalex.org/W2112736381","https://openalex.org/W2106317420","https://openalex.org/W4211055164"],"abstract_inverted_index":{"Using":[0],"sampling":[1,252],"to":[2,52,73,81,92,143,204,226,239,257],"estimate":[3],"the":[4,12,30,47,58,88,102,145,149,158,161,166,182,219,222],"connectivity":[5,159],"of":[6,49,90,104,137,160,181,221,251],"high-dimensional":[7],"configuration":[8],"spaces":[9],"has":[10,108],"been":[11],"theoretical":[13],"underpinning":[14],"for":[15,83,133],"effective":[16],"sampling-based":[17],"motion":[18,65,93,155],"planners.":[19],"Typical":[20],"strategies":[21],"either":[22],"build":[23],"a":[24,27,39,70,130,154,172,178,259],"roadmap,":[25],"or":[26],"tree":[28,175,187],"as":[29,46],"underlying":[31],"search":[32,112,174],"structure":[33],"that":[34,110,193],"connects":[35],"sampled":[36,142],"configurations,":[37],"with":[38,96,244],"focus":[40],"on":[41,115],"guaranteeing":[42],"completeness":[43],"and":[44,60,86,128,212,241],"optimality":[45],"number":[48],"samples":[50],"tends":[51],"infinity.":[53],"Roadmap-based":[54],"planners":[55,107],"allow":[56],"preprocessing":[57],"space,":[59],"can":[61,140,168],"solve":[62],"multiple":[63],"kinematic":[64],"planning":[66,94,156],"problems,":[67],"but":[68],"need":[69],"steering":[71,77],"function":[72],"connect":[74],"pairwise-states.":[75],"Such":[76],"functions":[78],"are":[79,118],"difficult":[80],"define":[82],"kinodynamic":[84,134,138,229,253],"systems,":[85],"limit":[87],"applicability":[89],"roadmaps":[91],"problems":[95],"dynamical":[97],"systems.":[98],"Recent":[99],"advances":[100],"in":[101,210],"analysis":[103],"single-query":[105],"tree-based":[106],"shown":[109],"forward":[111,173],"trees":[113],"based":[114],"random":[116],"propagations":[117],"asymptotically":[119],"optimal.":[120],"The":[121,189,249],"current":[122],"work":[123,190],"leverages":[124],"these":[125],"recent":[126],"results":[127],"proposes":[129],"multi-query":[131],"framework":[132],"planning.":[135],"Bundles":[136],"edges":[139,254],"be":[141,169,258],"cover":[144],"state":[146,162],"space":[147,163],"before":[148],"query":[150],"arrives.":[151],"Then,":[152],"given":[153],"query,":[157],"reachable":[164],"from":[165,171,185],"start":[167],"recovered":[170],"reasoning":[176],"about":[177],"local":[179],"neighborhood":[180,198],"edge":[183,224],"bundle":[184],"each":[186],"node.":[188],"demonstrates":[191],"theoretically":[192],"considering":[194],"any":[195],"constant":[196],"radial":[197],"during":[199],"this":[200],"process":[201],"is":[202,255],"sufficient":[203],"guarantee":[205],"asymptotic":[206],"optimality.":[207],"Experimental":[208],"validation":[209],"five":[211],"twelve":[213],"dimensional":[214],"simulated":[215],"systems":[216],"also":[217],"highlights":[218],"ability":[220],"proposed":[223],"bundles":[225],"express":[227],"high-quality":[228],"solutions.":[230],"Our":[231],"approach":[232],"consistently":[233],"finds":[234],"higher":[235],"quality":[236],"solutions":[237],"compared":[238],"SST,":[240],"RRT,":[242],"often":[243],"faster":[245],"initial":[246],"solution":[247],"times.":[248],"strategy":[250],"demonstrated":[256],"promising":[260],"new":[261],"paradigm.":[262]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}