{"id":"https://openalex.org/W2529190220","doi":"https://doi.org/10.1109/cca.2016.7587859","title":"Fast algorithms for UAV tasking and routing","display_name":"Fast algorithms for UAV tasking and routing","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2529190220","doi":"https://doi.org/10.1109/cca.2016.7587859","mag":"2529190220"},"language":"en","primary_location":{"id":"doi:10.1109/cca.2016.7587859","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cca.2016.7587859","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Conference on Control Applications (CCA)","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/A5086339662","display_name":"Hanyi Ding","orcid":"https://orcid.org/0000-0002-0307-9119"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Huanyu Ding","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Boston University, United States of America"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Boston University, United States of America","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103073490","display_name":"David A. Casta\u00f1\u00f3n","orcid":"https://orcid.org/0000-0002-9635-9776"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Casta\u00f1\u00f3n","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Boston University, United States of America"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Boston University, United States of America","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086339662"],"corresponding_institution_ids":["https://openalex.org/I111088046"],"apc_list":null,"apc_paid":null,"fwci":1.002,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.83405498,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"368","last_page":"373"},"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.9991999864578247,"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.9955000281333923,"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/orienteering","display_name":"Orienteering","score":0.8883980512619019},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8589088320732117},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6812593936920166},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6579276323318481},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6148871183395386},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5721107721328735},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5719629526138306},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5331266522407532},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5147069096565247},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5040485262870789},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.46143838763237},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.43800801038742065},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4191366136074066},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3982110321521759},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18661242723464966},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18484655022621155}],"concepts":[{"id":"https://openalex.org/C513932644","wikidata":"https://www.wikidata.org/wiki/Q29358","display_name":"Orienteering","level":2,"score":0.8883980512619019},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8589088320732117},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6812593936920166},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6579276323318481},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6148871183395386},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5721107721328735},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5719629526138306},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5331266522407532},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5147069096565247},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5040485262870789},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.46143838763237},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.43800801038742065},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4191366136074066},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3982110321521759},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18661242723464966},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18484655022621155},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cca.2016.7587859","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cca.2016.7587859","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Conference on Control Applications (CCA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.41999998688697815,"display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W118463236","https://openalex.org/W1555599194","https://openalex.org/W1963938442","https://openalex.org/W1980328733","https://openalex.org/W1986056047","https://openalex.org/W1994248285","https://openalex.org/W1999883971","https://openalex.org/W2001139415","https://openalex.org/W2003281104","https://openalex.org/W2014979043","https://openalex.org/W2017708378","https://openalex.org/W2039482292","https://openalex.org/W2043905543","https://openalex.org/W2061637847","https://openalex.org/W2113873983","https://openalex.org/W2148026779","https://openalex.org/W2289279151","https://openalex.org/W2477751029","https://openalex.org/W3120740533"],"related_works":["https://openalex.org/W3083042533","https://openalex.org/W2357796514","https://openalex.org/W2393014972","https://openalex.org/W2357595179","https://openalex.org/W2351136238","https://openalex.org/W2891162720","https://openalex.org/W3171554204","https://openalex.org/W3199776955","https://openalex.org/W2169800510","https://openalex.org/W3119129187"],"abstract_inverted_index":{"The":[0],"problem":[1,81,131,136],"of":[2,6,13,45,65,121,128,153],"partitioning":[3],"a":[4,11,118,126,133,138,188],"set":[5],"geographically":[7],"distributed":[8],"tasks":[9,21,46],"among":[10],"team":[12,53],"UAVs":[14,32],"that":[15,50,204],"must":[16],"travel":[17,37],"to":[18,28,42,84,156,162],"perform":[19,212],"the":[20,129,151,199],"arises":[22],"in":[23,35,71,109,198],"many":[24],"contexts,":[25],"from":[26,187],"surveillance":[27],"environmental":[29],"monitoring.":[30],"When":[31],"have":[33,101],"limits":[34,59],"their":[36],"distances,":[38],"it":[39],"is":[40,82],"important":[41],"select":[43],"subsets":[44],"for":[47,89,147,167],"each":[48],"UAV":[49,61,177],"achieve":[51],"highest":[52],"values":[54],"while":[55],"remaining":[56],"feasible":[57],"given":[58],"on":[60,105,125,179],"resources.":[62],"This":[63,80],"class":[64,120],"problems":[66,92,96,149,181,185],"has":[67],"been":[68,102],"studied":[69],"previously":[70],"computer":[72],"science":[73],"and":[74,137,175,211],"operations":[75],"research":[76],"as":[77,93,182,184],"orienteering":[78,91,130,168],"problems.":[79,112,169],"known":[83],"be":[85],"NP-Hard.":[86],"Previous":[87],"algorithms":[88,100,146,166,178,194,197,207],"solving":[90],"integer":[94],"programming":[95],"are":[97,208],"slow;":[98],"faster":[99],"proposed":[103],"based":[104,124],"heuristic":[106],"techniques":[107],"used":[108],"traveling":[110,140,158],"salesperson":[111,141,159],"In":[113],"this":[114],"paper,":[115],"we":[116],"develop":[117],"different":[119],"fast":[122],"algorithms,":[123],"decomposition":[127],"into":[132],"knapsack":[134,148],"assignment":[135],"subsequent":[139],"problem.":[142],"We":[143,170],"combine":[144],"greedy":[145],"with":[150,173,195],"use":[152],"spanning":[154],"trees":[155],"estimate":[157],"tour":[160],"lengths":[161],"obtain":[163],"new,":[164],"approximate":[165],"conduct":[171],"experiments":[172],"single":[174],"multiple":[176],"benchmark":[180],"well":[183],"derived":[186],"LANDAT":[189],"dataset,":[190],"comparing":[191],"our":[192,205],"new":[193,206],"other":[196],"literature.":[200],"Our":[201],"results":[202],"indicate":[203],"consistently":[209],"fast,":[210],"better":[213],"than":[214],"competing":[215],"algorithms.":[216]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}