{"id":"https://openalex.org/W4407390810","doi":"https://doi.org/10.1109/lra.2025.3540531","title":"Fast Shortest Path Polyline Smoothing With $G^{1}$ Continuity and Bounded Curvature","display_name":"Fast Shortest Path Polyline Smoothing With $G^{1}$ Continuity and Bounded Curvature","publication_year":2025,"publication_date":"2025-02-11","ids":{"openalex":"https://openalex.org/W4407390810","doi":"https://doi.org/10.1109/lra.2025.3540531"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2025.3540531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2025.3540531","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.1109/LRA.2025.3540531","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114369718","display_name":"Patrick Pastorelli","orcid":null},"institutions":[{"id":"https://openalex.org/I193223587","display_name":"University of Trento","ror":"https://ror.org/05trd4x28","country_code":"IT","type":"education","lineage":["https://openalex.org/I193223587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Patrick Pastorelli","raw_affiliation_strings":["Department of Information Engineering and Computer Science, University of Trento, Trento, Italy"],"raw_orcid":"https://orcid.org/0009-0002-9272-629X","affiliations":[{"raw_affiliation_string":"Department of Information Engineering and Computer Science, University of Trento, Trento, Italy","institution_ids":["https://openalex.org/I193223587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114369719","display_name":"Simone Dagnino","orcid":null},"institutions":[{"id":"https://openalex.org/I193223587","display_name":"University of Trento","ror":"https://ror.org/05trd4x28","country_code":"IT","type":"education","lineage":["https://openalex.org/I193223587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Simone Dagnino","raw_affiliation_strings":["Department of Information Engineering and Computer Science, University of Trento, Trento, Italy"],"raw_orcid":"https://orcid.org/0009-0001-5437-3377","affiliations":[{"raw_affiliation_string":"Department of Information Engineering and Computer Science, University of Trento, Trento, Italy","institution_ids":["https://openalex.org/I193223587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023072688","display_name":"Enrico Saccon","orcid":"https://orcid.org/0000-0002-2418-6618"},"institutions":[{"id":"https://openalex.org/I193223587","display_name":"University of Trento","ror":"https://ror.org/05trd4x28","country_code":"IT","type":"education","lineage":["https://openalex.org/I193223587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Enrico Saccon","raw_affiliation_strings":["Department of Information Engineering and Computer Science, University of Trento, Trento, Italy"],"raw_orcid":"https://orcid.org/0000-0002-2418-6618","affiliations":[{"raw_affiliation_string":"Department of Information Engineering and Computer Science, University of Trento, Trento, Italy","institution_ids":["https://openalex.org/I193223587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080554397","display_name":"Marco Frego","orcid":"https://orcid.org/0000-0003-2855-9052"},"institutions":[{"id":"https://openalex.org/I171543936","display_name":"Free University of Bozen-Bolzano","ror":"https://ror.org/012ajp527","country_code":"IT","type":"education","lineage":["https://openalex.org/I171543936"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Marco Frego","raw_affiliation_strings":["Faculty of Engineering, Free University of Bozen-Bolzano, Bolzano, Italy"],"raw_orcid":"https://orcid.org/0000-0003-2855-9052","affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Free University of Bozen-Bolzano, Bolzano, Italy","institution_ids":["https://openalex.org/I171543936"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006224560","display_name":"Luigi Palopoli","orcid":"https://orcid.org/0000-0001-8813-8685"},"institutions":[{"id":"https://openalex.org/I193223587","display_name":"University of Trento","ror":"https://ror.org/05trd4x28","country_code":"IT","type":"education","lineage":["https://openalex.org/I193223587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luigi Palopoli","raw_affiliation_strings":["Department of Information Engineering and Computer Science, University of Trento, Trento, Italy"],"raw_orcid":"https://orcid.org/0000-0001-8813-8685","affiliations":[{"raw_affiliation_string":"Department of Information Engineering and Computer Science, University of Trento, Trento, Italy","institution_ids":["https://openalex.org/I193223587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":3.1026,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.89895752,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"10","issue":"4","first_page":"3182","last_page":"3189"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9896000027656555,"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/T11439","display_name":"Video Analysis and Summarization","score":0.982699990272522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.6056614518165588},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5962483286857605},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5910553932189941},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5480102896690369},{"id":"https://openalex.org/keywords/curvature","display_name":"Curvature","score":0.541078507900238},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49322837591171265},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32141613960266113},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.2988407611846924},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2594064176082611},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.25507211685180664},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10711327195167542},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07641029357910156},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.04421994090080261}],"concepts":[{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.6056614518165588},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5962483286857605},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5910553932189941},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5480102896690369},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.541078507900238},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49322837591171265},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32141613960266113},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.2988407611846924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2594064176082611},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.25507211685180664},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10711327195167542},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07641029357910156},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.04421994090080261}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lra.2025.3540531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2025.3540531","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},{"id":"pmh:oai:unibz.it:11338608680001241","is_oa":true,"landing_page_url":"https://doi.org/10.1109/LRA.2025.3540531","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"Open Research (University of Surrey)","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:unibz.it:11338608680001241","is_oa":true,"landing_page_url":"https://doi.org/10.1109/LRA.2025.3540531","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"Open Research (University of Surrey)","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1963641530","https://openalex.org/W1971086298","https://openalex.org/W1992194971","https://openalex.org/W2049719766","https://openalex.org/W2087725120","https://openalex.org/W2103498863","https://openalex.org/W2110762409","https://openalex.org/W2134638269","https://openalex.org/W2135125135","https://openalex.org/W2313274380","https://openalex.org/W2421391607","https://openalex.org/W2528946227","https://openalex.org/W2559356576","https://openalex.org/W2766091845","https://openalex.org/W2867380411","https://openalex.org/W2909069242","https://openalex.org/W2914986345","https://openalex.org/W2943157449","https://openalex.org/W2962977210","https://openalex.org/W2964219267","https://openalex.org/W2971648783","https://openalex.org/W2972577109","https://openalex.org/W2980113311","https://openalex.org/W2993952449","https://openalex.org/W3006050411","https://openalex.org/W3041104588","https://openalex.org/W3199958827","https://openalex.org/W3201393711","https://openalex.org/W4377971264","https://openalex.org/W4388561790","https://openalex.org/W4389982077","https://openalex.org/W4400648248","https://openalex.org/W4401511192"],"related_works":["https://openalex.org/W1978572805","https://openalex.org/W2383807498","https://openalex.org/W1997992934","https://openalex.org/W1987225439","https://openalex.org/W4238188170","https://openalex.org/W2125114371","https://openalex.org/W2019977573","https://openalex.org/W2149980199","https://openalex.org/W3125766170","https://openalex.org/W2376037591"],"abstract_inverted_index":{"In":[0,33],"this":[1],"work,":[2],"we":[3,36],"propose":[4],"the":[5,34,39,62,78],"Dubins":[6],"Path":[7],"Smoothing":[8],"(DPS)":[9],"algorithm,":[10],"a":[11],"novel":[12],"and":[13,48,64,74],"efficient":[14],"method":[15],"for":[16],"smoothing":[17],"polylines":[18],"in":[19,69],"motion":[20,26],"planning":[21,27],"tasks.":[22],"DPS":[23],"applies":[24],"to":[25],"of":[28,71,75,77],"vehicles":[29],"with":[30,61],"bounded":[31],"curvature.":[32],"letter,":[35],"show":[37,65],"that":[38],"generated":[40],"path:":[41],"1)":[42],"has":[43],"minimal":[44],"length,":[45],"2)":[46],"is$G^{1}$continuous,":[47],"3)":[49],"is":[50],"collision-free":[51],"by":[52],"construction,":[53],"under":[54],"mild":[55],"hypotheses.":[56],"We":[57],"compare":[58],"our":[59],"solution":[60],"state-of-the-art":[63],"its":[66],"convenience":[67],"both":[68],"terms":[70],"computation":[72],"time":[73],"length":[76],"compute":[79],"path.":[80]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}
