{"id":"https://openalex.org/W2137812761","doi":"https://doi.org/10.1109/cdc.2007.4434503","title":"The curvature-constrained traveling salesman problem for high point densities","display_name":"The curvature-constrained traveling salesman problem for high point densities","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2137812761","doi":"https://doi.org/10.1109/cdc.2007.4434503","mag":"2137812761"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2007.4434503","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2007.4434503","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 46th IEEE Conference on Decision and Control","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/A5012980200","display_name":"J\u00e9r\u00f4me Le Ny","orcid":"https://orcid.org/0000-0002-3417-4135"},"institutions":[{"id":"https://openalex.org/I4210143601","display_name":"Decision Systems (United States)","ror":"https://ror.org/0434dpa13","country_code":"US","type":"company","lineage":["https://openalex.org/I4210143601"]},{"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":true,"raw_author_name":"Jerome Le Ny","raw_affiliation_strings":["Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","[Massachusetts Inst. of Technol., Cambridge]"],"affiliations":[{"raw_affiliation_string":"Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210143601","https://openalex.org/I63966007"]},{"raw_affiliation_string":"[Massachusetts Inst. of Technol., Cambridge]","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","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"]},{"id":"https://openalex.org/I4210143601","display_name":"Decision Systems (United States)","ror":"https://ror.org/0434dpa13","country_code":"US","type":"company","lineage":["https://openalex.org/I4210143601"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emilio Frazzoli","raw_affiliation_strings":["Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","[Massachusetts Inst. of Technol., Cambridge]"],"affiliations":[{"raw_affiliation_string":"Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210143601","https://openalex.org/I63966007"]},{"raw_affiliation_string":"[Massachusetts Inst. of Technol., Cambridge]","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","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"]},{"id":"https://openalex.org/I4388482740","display_name":"Georgia Tech Research Institute","ror":"https://ror.org/04qfrh333","country_code":null,"type":"facility","lineage":["https://openalex.org/I130701444","https://openalex.org/I4388482740"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eric Feron","raw_affiliation_strings":["School of Aerospace Engineering, Georgia Technology Research Institute, Atlanta, GA, USA","[Georgia Institute of Technology.]"],"affiliations":[{"raw_affiliation_string":"School of Aerospace Engineering, Georgia Technology Research Institute, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444","https://openalex.org/I4388482740"]},{"raw_affiliation_string":"[Georgia Institute of Technology.]","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012980200"],"corresponding_institution_ids":["https://openalex.org/I4210143601","https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":2.3007,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.89344645,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"5985","last_page":"5990"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9948999881744385,"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/T12288","display_name":"Optimization and Search Problems","score":0.9696000218391418,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8019059896469116},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.701770544052124},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5989736914634705},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5643859505653381},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5522421002388},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.539417564868927},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.5301592946052551},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.516999363899231},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.49895501136779785},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4763469994068146},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.41927242279052734},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36837905645370483},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3285071551799774},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24772414565086365},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09436637163162231}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8019059896469116},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.701770544052124},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5989736914634705},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5643859505653381},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5522421002388},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.539417564868927},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5301592946052551},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.516999363899231},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.49895501136779785},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4763469994068146},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.41927242279052734},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36837905645370483},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3285071551799774},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24772414565086365},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09436637163162231},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.0},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cdc.2007.4434503","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2007.4434503","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 46th IEEE Conference on Decision and Control","raw_type":"proceedings-article"},{"id":"pmh:oai:publications.polymtl.ca:33697","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/33697/","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":"Communication de conf\u00e9rence"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W330417094","https://openalex.org/W1545850514","https://openalex.org/W1550331971","https://openalex.org/W1551519020","https://openalex.org/W1601512022","https://openalex.org/W1969481197","https://openalex.org/W1975442866","https://openalex.org/W1977006915","https://openalex.org/W2014068360","https://openalex.org/W2035610952","https://openalex.org/W2046982002","https://openalex.org/W2055569927","https://openalex.org/W2056179869","https://openalex.org/W2066194644","https://openalex.org/W2104642742","https://openalex.org/W2117226423","https://openalex.org/W2134638269","https://openalex.org/W2137880701","https://openalex.org/W2143037347","https://openalex.org/W2146713665","https://openalex.org/W2147497334","https://openalex.org/W2160222800","https://openalex.org/W2165142526","https://openalex.org/W2167197687","https://openalex.org/W2170508483","https://openalex.org/W2313274380","https://openalex.org/W2314814367","https://openalex.org/W2401610261","https://openalex.org/W2752885492","https://openalex.org/W3130171052","https://openalex.org/W3145128584","https://openalex.org/W4301168154","https://openalex.org/W6635932078","https://openalex.org/W6685108414","https://openalex.org/W6698588160"],"related_works":["https://openalex.org/W2090152127","https://openalex.org/W1965169884","https://openalex.org/W3125580510","https://openalex.org/W2008939113","https://openalex.org/W14679004","https://openalex.org/W1566651525","https://openalex.org/W2977652649","https://openalex.org/W3037672488","https://openalex.org/W2318206461","https://openalex.org/W2622600204"],"abstract_inverted_index":{"We":[0,18,80,118],"consider":[1],"algorithms":[2],"for":[3,89,99],"the":[4,10,23,29,37,41,46,50,56,76,90,100,114,128,157,164],"curvature-constrained":[5],"traveling":[6],"salesman":[7,59],"problem,":[8],"when":[9,36],"nonholonomic":[11],"constraint":[12,74],"is":[13,113,124,156,163],"described":[14],"by":[15],"Dubins'":[16,91],"model.":[17],"indicate":[19],"a":[20,73,87],"proof":[21],"of":[22,25,31,49,96,116,144],"NP-hardness":[24],"this":[26,67,137],"problem.":[27],"In":[28,66],"case":[30],"low":[32],"point":[33],"densities,":[34],"i.e.,":[35],"Euclidean":[38,57,78,101,129,166],"distances":[39],"between":[40,168],"points":[42,97],"are":[43,61],"larger":[44],"than":[45,109],"turning":[47,159],"radius":[48],"vehicle,":[51],"various":[52],"heuristics":[53],"based":[54,126],"on":[55,75,127],"Traveling":[58],"problem":[60],"expected":[62],"to":[63,133],"perform":[64],"well.":[65],"paper":[68],"we":[69,139],"do":[70],"not":[71,125],"put":[72],"minimum":[77,158,165],"distance.":[79],"show":[81],"that":[82,85,123],"any":[83,169],"algorithm":[84,122],"computes":[86],"tour":[88],"vehicle":[92],"following":[93],"an":[94,105,121,141],"ordering":[95],"optimal":[98],"TSP":[102],"cannot":[103],"have":[104],"approximation":[106,142],"ratio":[107],"better":[108],"Omega(n),":[110],"where":[111,154],"n":[112],"number":[115],"points.":[117,171],"then":[119],"propose":[120],"solution":[130],"and":[131,161],"seems":[132],"behave":[134],"differently.":[135],"For":[136],"algorithm,":[138],"obtain":[140],"guarantee":[143],"O":[145],"(min":[146],"{(1+rho/epsiv)log":[147],"n,":[148],"(1+rho/epsiv)":[149],"<sup":[150],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[151],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[152],"),":[153],"rho":[155],"radius,":[160],"epsiv":[162],"distance":[167],"two":[170]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":6}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}