{"id":"https://openalex.org/W2587537338","doi":"https://doi.org/10.1109/lra.2017.2666261","title":"Dubins Orienteering Problem","display_name":"Dubins Orienteering Problem","publication_year":2017,"publication_date":"2017-02-08","ids":{"openalex":"https://openalex.org/W2587537338","doi":"https://doi.org/10.1109/lra.2017.2666261","mag":"2587537338"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2017.2666261","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2017.2666261","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"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 Robotics and Automation Letters","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/A5045281591","display_name":"Robert P\u011bni\u010dka","orcid":"https://orcid.org/0000-0001-8549-4932"},"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":"Robert Penicka","raw_affiliation_strings":["Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","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, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","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":false,"raw_author_name":"Petr Vana","raw_affiliation_strings":["Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004992661","display_name":"Martin Saska","orcid":"https://orcid.org/0000-0001-7106-3816"},"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":"Martin Saska","raw_affiliation_strings":["Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5045281591"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":4.4601,"has_fulltext":false,"cited_by_count":86,"citation_normalized_percentile":{"value":0.96789674,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"2","issue":"2","first_page":"1210","last_page":"1217"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.9993000030517578,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9896000027656555,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/orienteering","display_name":"Orienteering","score":0.9884896278381348},{"id":"https://openalex.org/keywords/heading","display_name":"Heading (navigation)","score":0.6868737936019897},{"id":"https://openalex.org/keywords/turning-radius","display_name":"Turning radius","score":0.6856695413589478},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6664144992828369},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5674097537994385},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5639762878417969},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4915543496608734},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.4506986439228058},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4406930208206177},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.428242027759552},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4238014817237854},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3598288893699646},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.16278773546218872},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05920982360839844}],"concepts":[{"id":"https://openalex.org/C513932644","wikidata":"https://www.wikidata.org/wiki/Q29358","display_name":"Orienteering","level":2,"score":0.9884896278381348},{"id":"https://openalex.org/C2776937971","wikidata":"https://www.wikidata.org/wiki/Q4384217","display_name":"Heading (navigation)","level":2,"score":0.6868737936019897},{"id":"https://openalex.org/C205148227","wikidata":"https://www.wikidata.org/wiki/Q2558948","display_name":"Turning radius","level":2,"score":0.6856695413589478},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6664144992828369},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5674097537994385},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5639762878417969},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4915543496608734},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.4506986439228058},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4406930208206177},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.428242027759552},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4238014817237854},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3598288893699646},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.16278773546218872},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05920982360839844},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2017.2666261","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2017.2666261","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"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 Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G5038496234","display_name":null,"funder_award_id":"17-16900Y","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G7001430458","display_name":null,"funder_award_id":"16-24206S","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1501108511","https://openalex.org/W1517470327","https://openalex.org/W1970071808","https://openalex.org/W1973834849","https://openalex.org/W1982582014","https://openalex.org/W1999883971","https://openalex.org/W2014979043","https://openalex.org/W2017708378","https://openalex.org/W2033052486","https://openalex.org/W2044701049","https://openalex.org/W2069657950","https://openalex.org/W2091756921","https://openalex.org/W2113873983","https://openalex.org/W2131569937","https://openalex.org/W2135053242","https://openalex.org/W2148761022","https://openalex.org/W2313274380","https://openalex.org/W2411454766","https://openalex.org/W2418877712","https://openalex.org/W2507582434","https://openalex.org/W2525640293","https://openalex.org/W3150899403","https://openalex.org/W6629919699","https://openalex.org/W6725128502"],"related_works":["https://openalex.org/W4249387127","https://openalex.org/W1543810005","https://openalex.org/W4393610368","https://openalex.org/W4393731121","https://openalex.org/W327165017","https://openalex.org/W2356214734","https://openalex.org/W2394169628","https://openalex.org/W2587537338","https://openalex.org/W3094467313","https://openalex.org/W2170796892"],"abstract_inverted_index":{"In":[0],"this":[1],"letter,":[2],"we":[3],"address":[4],"the":[5,24,48,62,67,74,81,86,96,103,113,116,130,159,162,167],"orienteering":[6],"problem":[7],"(OP)":[8],"for":[9],"curvature":[10],"constrained":[11],"vehicle.":[12,88],"For":[13],"a":[14,29,32,37,53,153],"given":[15,38,54],"set":[16],"of":[17,61,85,94,102,115,161,166],"target":[18,122],"locations,":[19],"each":[20,121],"with":[21],"associated":[22],"reward,":[23],"OP":[25,64,146],"stands":[26],"to":[27,36,79,106],"find":[28],"tour":[30,49,77],"from":[31],"prescribed":[33],"starting":[34],"location":[35,40],"ending":[39],"such":[41],"that":[42],"it":[43,110],"maximizes":[44],"collected":[45],"rewards":[46],"while":[47],"length":[50],"is":[51,65,127,138],"within":[52],"travel":[55],"budget":[56],"constraint.":[57],"The":[58,89,124],"addressed":[59],"generalization":[60],"Euclidean":[63],"called":[66],"Dubins":[68,87,168],"Orienteering":[69,169],"Problem":[70],"(DOP)":[71],"in":[72,144,152],"which":[73],"reward":[75],"collecting":[76],"has":[78],"satisfy":[80],"limited":[82],"turning":[83],"radius":[84],"DOP":[90],"consists":[91],"not":[92],"only":[93],"selecting":[95],"most":[97],"valuable":[98],"targets":[99],"and":[100,135],"determination":[101,114],"optimal":[104],"sequence":[105],"visit":[107],"them,":[108],"but":[109],"also":[111],"involves":[112],"vehicle's":[117],"heading":[118],"angle":[119],"at":[120],"location.":[123],"proposed":[125,163],"solution":[126,165],"based":[128],"on":[129],"Variable":[131],"neighborhood":[132],"search":[133],"technique,":[134],"its":[136],"feasibility":[137],"supported":[139],"by":[140],"an":[141,149],"empirical":[142],"evaluation":[143],"existing":[145],"benchmarks.":[147],"Moreover,":[148],"experimental":[150],"verification":[151],"real":[154],"practical":[155],"scenario":[156],"further":[157],"demonstrates":[158],"necessity":[160],"direct":[164],"Problem.":[170]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":19},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}