{"id":"https://openalex.org/W4289828937","doi":"https://doi.org/10.1109/med54222.2022.9837205","title":"Shortest path type classification for real-time three-points Dubins problems","display_name":"Shortest path type classification for real-time three-points Dubins problems","publication_year":2022,"publication_date":"2022-06-28","ids":{"openalex":"https://openalex.org/W4289828937","doi":"https://doi.org/10.1109/med54222.2022.9837205"},"language":"en","primary_location":{"id":"doi:10.1109/med54222.2022.9837205","is_oa":false,"landing_page_url":"https://doi.org/10.1109/med54222.2022.9837205","pdf_url":null,"source":{"id":"https://openalex.org/S4363608151","display_name":"2022 30th Mediterranean Conference on Control and Automation (MED)","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 30th Mediterranean Conference on Control and Automation (MED)","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/A5011869041","display_name":"Daniela De Palma","orcid":"https://orcid.org/0000-0001-9070-0702"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Daniela De Palma","raw_affiliation_strings":["Università del Salento (ISME node),Dipartimento di Ingegneria dell’Innovazione,Lecce,Italy,73100"],"affiliations":[{"raw_affiliation_string":"Università del Salento (ISME node),Dipartimento di Ingegneria dell’Innovazione,Lecce,Italy,73100","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007835571","display_name":"Gianfranco Parlangeli","orcid":"https://orcid.org/0000-0003-4991-3698"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gianfranco Parlangeli","raw_affiliation_strings":["Università del Salento (ISME node),Dipartimento di Ingegneria dell’Innovazione,Lecce,Italy,73100"],"affiliations":[{"raw_affiliation_string":"Università del Salento (ISME node),Dipartimento di Ingegneria dell’Innovazione,Lecce,Italy,73100","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011869041"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1799,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.49615001,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"520","last_page":"525"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9847000241279602,"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.9847000241279602,"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/T13601","display_name":"Urban Transport Systems Analysis","score":0.9484999775886536,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/T11435","display_name":"Polynomial and algebraic computation","score":0.9398999810218811,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/cartesian-coordinate-system","display_name":"Cartesian coordinate system","score":0.7211540937423706},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5928981900215149},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5869906544685364},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5782918930053711},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5714176893234253},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5651710033416748},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.5589432716369629},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5542002320289612},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49078163504600525},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.4397844672203064},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43696317076683044},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4247405230998993},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36529678106307983},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2298358976840973},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.18344876170158386},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15203642845153809},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1213630735874176},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0891447365283966}],"concepts":[{"id":"https://openalex.org/C16038011","wikidata":"https://www.wikidata.org/wiki/Q62912","display_name":"Cartesian coordinate system","level":2,"score":0.7211540937423706},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5928981900215149},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5869906544685364},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5782918930053711},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5714176893234253},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5651710033416748},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.5589432716369629},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5542002320289612},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49078163504600525},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.4397844672203064},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43696317076683044},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4247405230998993},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36529678106307983},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2298358976840973},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.18344876170158386},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15203642845153809},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1213630735874176},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0891447365283966},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/med54222.2022.9837205","is_oa":false,"landing_page_url":"https://doi.org/10.1109/med54222.2022.9837205","pdf_url":null,"source":{"id":"https://openalex.org/S4363608151","display_name":"2022 30th Mediterranean Conference on Control and Automation (MED)","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 30th Mediterranean Conference on Control and Automation (MED)","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.7400000095367432}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2352472571","https://openalex.org/W1020620338","https://openalex.org/W2039329986","https://openalex.org/W1996592923","https://openalex.org/W2486990811","https://openalex.org/W2355290017","https://openalex.org/W1036286070","https://openalex.org/W4200286425","https://openalex.org/W165394208","https://openalex.org/W98761352"],"abstract_inverted_index":{"This":[0,35],"paper":[1],"addresses":[2],"the":[3,16,23,32,40,44,49,71,74],"three":[4,53],"point":[5,25],"Dubins":[6,55],"problem":[7],"using":[8,27],"a":[9,28],"classification":[10],"approach,":[11],"namely":[12],"by":[13],"only":[14],"evaluating":[15],"relative":[17],"initial":[18],"and":[19,59],"final":[20],"configurations":[21],"with":[22],"via":[24],"position":[26],"suitable":[29,61],"partition":[30],"of":[31,73],"Cartesian":[33],"plane.":[34],"allows":[36],"to":[37,69],"promptly":[38],"choose":[39],"path":[41,50],"type":[42],"among":[43],"eight":[45],"possible":[46],"thus":[47],"making":[48],"planning":[51],"for":[52,62],"points":[54],"problems":[56],"much":[57],"faster":[58],"more":[60],"real-time":[63],"applications.":[64],"Some":[65],"examples":[66],"are":[67],"provided":[68],"show":[70],"efficiency":[72],"proposed":[75],"strategy.":[76]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}