{"id":"https://openalex.org/W2097171912","doi":"https://doi.org/10.3390/a6010084","title":"Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach","display_name":"Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach","publication_year":2013,"publication_date":"2013-02-04","ids":{"openalex":"https://openalex.org/W2097171912","doi":"https://doi.org/10.3390/a6010084","mag":"2097171912"},"language":"en","primary_location":{"id":"doi:10.3390/a6010084","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6010084","pdf_url":"https://www.mdpi.com/1999-4893/6/1/84/pdf?version=1359984214","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/6/1/84/pdf?version=1359984214","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064731578","display_name":"Jason T. Isaacs","orcid":null},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jason Isaacs","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106-9560, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106-9560, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065218317","display_name":"Jo\u00e3o P. Hespanha","orcid":"https://orcid.org/0000-0003-2809-4718"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jo\u00e3o Hespanha","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106-9560, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106-9560, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5064731578"],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":2.7644,"has_fulltext":true,"cited_by_count":59,"citation_normalized_percentile":{"value":0.91894975,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"6","issue":"1","first_page":"84","last_page":"99"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9957000017166138,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9840999841690063,"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.9009974002838135},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5886006951332092},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.546522855758667},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5150244235992432},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4718320965766907},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4542052447795868},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.43010786175727844},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4288688898086548},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42036372423171997},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41923320293426514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3144626021385193},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1987047791481018}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9009974002838135},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5886006951332092},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.546522855758667},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5150244235992432},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4718320965766907},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4542052447795868},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.43010786175727844},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4288688898086548},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42036372423171997},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41923320293426514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3144626021385193},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1987047791481018},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a6010084","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6010084","pdf_url":"https://www.mdpi.com/1999-4893/6/1/84/pdf?version=1359984214","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:c0d076dc01dd4634abadc281607f2d01","is_oa":true,"landing_page_url":"https://doaj.org/article/c0d076dc01dd4634abadc281607f2d01","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 6, Iss 1, Pp 84-99 (2013)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/6/1/84/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a6010084","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 6; Issue 1; Pages: 84-99","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a6010084","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a6010084","pdf_url":"https://www.mdpi.com/1999-4893/6/1/84/pdf?version=1359984214","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.7099999785423279,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G1115769823","display_name":null,"funder_award_id":"W911NF-09-0001","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G7452299184","display_name":null,"funder_award_id":"W911NF","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G8309681720","display_name":null,"funder_award_id":"W911NF-09-0001","funder_id":"https://openalex.org/F4320338502","funder_display_name":"Institute for Collaborative Biotechnologies"},{"id":"https://openalex.org/G8998121839","display_name":null,"funder_award_id":"911NF","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"}],"funders":[{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"},{"id":"https://openalex.org/F4320338502","display_name":"Institute for Collaborative Biotechnologies","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2097171912.pdf","grobid_xml":"https://content.openalex.org/works/W2097171912.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W1492170047","https://openalex.org/W1517470327","https://openalex.org/W1545850514","https://openalex.org/W1969481197","https://openalex.org/W1980805195","https://openalex.org/W2013361314","https://openalex.org/W2017001763","https://openalex.org/W2023947722","https://openalex.org/W2035610952","https://openalex.org/W2048296377","https://openalex.org/W2058786336","https://openalex.org/W2107575633","https://openalex.org/W2117257995","https://openalex.org/W2122614382","https://openalex.org/W2134638269","https://openalex.org/W2137812761","https://openalex.org/W2137880701","https://openalex.org/W2140425706","https://openalex.org/W2145128369","https://openalex.org/W2148761022","https://openalex.org/W2168990813","https://openalex.org/W2292279207","https://openalex.org/W2313274380","https://openalex.org/W2323709497","https://openalex.org/W2332499306","https://openalex.org/W3121675905","https://openalex.org/W3146922093"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2361554335","https://openalex.org/W4200179302","https://openalex.org/W8433631","https://openalex.org/W4220987199","https://openalex.org/W2362402143"],"abstract_inverted_index":{"We":[0,111],"study":[1],"the":[2,6,18,26,80,95,108,114],"problem":[3,21,48],"of":[4,15,75,82,116,142,148],"finding":[5],"minimum-length":[7],"curvature":[8],"constrained":[9],"closed":[10],"path":[11],"through":[12,72],"a":[13,50,73,128,139],"set":[14],"regions":[16,109],"in":[17,138],"plane.":[19],"This":[20,86],"is":[22,36,62,88,101],"referred":[23],"to":[24,41,65,90,103,119,130],"as":[25,49],"Dubins":[27],"Traveling":[28,52,68],"Salesperson":[29,53,69],"Problem":[30,54,70],"with":[31,56,127],"Neighborhoods":[32],"(DTSPN).":[33],"An":[34],"algorithm":[35,87,99,118],"presented":[37],"that":[38],"uses":[39],"sampling":[40],"cast":[42],"this":[43,117],"infinite":[44],"dimensional":[45],"combinatorial":[46],"optimization":[47],"Generalized":[51],"(GTSP)":[55],"intersecting":[57],"node":[58],"sets.":[59],"The":[60],"GTSP":[61],"then":[63],"converted":[64],"an":[66,121],"Asymmetric":[67],"(ATSP)":[71],"series":[74],"graph":[76],"transformations,":[77],"thus":[78],"allowing":[79],"use":[81],"existing":[83,97],"approximation":[84],"algorithms.":[85],"shown":[89,102],"perform":[91,104],"no":[92],"worse":[93],"than":[94],"best":[96],"DTSPN":[98],"and":[100,146],"significantly":[105],"better":[106],"when":[107],"overlap.":[110],"report":[112],"on":[113],"application":[115],"route":[120],"Unmanned":[122],"Aerial":[123],"Vehicle":[124],"(UAV)":[125],"equipped":[126],"radio":[129],"collect":[131],"data":[132],"from":[133],"sparsely":[134],"deployed":[135],"ground":[136],"sensors":[137],"field":[140],"demonstration":[141],"autonomous":[143],"detection,":[144],"localization,":[145],"verification":[147],"multiple":[149],"acoustic":[150],"events.":[151]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2016-06-24T00:00:00"}