{"id":"https://openalex.org/W2033087107","doi":"https://doi.org/10.1109/icra.2014.6907156","title":"Assignment algorithms for modeling resource contention and interference in multi-robot task-allocation","display_name":"Assignment algorithms for modeling resource contention and interference in multi-robot task-allocation","publication_year":2014,"publication_date":"2014-05-01","ids":{"openalex":"https://openalex.org/W2033087107","doi":"https://doi.org/10.1109/icra.2014.6907156","mag":"2033087107"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2014.6907156","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2014.6907156","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 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/A5084244126","display_name":"Changjoo Nam","orcid":"https://orcid.org/0000-0002-9169-0785"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Changjoo Nam","raw_affiliation_strings":["Department of Computer Science and Engineering, Texas A&M University, College Station, Texas, USA","Department of Computer Science and Engineering at Texas A&M University, College Station, Texas, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Texas A&M University, College Station, Texas, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Computer Science and Engineering at Texas A&M University, College Station, Texas, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035574727","display_name":"Dylan A. Shell","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dylan A. Shell","raw_affiliation_strings":["Department of Computer Science and Engineering, Texas A&M University, College Station, Texas, USA","Department of Computer Science and Engineering at Texas A&M University, College Station, Texas, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Texas A&M University, College Station, Texas, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Computer Science and Engineering at Texas A&M University, College Station, Texas, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084244126"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":3.4481,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.93093768,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2158","last_page":"2163"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9980999827384949,"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.9980999827384949,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.994700014591217,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9907000064849854,"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/generalization","display_name":"Generalization","score":0.7111659049987793},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6810193061828613},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6741344928741455},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.6560245752334595},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6099786758422852},{"id":"https://openalex.org/keywords/interference","display_name":"Interference (communication)","score":0.5973629355430603},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.5395426750183105},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.536860466003418},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5272649526596069},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.509318470954895},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4925285279750824},{"id":"https://openalex.org/keywords/weapon-target-assignment-problem","display_name":"Weapon target assignment problem","score":0.44380876421928406},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.4307657778263092},{"id":"https://openalex.org/keywords/resource-management","display_name":"Resource management (computing)","score":0.42295658588409424},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.32050904631614685},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22769686579704285},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.19180002808570862},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1585635542869568}],"concepts":[{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.7111659049987793},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6810193061828613},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6741344928741455},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.6560245752334595},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6099786758422852},{"id":"https://openalex.org/C32022120","wikidata":"https://www.wikidata.org/wiki/Q797225","display_name":"Interference (communication)","level":3,"score":0.5973629355430603},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.5395426750183105},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.536860466003418},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5272649526596069},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.509318470954895},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4925285279750824},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.44380876421928406},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.4307657778263092},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.42295658588409424},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.32050904631614685},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22769686579704285},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.19180002808570862},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1585635542869568},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2014.6907156","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2014.6907156","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1528546869","https://openalex.org/W1554682999","https://openalex.org/W1577083826","https://openalex.org/W1594393406","https://openalex.org/W1632601927","https://openalex.org/W1723186713","https://openalex.org/W1970422301","https://openalex.org/W1979690402","https://openalex.org/W1980402871","https://openalex.org/W1999731981","https://openalex.org/W2007787872","https://openalex.org/W2011087880","https://openalex.org/W2026129593","https://openalex.org/W2029958010","https://openalex.org/W2080193201","https://openalex.org/W2113257089","https://openalex.org/W2114616381","https://openalex.org/W2122350220","https://openalex.org/W2123008124","https://openalex.org/W2137714578","https://openalex.org/W2142544818","https://openalex.org/W2144583323","https://openalex.org/W2149489849","https://openalex.org/W2151654592","https://openalex.org/W2157488300","https://openalex.org/W2222512263","https://openalex.org/W2294153305","https://openalex.org/W2964211993","https://openalex.org/W4252673810","https://openalex.org/W6633241960","https://openalex.org/W6637865423","https://openalex.org/W6680970307","https://openalex.org/W6681088732"],"related_works":["https://openalex.org/W2358965113","https://openalex.org/W2394525006","https://openalex.org/W2565453737","https://openalex.org/W1966664777","https://openalex.org/W2067336310","https://openalex.org/W2043335785","https://openalex.org/W2810144281","https://openalex.org/W2561372086","https://openalex.org/W2005469743","https://openalex.org/W2033087107"],"abstract_inverted_index":{"We":[0,22,71,89],"consider":[1],"optimization":[2],"of":[3,12,50,137],"the":[4,9,13,29,68,73,80,95,102,149],"multi-robot":[5],"task-allocation":[6],"problem":[7,76,97,135],"when":[8,64],"overall":[10],"performance":[11,150],"team":[14],"need":[15],"not":[16],"be":[17,37,60],"a":[18,24,40,55,113,128,134],"standard":[19],"sum-of-cost":[20],"model.":[21],"introduce":[23],"generalization":[25],"that":[26],"allows":[27],"for":[28,94,101],"additional":[30],"cost":[31],"incurred":[32],"by":[33],"resource":[34],"contention":[35],"to":[36,53,142],"treated":[38],"in":[39,83,112],"straightforward":[41],"manner.":[42],"In":[43,140],"this":[44],"variant,":[45],"robots":[46,66],"may":[47,59],"choose":[48],"one":[49],"shared":[51],"resources":[52],"perform":[54],"task,":[56],"and":[57,77,98,127],"interference":[58,81],"modeled":[61],"as":[62],"occurring":[63],"multiple":[65],"use":[67],"same":[69],"resource.":[70],"investigate":[72],"general":[74,96],"NP-hard":[75],"instances":[78],"where":[79],"results":[82],"linear":[84],"or":[85],"convex":[86],"penalization":[87],"functions.":[88],"propose":[90],"an":[91,109,125],"exact":[92,106],"algorithm":[93,107,147],"polynomial-time":[99],"algorithms":[100,122],"other":[103,120],"problems.":[104],"The":[105,119],"finds":[108],"optimal":[110,126],"assignment":[111,131],"reasonable":[114],"time":[115],"on":[116],"small":[117],"instances.":[118],"two":[121],"quickly":[123],"find":[124],"high-quality":[129],"approximation":[130,144],"even":[132],"if":[133],"is":[136],"considerable":[138],"size.":[139],"contrast":[141],"conventional":[143],"methods,":[145],"our":[146],"provides":[148],"guarantee.":[151]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}