{"id":"https://openalex.org/W4314947453","doi":"https://doi.org/10.1109/cdc51059.2022.9992444","title":"A Rapidly-Exploring Random Trees Motion Planning Algorithm for Hybrid Dynamical Systems","display_name":"A Rapidly-Exploring Random Trees Motion Planning Algorithm for Hybrid Dynamical Systems","publication_year":2022,"publication_date":"2022-12-06","ids":{"openalex":"https://openalex.org/W4314947453","doi":"https://doi.org/10.1109/cdc51059.2022.9992444"},"language":"en","primary_location":{"id":"doi:10.1109/cdc51059.2022.9992444","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc51059.2022.9992444","pdf_url":null,"source":{"id":"https://openalex.org/S4363607710","display_name":"2022 IEEE 61st Conference on Decision and Control (CDC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 61st Conference on Decision and Control (CDC)","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/A5100332725","display_name":"Nan Wang","orcid":"https://orcid.org/0000-0001-9504-5591"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nan Wang","raw_affiliation_strings":["University of California,Department of Electrical and Computer Engineering,Santa Cruz,CA,USA,95064"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,Department of Electrical and Computer Engineering,Santa Cruz,CA,USA,95064","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028224738","display_name":"Ricardo G. Sanfelice","orcid":"https://orcid.org/0000-0002-6671-5362"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ricardo G. Sanfelice","raw_affiliation_strings":["University of California,Department of Electrical and Computer Engineering,Santa Cruz,CA,USA,95064"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,Department of Electrical and Computer Engineering,Santa Cruz,CA,USA,95064","institution_ids":["https://openalex.org/I185103710"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I185103710"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2626","last_page":"2631"},"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/T10879","display_name":"Robotic Locomotion and Control","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9940999746322632,"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/concatenation","display_name":"Concatenation (mathematics)","score":0.7482847571372986},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6361343860626221},{"id":"https://openalex.org/keywords/generality","display_name":"Generality","score":0.6239673495292664},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.547978401184082},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5310630798339844},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5218062400817871},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.5200821757316589},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4826543927192688},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.4706760346889496},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.45640361309051514},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45571398735046387},{"id":"https://openalex.org/keywords/jump","display_name":"Jump","score":0.45447880029678345},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4011646509170532},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.35478317737579346},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2666272521018982}],"concepts":[{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.7482847571372986},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6361343860626221},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.6239673495292664},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.547978401184082},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5310630798339844},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5218062400817871},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.5200821757316589},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4826543927192688},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.4706760346889496},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.45640361309051514},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45571398735046387},{"id":"https://openalex.org/C2780695682","wikidata":"https://www.wikidata.org/wiki/Q4005959","display_name":"Jump","level":2,"score":0.45447880029678345},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4011646509170532},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.35478317737579346},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2666272521018982},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","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/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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc51059.2022.9992444","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc51059.2022.9992444","pdf_url":null,"source":{"id":"https://openalex.org/S4363607710","display_name":"2022 IEEE 61st Conference on Decision and Control (CDC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 61st Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.5600000023841858}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W198732646","https://openalex.org/W1160995053","https://openalex.org/W1424654272","https://openalex.org/W1486932855","https://openalex.org/W1856045556","https://openalex.org/W2000359213","https://openalex.org/W2104332709","https://openalex.org/W2137547873","https://openalex.org/W2886644421","https://openalex.org/W2889786920","https://openalex.org/W4210450858","https://openalex.org/W6605295560","https://openalex.org/W6608150121","https://openalex.org/W7052692983"],"related_works":["https://openalex.org/W1991478428","https://openalex.org/W1987694097","https://openalex.org/W3158818664","https://openalex.org/W2797949337","https://openalex.org/W2863424594","https://openalex.org/W2372633663","https://openalex.org/W4388720133","https://openalex.org/W2564325388","https://openalex.org/W2108906364","https://openalex.org/W2371294653"],"abstract_inverted_index":{"This":[0,90],"paper":[1],"proposes":[2],"a":[3,28,51,76,106,153],"rapidly-exploring":[4],"random":[5],"trees":[6],"(RRT)":[7],"algorithm":[8,88,149],"to":[9,74,152,158],"solve":[10],"the":[11,21,33,70,82,87,98,101,109,116,127,136,139,142,145],"motion":[12,77,102,122],"planning":[13],"problem":[14],"for":[15],"hybrid":[16,59],"systems.":[17,120],"At":[18],"each":[19],"iteration,":[20],"proposed":[22,148],"algorithm,":[23],"called":[24],"HyRRT,":[25],"randomly":[26,44],"picks":[27],"state":[29],"sample":[30],"and":[31,138,162],"extends":[32],"search":[34],"tree":[35],"by":[36],"flow":[37,137],"or":[38],"jump,":[39],"which":[40,104],"is":[41,66,92,124,150],"also":[42],"chosen":[43],"when":[45],"both":[46],"regimes":[47],"are":[48],"possible.":[49],"Through":[50],"definition":[52],"of":[53,55,72,84,86,108,118,129,144],"concatenation":[54],"functions":[56],"defined":[57],"on":[58,97],"time":[60],"domains,":[61],"we":[62],"show":[63],"that":[64],"HyRRT":[65],"probabilistically":[67],"complete,":[68],"namely,":[69],"probability":[71],"failing":[73],"find":[75],"plan":[78,123],"approaches":[79],"zero":[80],"as":[81,157],"number":[83],"iterations":[85],"increases.":[89],"property":[91],"guaranteed":[93],"under":[94],"mild":[95],"conditions":[96],"data":[99],"defining":[100],"plan,":[103],"include":[105],"relaxation":[107],"usual":[110],"positive":[111],"clearance":[112],"assumption":[113],"imposed":[114],"in":[115],"literature":[117],"classical":[119],"The":[121,147],"computed":[125],"through":[126],"solution":[128],"two":[130],"optimization":[131],"problems,":[132],"one":[133],"associated":[134],"with":[135,141],"other":[140],"jumps":[143],"system.":[146],"applied":[151],"walking":[154],"robot":[155],"so":[156],"highlight":[159],"its":[160],"generality":[161],"computational":[163],"features.":[164]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
