{"id":"https://openalex.org/W4410087661","doi":"https://doi.org/10.1109/icara64554.2025.10977725","title":"On an Almost Closed-Form Fast Generation of Euclidean Shortest Path Trajectories in Cluttered Environments","display_name":"On an Almost Closed-Form Fast Generation of Euclidean Shortest Path Trajectories in Cluttered Environments","publication_year":2025,"publication_date":"2025-02-12","ids":{"openalex":"https://openalex.org/W4410087661","doi":"https://doi.org/10.1109/icara64554.2025.10977725"},"language":"en","primary_location":{"id":"doi:10.1109/icara64554.2025.10977725","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icara64554.2025.10977725","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 11th International Conference on Automation, Robotics, and Applications (ICARA)","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/A5093319495","display_name":"Ouassim Benhamouche","orcid":null},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Ouassim Benhamouche","raw_affiliation_strings":["Université Libre de Bruxelles,SAAS,Brussels,Belgium"],"affiliations":[{"raw_affiliation_string":"Université Libre de Bruxelles,SAAS,Brussels,Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029732093","display_name":"Zemerart Asani","orcid":"https://orcid.org/0000-0003-1485-2450"},"institutions":[{"id":"https://openalex.org/I13469542","display_name":"Vrije Universiteit Brussel","ror":"https://ror.org/006e5kg04","country_code":"BE","type":"education","lineage":["https://openalex.org/I13469542"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Zemerart Asani","raw_affiliation_strings":["Vrije Universiteit Brussel, imec,Brubotics,Brussels,Belgium"],"affiliations":[{"raw_affiliation_string":"Vrije Universiteit Brussel, imec,Brubotics,Brussels,Belgium","institution_ids":["https://openalex.org/I13469542"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052058261","display_name":"Andr\u00e9s Cotorruelo","orcid":"https://orcid.org/0000-0003-1464-6702"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Andr\u00e9s Cotorruelo","raw_affiliation_strings":["Université Libre de Bruxelles,SAAS,Brussels,Belgium"],"affiliations":[{"raw_affiliation_string":"Université Libre de Bruxelles,SAAS,Brussels,Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086577000","display_name":"Benjamin Wauthion","orcid":null},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Benjamin Wauthion","raw_affiliation_strings":["Université Libre de Bruxelles,SAAS,Brussels,Belgium"],"affiliations":[{"raw_affiliation_string":"Université Libre de Bruxelles,SAAS,Brussels,Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010914606","display_name":"Bram Vanderborght","orcid":"https://orcid.org/0000-0003-4881-9341"},"institutions":[{"id":"https://openalex.org/I13469542","display_name":"Vrije Universiteit Brussel","ror":"https://ror.org/006e5kg04","country_code":"BE","type":"education","lineage":["https://openalex.org/I13469542"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Bram Vanderborght","raw_affiliation_strings":["Vrije Universiteit Brussel, imec,Brubotics,Brussels,Belgium"],"affiliations":[{"raw_affiliation_string":"Vrije Universiteit Brussel, imec,Brubotics,Brussels,Belgium","institution_ids":["https://openalex.org/I13469542"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019019985","display_name":"Emanuele Garone","orcid":"https://orcid.org/0000-0003-0419-8483"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Emanuele Garone","raw_affiliation_strings":["Université Libre de Bruxelles,SAAS,Brussels,Belgium"],"affiliations":[{"raw_affiliation_string":"Université Libre de Bruxelles,SAAS,Brussels,Belgium","institution_ids":["https://openalex.org/I132053463"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5093319495"],"corresponding_institution_ids":["https://openalex.org/I132053463"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07548901,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"399","last_page":"403"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12250","display_name":"Experimental and Theoretical Physics Studies","score":0.9589999914169312,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12250","display_name":"Experimental and Theoretical Physics Studies","score":0.9589999914169312,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12677","display_name":"Sports Dynamics and Biomechanics","score":0.9355000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6194773316383362},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6192518472671509},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.6136908531188965},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.557817280292511},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5136482119560242},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5135650634765625},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4148620367050171},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.3462977409362793},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.30606526136398315},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22488602995872498},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09482258558273315},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07917585968971252}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6194773316383362},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6192518472671509},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.6136908531188965},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.557817280292511},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5136482119560242},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5135650634765625},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4148620367050171},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.3462977409362793},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.30606526136398315},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22488602995872498},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09482258558273315},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07917585968971252},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/icara64554.2025.10977725","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icara64554.2025.10977725","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 11th International Conference on Automation, Robotics, and Applications (ICARA)","raw_type":"proceedings-article"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/398118","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/398118","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"In: International Conference on Control and Automation (ICCA)","raw_type":"info:ulb-repo/semantics/openurl/proceeding"},{"id":"pmh:oai:vubissmart:VUBISSMART:2000:212779","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402573","display_name":"VUBIR (Vrije Universiteit Brussel)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I13469542","host_organization_name":"Vrije Universiteit Brussel","host_organization_lineage":["https://openalex.org/I13469542"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:vubissmart:VUBISSMART:2000:259651","is_oa":false,"landing_page_url":"https://biblio.vub.ac.be/vubir/on-an-almost-closedform-fast-generation-of-euclidean-shortest-path-trajectories-in-cluttered-environments(7aa0bb5d-6598-4299-a967-dea2fe318cdd).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306402573","display_name":"VUBIR (Vrije Universiteit Brussel)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I13469542","host_organization_name":"Vrije Universiteit Brussel","host_organization_lineage":["https://openalex.org/I13469542"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6406077314","display_name":null,"funder_award_id":"8672","funder_id":"https://openalex.org/F4320325905","funder_display_name":"Service Public de Wallonie"},{"id":"https://openalex.org/G730480899","display_name":null,"funder_award_id":"FWO1SHBX24N","funder_id":"https://openalex.org/F4320321730","funder_display_name":"Fonds Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321730","display_name":"Fonds Wetenschappelijk Onderzoek","ror":"https://ror.org/03qtxy027"},{"id":"https://openalex.org/F4320322852","display_name":"Innoviris","ror":"https://ror.org/04af9zr29"},{"id":"https://openalex.org/F4320325905","display_name":"Service Public de Wallonie","ror":"https://ror.org/0215gxf82"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W164834647","https://openalex.org/W786272118","https://openalex.org/W1513646957","https://openalex.org/W1559701472","https://openalex.org/W1978331593","https://openalex.org/W1986014106","https://openalex.org/W2032895458","https://openalex.org/W2109868275","https://openalex.org/W2755958591","https://openalex.org/W3013773102","https://openalex.org/W3035324306","https://openalex.org/W3044217012","https://openalex.org/W3105266548","https://openalex.org/W3216166348","https://openalex.org/W4242246215","https://openalex.org/W4386586170","https://openalex.org/W4386800532","https://openalex.org/W4391721446","https://openalex.org/W6776997480","https://openalex.org/W7072138150"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2018146256","https://openalex.org/W2347245430","https://openalex.org/W2112429204","https://openalex.org/W2562562750","https://openalex.org/W2377950158","https://openalex.org/W2156431668","https://openalex.org/W4200172719","https://openalex.org/W2198982833"],"abstract_inverted_index":{"This":[0,65,112],"paper":[1],"addresses":[2],"the":[3,7,18,32,37,41,50,54,60,63,67,82,87,103,109,120,125,145,148,156,162,166,170],"challenge":[4],"of":[5,20,40,62,86,169],"determining":[6],"shortest":[8,121],"path":[9],"in":[10],"a":[11,77,98,135],"domain":[12],"with":[13],"static":[14,78,110],"obstacles":[15,33],"by":[16],"leveraging":[17],"concepts":[19],"visibility":[21,24,83,127,141],"graphs":[22],"and":[23,56,90,96,105,150,172],"polygons.":[25],"The":[26],"core":[27],"idea":[28],"is":[29],"that,":[30],"since":[31],"are":[34,45,49],"considered":[35],"static,":[36],"only":[38],"parts":[39],"overall":[42,68],"graph":[43,69,128],"that":[44,52,80,91,101],"subject":[46],"to":[47,59,70,108,143,160],"change":[48],"edges":[51],"connect":[53],"initial":[55,104,149],"final":[57,106],"nodes":[58,174],"rest":[61],"graph.":[64],"allows":[66],"be":[71,93,130],"divided":[72],"into":[73,158],"two":[74],"sub-graphs:":[75],"(i)":[76],"sub-graph":[79,100],"captures":[81],"among":[84],"subsets":[85],"obstacle":[88],"vertices":[89],"can":[92,129],"computed":[94],"offline,":[95],"(ii)":[97],"dynamic":[99,167],"connects":[102],"points":[107],"sub-graph.":[111],"division":[113],"entails":[114],"fewer":[115],"online":[116],"computations":[117],"when":[118],"computing":[119],"path,":[122],"as":[123],"building":[124],"entire":[126],"time-consuming.":[131],"Additionally,":[132],"we":[133],"propose":[134],"purely":[136],"geometrical":[137],"approach":[138],"based":[139],"on":[140],"polygons":[142],"determine":[144],"connections":[146],"between":[147],"ending":[151,173],"nodes.":[152],"We":[153],"then":[154],"divide":[155],"environment":[157],"sub-regions":[159],"reduce":[161],"search":[163],"space,":[164],"making":[165],"linking":[168],"starting":[171],"faster.":[175]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}