{"id":"https://openalex.org/W7135082344","doi":"https://doi.org/10.1109/clei67442.2025.11420592","title":"Local Path Planning for Self-driving Cars in Unknown Environments Using an Ensemble-Based Approach","display_name":"Local Path Planning for Self-driving Cars in Unknown Environments Using an Ensemble-Based Approach","publication_year":2025,"publication_date":"2025-10-27","ids":{"openalex":"https://openalex.org/W7135082344","doi":"https://doi.org/10.1109/clei67442.2025.11420592"},"language":null,"primary_location":{"id":"doi:10.1109/clei67442.2025.11420592","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clei67442.2025.11420592","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 LI Latin American Computer Conference (CLEI)","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/A5128867893","display_name":"Cristiano S. Oliveira","orcid":null},"institutions":[{"id":"https://openalex.org/I4104125","display_name":"Universidade Federal de Santa Catarina","ror":"https://ror.org/041akq887","country_code":"BR","type":"education","lineage":["https://openalex.org/I4104125"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Cristiano S. Oliveira","raw_affiliation_strings":["Federal University of Santa Catarina,Department of Computer Sciences,Florianópolis,Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Santa Catarina,Department of Computer Sciences,Florianópolis,Brazil","institution_ids":["https://openalex.org/I4104125"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031099971","display_name":"Rafael S. Toledo","orcid":null},"institutions":[{"id":"https://openalex.org/I4104125","display_name":"Universidade Federal de Santa Catarina","ror":"https://ror.org/041akq887","country_code":"BR","type":"education","lineage":["https://openalex.org/I4104125"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Rafael Toledo","raw_affiliation_strings":["Federal University of Santa Catarina,Department of Computer Sciences,Florianópolis,Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Santa Catarina,Department of Computer Sciences,Florianópolis,Brazil","institution_ids":["https://openalex.org/I4104125"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004153371","display_name":"Aldo von Wangenheim","orcid":"https://orcid.org/0000-0003-4532-1417"},"institutions":[{"id":"https://openalex.org/I4104125","display_name":"Universidade Federal de Santa Catarina","ror":"https://ror.org/041akq887","country_code":"BR","type":"education","lineage":["https://openalex.org/I4104125"]},{"id":"https://openalex.org/I47403697","display_name":"Instituto Federal de Educa\u00e7\u00e3o, Ci\u00eancia e Tecnologia de Santa Catarina","ror":"https://ror.org/00fcpmw49","country_code":"BR","type":"education","lineage":["https://openalex.org/I47403697"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Aldo von Wangenheim","raw_affiliation_strings":["Federal University of Santa Catarina,National Institute for Digital Convergence (INCoD),Florianópolis,Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Santa Catarina,National Institute for Digital Convergence (INCoD),Florianópolis,Brazil","institution_ids":["https://openalex.org/I4104125","https://openalex.org/I47403697"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.67364669,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9872000217437744,"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.9872000217437744,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.0038999998942017555,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.002199999988079071,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7864000201225281},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.682200014591217},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6189000010490417},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.6111999750137329},{"id":"https://openalex.org/keywords/local-planning","display_name":"Local planning","score":0.5044000148773193},{"id":"https://openalex.org/keywords/nonholonomic-system","display_name":"Nonholonomic system","score":0.4287000000476837},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.42179998755455017}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7864000201225281},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.682200014591217},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6531999707221985},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6189000010490417},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.6111999750137329},{"id":"https://openalex.org/C2988400853","wikidata":"https://www.wikidata.org/wiki/Q69883","display_name":"Local planning","level":2,"score":0.5044000148773193},{"id":"https://openalex.org/C138632511","wikidata":"https://www.wikidata.org/wiki/Q2478109","display_name":"Nonholonomic system","level":4,"score":0.4287000000476837},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.42179998755455017},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40869998931884766},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.39500001072883606},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3538999855518341},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.31619998812675476},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3021000027656555},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.30070000886917114},{"id":"https://openalex.org/C79487989","wikidata":"https://www.wikidata.org/wiki/Q934680","display_name":"Vehicle dynamics","level":2,"score":0.2696000039577484},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.2651999890804291},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2637999951839447}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/clei67442.2025.11420592","is_oa":false,"landing_page_url":"https://doi.org/10.1109/clei67442.2025.11420592","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 LI Latin American Computer Conference (CLEI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6895117163658142,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1497247761","https://openalex.org/W1974733785","https://openalex.org/W2005354226","https://openalex.org/W2124543852","https://openalex.org/W2124770562","https://openalex.org/W2134584431","https://openalex.org/W2152365219","https://openalex.org/W2306644740","https://openalex.org/W2338007649","https://openalex.org/W2483158495","https://openalex.org/W2616635592","https://openalex.org/W2786695844","https://openalex.org/W3098336417","https://openalex.org/W3189223768","https://openalex.org/W4388757371","https://openalex.org/W4400946846","https://openalex.org/W4408468214"],"related_works":[],"abstract_inverted_index":{"Planning":[0],"local":[1,51,78,98,107,130,148],"trajectories":[2],"for":[3,83,147],"nonholonomic":[4],"vehicles":[5],"in":[6,21,57,112],"real-time":[7],"that":[8,93,154],"can":[9],"converge,":[10],"be":[11,14],"feasible,":[12],"and":[13,59,88,138],"smooth":[15],"simultaneously":[16],"is":[17],"a":[18,37,159],"key":[19],"challenge":[20,33],"autonomous":[22],"ground":[23],"vehicle":[24],"navigation.":[25],"Many":[26],"techniques":[27],"have":[28],"attempted":[29],"to":[30,55,81,123,125,167],"overcome":[31],"this":[32],"by":[34,128],"partially":[35],"solving":[36],"subset":[38],"of":[39,73,77,97,104,114,151],"these":[40],"goals.":[41,116],"We":[42],"propose":[43],"an":[44,144],"approach":[45],"based":[46,65],"on":[47,66],"first":[48],"allowing":[49],"multiple":[50],"path":[52,89,108],"planning":[53,79,162],"algorithms":[54],"run":[56],"parallel":[58,95],"then":[60],"choosing":[61],"the":[62,71,84,94,120,165],"right":[63],"one":[64],"selection":[67],"criteria.":[68],"This":[69],"allows":[70,119],"use":[72],"different":[74,126],"specialized":[75],"types":[76],"solutions":[80],"account":[82],"execution":[85],"time,":[86],"convergence,":[87],"smoothness.":[90],"Simulations":[91],"show":[92],"ensemble":[96],"planners":[99,109],"performs":[100],"better":[101],"than":[102],"each":[103],"its":[105],"composing":[106],"running":[110],"independently":[111],"terms":[113],"those":[115],"Our":[117],"solution":[118],"vehicle\u2019s":[121],"behavior":[122],"adapt":[124],"scenarios":[127],"automatic":[129],"planner":[131],"selection,":[132],"which":[133],"maintains":[134],"low":[135],"system":[136],"complexity":[137],"increases":[139],"adaptability.":[140],"Moreover,":[141],"we":[142],"present":[143],"efficient":[145],"algorithm":[146],"goal":[149],"approximation":[150],"global":[152],"goals":[153],"integrates":[155],"sub-planning":[156],"tasks":[157],"as":[158],"single":[160],"long-reach":[161],"response,":[163],"enabling":[164],"Ensemble":[166],"navigate":[168],"unknown":[169],"unstructured":[170],"scenarios.":[171]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-13T00:00:00"}