{"id":"https://openalex.org/W2926223840","doi":"https://doi.org/10.1109/icra.2018.8460957","title":"The Dubins Traveling Salesman Problem with Neighborhoods in the Three-Dimensional Space","display_name":"The Dubins Traveling Salesman Problem with Neighborhoods in the Three-Dimensional Space","publication_year":2018,"publication_date":"2018-05-01","ids":{"openalex":"https://openalex.org/W2926223840","doi":"https://doi.org/10.1109/icra.2018.8460957","mag":"2926223840"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2018.8460957","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2018.8460957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Robotics and Automation (ICRA)","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/A5030097640","display_name":"Petr V\u00e1\u0148a","orcid":"https://orcid.org/0000-0003-2155-5788"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Petr V\u00e1\u0148a","raw_affiliation_strings":["Faculty of Electrical Engineering, Czech Technical University in Prague, Technicka 2, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University in Prague, Technicka 2, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063435927","display_name":"Jakub Sl\u00e1ma","orcid":"https://orcid.org/0000-0002-9752-0808"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jakub Sl\u00e1ma","raw_affiliation_strings":["Faculty of Electrical Engineering, Czech Technical University in Prague, Technicka 2, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University in Prague, Technicka 2, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073496345","display_name":"Jan Faigl","orcid":"https://orcid.org/0000-0002-6193-0792"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Faigl","raw_affiliation_strings":["Faculty of Electrical Engineering, Czech Technical University in Prague, Technicka 2, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University in Prague, Technicka 2, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030097640"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":0.7312,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.7766414,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"4","issue":null,"first_page":"374","last_page":"379"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9983000159263611,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8483352661132812},{"id":"https://openalex.org/keywords/turning-radius","display_name":"Turning radius","score":0.6501855850219727},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.635654091835022},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.6324770450592041},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5942017436027527},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.540671169757843},{"id":"https://openalex.org/keywords/climb","display_name":"Climb","score":0.5350882411003113},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5053730607032776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4740438461303711},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.47064608335494995},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4585414528846741},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4199710786342621},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35922563076019287},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14879244565963745},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.14417153596878052},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12552115321159363},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.08312880992889404}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8483352661132812},{"id":"https://openalex.org/C205148227","wikidata":"https://www.wikidata.org/wiki/Q2558948","display_name":"Turning radius","level":2,"score":0.6501855850219727},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.635654091835022},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.6324770450592041},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5942017436027527},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.540671169757843},{"id":"https://openalex.org/C2778168010","wikidata":"https://www.wikidata.org/wiki/Q1499786","display_name":"Climb","level":2,"score":0.5350882411003113},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5053730607032776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4740438461303711},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.47064608335494995},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4585414528846741},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4199710786342621},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35922563076019287},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14879244565963745},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.14417153596878052},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12552115321159363},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.08312880992889404},{"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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"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/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/icra.2018.8460957","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2018.8460957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7400000095367432,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W167756786","https://openalex.org/W1963641530","https://openalex.org/W1968420376","https://openalex.org/W1992370839","https://openalex.org/W2000018926","https://openalex.org/W2004743525","https://openalex.org/W2009945360","https://openalex.org/W2066873908","https://openalex.org/W2067061580","https://openalex.org/W2104642742","https://openalex.org/W2106696496","https://openalex.org/W2124436667","https://openalex.org/W2131569937","https://openalex.org/W2137880701","https://openalex.org/W2145078823","https://openalex.org/W2148761022","https://openalex.org/W2166500251","https://openalex.org/W2171941573","https://openalex.org/W2204974831","https://openalex.org/W2219097197","https://openalex.org/W2313274380","https://openalex.org/W2332499306","https://openalex.org/W2507582434","https://openalex.org/W2587537338","https://openalex.org/W2735450115","https://openalex.org/W2742734338","https://openalex.org/W2752791155","https://openalex.org/W2762380910","https://openalex.org/W2767752711","https://openalex.org/W2767999680","https://openalex.org/W2772011902","https://openalex.org/W2781589682","https://openalex.org/W3121675905","https://openalex.org/W3150899403","https://openalex.org/W6648391075","https://openalex.org/W6667331318","https://openalex.org/W6675822643","https://openalex.org/W6679017094","https://openalex.org/W6685777405","https://openalex.org/W6702542234","https://openalex.org/W6725128502","https://openalex.org/W6743912329","https://openalex.org/W6745422769","https://openalex.org/W6746375191"],"related_works":["https://openalex.org/W1495548623","https://openalex.org/W2009505450","https://openalex.org/W4285553133","https://openalex.org/W4205169999","https://openalex.org/W2910570437","https://openalex.org/W2483415178","https://openalex.org/W2614603712","https://openalex.org/W2072651286","https://openalex.org/W2002592812","https://openalex.org/W2384244699"],"abstract_inverted_index":{"We":[0],"introduce":[1],"an":[2],"extension":[3],"of":[4,28,60,64,72,88,146,154,170],"the":[5,13,32,39,56,62,68,73,89,98,110,128,143,147,150,155,159],"Dubins":[6,113],"Traveling":[7],"Salesman":[8],"Problem":[9],"with":[10],"Neighborhoods":[11],"into":[12],"3D":[14,112],"space":[15],"in":[16,96,142],"which":[17,97,126],"a":[18,26,93,103,123],"fixed-wing":[19],"aerial":[20],"vehicle":[21,33],"is":[22,52,100,119],"requested":[23],"to":[24,53,78,84,158],"visit":[25],"set":[27],"target":[29,65],"regions":[30],"while":[31,162],"motion":[34],"constraints":[35],"are":[36,153,166],"satisfied,":[37],"i.e.,":[38],"minimum":[40],"turning":[41],"radius":[42],"and":[43,46,67],"maximum":[44],"climb":[45],"dive":[47],"angles.":[48],"The":[49,116,131],"primary":[50],"challenge":[51],"address":[54,85],"both":[55,86],"combinatorial":[57],"optimization":[58,70,125],"part":[59,71,145],"finding":[61],"sequence":[63,99],"visits":[66],"continuous":[69],"final":[74,117],"trajectory":[75,118],"determination.":[76],"Due":[77],"its":[79,163],"high":[80],"complexity,":[81],"we":[82],"propose":[83],"parts":[87],"problem":[90],"separately":[91],"by":[92,102,122],"decoupled":[94],"approach":[95,133],"determined":[101],"new":[104],"distance":[105,141],"function":[106],"designed":[107],"explicitly":[108],"for":[109],"utilized":[111],"Airplane":[114],"model.":[115],"then":[120],"found":[121,151],"local":[124],"improves":[127],"solution":[129],"quality.":[130],"proposed":[132],"provides":[134],"significantly":[135],"better":[136],"solutions":[137,152],"than":[138],"using":[139],"Euclidean":[140],"sequencing":[144],"problem.":[148],"Moreover,":[149],"competitive":[156],"quality":[157],"sampling-based":[160],"algorithm":[161],"computational":[164],"requirements":[165],"about":[167],"two":[168],"orders":[169],"magnitude":[171],"lower.":[172]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}