{"id":"https://openalex.org/W3015004060","doi":"https://doi.org/10.1109/tcns.2020.2983791","title":"Min-Max Tours and Paths for Task Allocation to\u00a0Heterogeneous Agents","display_name":"Min-Max Tours and Paths for Task Allocation to\u00a0Heterogeneous Agents","publication_year":2020,"publication_date":"2020-03-30","ids":{"openalex":"https://openalex.org/W3015004060","doi":"https://doi.org/10.1109/tcns.2020.2983791","mag":"3015004060"},"language":"en","primary_location":{"id":"doi:10.1109/tcns.2020.2983791","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcns.2020.2983791","pdf_url":null,"source":{"id":"https://openalex.org/S2502544478","display_name":"IEEE Transactions on Control of Network Systems","issn_l":"2325-5870","issn":["2325-5870","2372-2533"],"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 Transactions on Control of Network Systems","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/A5057303961","display_name":"Amritha Prasad","orcid":"https://orcid.org/0000-0002-6598-9580"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amritha Prasad","raw_affiliation_strings":["School of Electrical and Computer Engineering, Purdue University, West Lafayette, USA"],"raw_orcid":"https://orcid.org/0000-0002-6598-9580","affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, West Lafayette, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049291168","display_name":"Han\u2010Lim Choi","orcid":"https://orcid.org/0000-0003-3985-0419"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Han-Lim Choi","raw_affiliation_strings":["Department of Aerospace Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea"],"raw_orcid":"https://orcid.org/0000-0003-3985-0419","affiliations":[{"raw_affiliation_string":"Department of Aerospace Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076731201","display_name":"Shreyas Sundaram","orcid":"https://orcid.org/0000-0002-5390-2505"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shreyas Sundaram","raw_affiliation_strings":["School of Electrical and Computer Engineering, Purdue University, West Lafayette, USA"],"raw_orcid":"https://orcid.org/0000-0002-5390-2505","affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, West Lafayette, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0739,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.78924329,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"7","issue":"3","first_page":"1511","last_page":"1522"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983000159263611,"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.9915000200271606,"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/computer-science","display_name":"Computer science","score":0.7129647731781006},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5492149591445923},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5320414304733276},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5287805795669556},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.44344812631607056},{"id":"https://openalex.org/keywords/multi-agent-system","display_name":"Multi-agent system","score":0.4142630398273468},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23190340399742126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1856531798839569},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0847843587398529}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7129647731781006},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5492149591445923},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5320414304733276},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5287805795669556},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.44344812631607056},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.4142630398273468},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23190340399742126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1856531798839569},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0847843587398529},{"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/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcns.2020.2983791","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcns.2020.2983791","pdf_url":null,"source":{"id":"https://openalex.org/S2502544478","display_name":"IEEE Transactions on Control of Network Systems","issn_l":"2325-5870","issn":["2325-5870","2372-2533"],"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 Transactions on Control of Network Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8200181892","display_name":"CAREER: Towards Secure Large-Scale Networked Systems: Resilient Distributed Algorithms for Coordination in Networks under Cyber Attacks","funder_award_id":"1653648","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W938223372","https://openalex.org/W1137738072","https://openalex.org/W1650780448","https://openalex.org/W1857333123","https://openalex.org/W1919410445","https://openalex.org/W1965680834","https://openalex.org/W1968594877","https://openalex.org/W1974713906","https://openalex.org/W1991781549","https://openalex.org/W1996380018","https://openalex.org/W2016583826","https://openalex.org/W2017927472","https://openalex.org/W2050819731","https://openalex.org/W2055569927","https://openalex.org/W2064155562","https://openalex.org/W2071701840","https://openalex.org/W2102201348","https://openalex.org/W2117226423","https://openalex.org/W2136613778","https://openalex.org/W2138358085","https://openalex.org/W2142544818","https://openalex.org/W2145866065","https://openalex.org/W2148442026","https://openalex.org/W2157488300","https://openalex.org/W2161228161","https://openalex.org/W2251882317","https://openalex.org/W2293157881","https://openalex.org/W2314167486","https://openalex.org/W2328510172","https://openalex.org/W2626096427","https://openalex.org/W2726117250","https://openalex.org/W2767376036","https://openalex.org/W2962771877","https://openalex.org/W4250589301","https://openalex.org/W4252801674","https://openalex.org/W4255306344","https://openalex.org/W6677426919"],"related_works":["https://openalex.org/W2003033456","https://openalex.org/W4389443772","https://openalex.org/W2386246912","https://openalex.org/W2548721895","https://openalex.org/W2373456246","https://openalex.org/W4250911175","https://openalex.org/W2413419736","https://openalex.org/W4238809000","https://openalex.org/W2786646446","https://openalex.org/W4386392971"],"abstract_inverted_index":{"We":[0,86,118,142,168],"consider":[1,144,169],"a":[2,6,13,19,44,99,120,179,186],"scenario":[3],"consisting":[4],"of":[5,8,15,43,64,108,128,132,137,139,188],"set":[7,14,107],"heterogeneous":[9,91,146],"mobile":[10],"agents":[11,23,42,71,96,133,138,152],"and":[12,47,102,134,158],"tasks":[16,30,35,49,67,109],"dispersed":[17],"over":[18],"geographic":[20],"area.":[21],"The":[22,29,175],"are":[24,31,159],"partitioned":[25,32],"into":[26,33],"different":[27],"types.":[28],"specialized":[34],"that":[36,50],"can":[37,51,153],"only":[38],"be":[39,52],"done":[40,53],"by":[41,54],"certain":[45],"type,":[46],"generic":[48],"any":[55,84],"agent.":[56,85],"Given":[57],"this":[58,125],"scenario,":[59],"we":[60],"address":[61],"the":[62,69,79,90,106,116,129,135,145,183],"problem":[63,94,149],"allocating":[65],"these":[66],"among":[68],"available":[70],"(subject":[72],"to":[73,104,111,115,123,162,164,172],"type":[74],"compatibility":[75],"constraints)":[76],"while":[77,182],"minimizing":[78],"maximum":[80],"travel":[81],"cost":[82],"for":[83],"first":[87,176],"look":[88],"at":[89,98],"agent":[92,147],"cycle":[93],"where":[95,151],"start":[97,154,166],"common":[100],"depot":[101],"need":[103],"tour":[105],"allocated":[110],"them":[112],"before":[113],"returning":[114],"depot.":[117],"provide":[119],"5-approximation":[121],"algorithm":[122],"solve":[124,173],"problem,":[126],"regardless":[127],"total":[130],"number":[131,136],"each":[140],"type.":[141],"then":[143],"path":[148],"(HAPP)":[150],"from":[155],"arbitrary":[156],"locations":[157],"not":[160],"constrained":[161],"return":[163],"their":[165],"location.":[167],"two":[170],"approaches":[171],"HAPP.":[174],"approach":[177],"yields":[178,185],"15-approximation":[180],"factor,":[181],"second":[184],"factor":[187],"16.":[189]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}