{"id":"https://openalex.org/W1970071808","doi":"https://doi.org/10.1109/tac.2011.2166311","title":"On the Dubins Traveling Salesman Problem","display_name":"On the Dubins Traveling Salesman Problem","publication_year":2011,"publication_date":"2011-09-01","ids":{"openalex":"https://openalex.org/W1970071808","doi":"https://doi.org/10.1109/tac.2011.2166311","mag":"1970071808"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2011.2166311","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2011.2166311","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"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 Automatic Control","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/A5012980200","display_name":"J\u00e9r\u00f4me Le Ny","orcid":"https://orcid.org/0000-0002-3417-4135"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. Le Ny","raw_affiliation_strings":["Dept. of Electr. & Syst. Eng., Univ. of Pennsylvania, Philadelphia, PA, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Electr. & Syst. Eng., Univ. of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041459160","display_name":"\u00c9ric F\u00e9ron","orcid":"https://orcid.org/0000-0001-7717-2159"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. Feron","raw_affiliation_strings":["Georgia Tech, School of Aerospace Engineering, Atlanta, GA, USA","Sch. of Aerosp. Eng., Georgia Inst. of Technol., Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"Georgia Tech, School of Aerospace Engineering, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Sch. of Aerosp. Eng., Georgia Inst. of Technol., Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029069358","display_name":"Emilio Frazzoli","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. Frazzoli","raw_affiliation_strings":["Department of Aeronautics and Astronautics, The Laboratory for Information and Decision Systems, Cambridge, MA, USA","[Dept. of Aeronaut. & Astronaut., Massachusetts Inst. of Technol., Cambridge, MA, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Aeronautics and Astronautics, The Laboratory for Information and Decision Systems, Cambridge, MA, USA","institution_ids":[]},{"raw_affiliation_string":"[Dept. of Aeronaut. & Astronaut., Massachusetts Inst. of Technol., Cambridge, MA, USA]","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012980200"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":null,"apc_paid":null,"fwci":7.3297,"has_fulltext":false,"cited_by_count":157,"citation_normalized_percentile":{"value":0.97739984,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"57","issue":"1","first_page":"265","last_page":"270"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9355490803718567},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.711683988571167},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.6851586103439331},{"id":"https://openalex.org/keywords/heading","display_name":"Heading (navigation)","score":0.6726961135864258},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6662177443504333},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.6634511351585388},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.5785895586013794},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.48348647356033325},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.47720226645469666},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4687258005142212},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45007920265197754},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42825978994369507},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12160706520080566}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9355490803718567},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.711683988571167},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.6851586103439331},{"id":"https://openalex.org/C2776937971","wikidata":"https://www.wikidata.org/wiki/Q4384217","display_name":"Heading (navigation)","level":2,"score":0.6726961135864258},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6662177443504333},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.6634511351585388},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.5785895586013794},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.48348647356033325},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.47720226645469666},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4687258005142212},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45007920265197754},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42825978994369507},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12160706520080566},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tac.2011.2166311","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2011.2166311","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"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 Automatic Control","raw_type":"journal-article"},{"id":"pmh:oai:publications.polymtl.ca:33717","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/33717/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1515910767","https://openalex.org/W1517470327","https://openalex.org/W1545850514","https://openalex.org/W1598760690","https://openalex.org/W1604130472","https://openalex.org/W1969481197","https://openalex.org/W1971174066","https://openalex.org/W2017708378","https://openalex.org/W2022179164","https://openalex.org/W2035610952","https://openalex.org/W2042553152","https://openalex.org/W2055569927","https://openalex.org/W2066194644","https://openalex.org/W2104642742","https://openalex.org/W2137880701","https://openalex.org/W2147497334","https://openalex.org/W2148761022","https://openalex.org/W2148970883","https://openalex.org/W2160222800","https://openalex.org/W2165142526","https://openalex.org/W2170508483","https://openalex.org/W2170816677","https://openalex.org/W2216368278","https://openalex.org/W2313274380","https://openalex.org/W2314814367","https://openalex.org/W2324108981","https://openalex.org/W2401610261","https://openalex.org/W2611243847","https://openalex.org/W2611804663","https://openalex.org/W2956015669","https://openalex.org/W3145128584","https://openalex.org/W3149604617","https://openalex.org/W4246219036","https://openalex.org/W4249318479","https://openalex.org/W4251794413","https://openalex.org/W6675822643","https://openalex.org/W6698588160"],"related_works":["https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2359992618","https://openalex.org/W4220987199","https://openalex.org/W2167244338","https://openalex.org/W1992470106","https://openalex.org/W2766731260","https://openalex.org/W2362402143","https://openalex.org/W2361554335"],"abstract_inverted_index":{"We":[0,10,31],"study":[1],"the":[2,22],"traveling":[3],"salesman":[4],"problem":[5,14,38],"for":[6,36],"a":[7],"Dubins":[8],"vehicle.":[9],"prove":[11],"that":[12],"this":[13,37],"is":[15],"NP-hard,":[16],"and":[17,43],"provide":[18],"lower":[19],"bounds":[20],"on":[21,40],"approximation":[23],"ratio":[24],"achievable":[25],"by":[26],"some":[27],"recently":[28],"proposed":[29],"heuristics.":[30],"also":[32],"describe":[33],"new":[34],"algorithms":[35],"based":[39],"heading":[41],"discretization,":[42],"evaluate":[44],"their":[45],"performance":[46],"numerically.":[47]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":4}],"updated_date":"2026-03-24T08:02:53.985720","created_date":"2025-10-10T00:00:00"}