{"id":"https://openalex.org/W2152702644","doi":"https://doi.org/10.1109/tro.2008.2011421","title":"Shortest Paths to Obstacles for a Polygonal Dubins Car","display_name":"Shortest Paths to Obstacles for a Polygonal Dubins Car","publication_year":2009,"publication_date":"2009-02-09","ids":{"openalex":"https://openalex.org/W2152702644","doi":"https://doi.org/10.1109/tro.2008.2011421","mag":"2152702644"},"language":"en","primary_location":{"id":"doi:10.1109/tro.2008.2011421","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2008.2011421","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1546-1904","1941-0468"],"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 Transactions on Robotics","raw_type":"journal-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/A5067595490","display_name":"Paolo Robuffo Giordano","orcid":"https://orcid.org/0000-0001-6919-7751"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"P.R. Giordano","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma La Sapienza, Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma La Sapienza, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040398924","display_name":"Marilena Vendittelli","orcid":"https://orcid.org/0000-0002-5348-0525"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"M. Vendittelli","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma La Sapienza, Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma La Sapienza, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":1.9398,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.88320036,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"25","issue":"5","first_page":"1184","last_page":"1191"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9973999857902527,"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"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9789000153541565,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/workspace","display_name":"Workspace","score":0.7663655281066895},{"id":"https://openalex.org/keywords/nonholonomic-system","display_name":"Nonholonomic system","score":0.659380316734314},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.514065146446228},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4943101406097412},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.48736506700515747},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4692269265651703},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.45437946915626526},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44906488060951233},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.44304004311561584},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43001341819763184},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4277561902999878},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.42367130517959595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4099474847316742},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.3476502299308777},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22401398420333862},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.096872478723526},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07737001776695251}],"concepts":[{"id":"https://openalex.org/C58581272","wikidata":"https://www.wikidata.org/wiki/Q12741163","display_name":"Workspace","level":3,"score":0.7663655281066895},{"id":"https://openalex.org/C138632511","wikidata":"https://www.wikidata.org/wiki/Q2478109","display_name":"Nonholonomic system","level":4,"score":0.659380316734314},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.514065146446228},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4943101406097412},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.48736506700515747},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4692269265651703},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.45437946915626526},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44906488060951233},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.44304004311561584},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43001341819763184},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4277561902999878},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.42367130517959595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4099474847316742},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.3476502299308777},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22401398420333862},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.096872478723526},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07737001776695251},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tro.2008.2011421","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2008.2011421","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1546-1904","1941-0468"],"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 Transactions on Robotics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.421.1170","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.421.1170","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.irisa.fr/lagadic/pdf/2009_tro_paolo.pdf","raw_type":"text"},{"id":"pmh:oai:iris.uniroma1.it:11573/127870","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/127870","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7200000286102295}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W50548338","https://openalex.org/W578177376","https://openalex.org/W1424654272","https://openalex.org/W1587799944","https://openalex.org/W2089065885","https://openalex.org/W2125041002","https://openalex.org/W2125318536","https://openalex.org/W2131339983","https://openalex.org/W2144735061","https://openalex.org/W2160536087","https://openalex.org/W2166034910","https://openalex.org/W2172193895","https://openalex.org/W2216368278","https://openalex.org/W2313274380","https://openalex.org/W2334591577","https://openalex.org/W2611243847","https://openalex.org/W3206777520","https://openalex.org/W4249823714"],"related_works":["https://openalex.org/W2169581819","https://openalex.org/W2360989720","https://openalex.org/W2118575563","https://openalex.org/W2125795836","https://openalex.org/W1547718683","https://openalex.org/W1888884527","https://openalex.org/W2542922942","https://openalex.org/W3201393711","https://openalex.org/W2154154151","https://openalex.org/W1934130465"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,54],"characterize":[4],"the":[5,15,22,27,45,48,58,69,74,78,86,89,94],"time-optimal":[6],"trajectories":[7,32],"leading":[8],"a":[9,34,62],"Dubins":[10,28],"car":[11,29],"in":[12,17,47],"collision":[13],"with":[14],"obstacles":[16,46,87],"its":[18],"workspace.":[19],"Due":[20],"to":[21,99],"constant":[23],"velocity":[24],"constraint":[25],"characterizing":[26],"model,":[30],"these":[31,52],"form":[33],"sufficient":[35],"set":[36],"of":[37,77],"shortest":[38],"paths":[39],"between":[40],"any":[41],"robot":[42,90],"configuration":[43],"and":[44,56,72,88],"environment.":[49],"Based":[50],"on":[51],"paths,":[53],"define":[55],"give":[57],"algorithm":[59],"for":[60],"computing":[61],"distance":[63],"function":[64],"that":[65,85],"takes":[66],"into":[67],"account":[68],"nonholonomic":[70],"constraints":[71],"captures":[73],"nonsymmetric":[75],"nature":[76],"system.":[79],"The":[80],"developments":[81],"presented":[82],"here":[83],"assume":[84],"are":[91],"polygons":[92],"although":[93],"methodology":[95],"can":[96],"be":[97],"applied":[98],"different":[100],"shapes.":[101]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}