{"id":"https://openalex.org/W2089312859","doi":"https://doi.org/10.1109/tase.2015.2415514","title":"Assignment Algorithms for Modeling Resource Contention in Multirobot Task Allocation","display_name":"Assignment Algorithms for Modeling Resource Contention in Multirobot Task Allocation","publication_year":2015,"publication_date":"2015-04-15","ids":{"openalex":"https://openalex.org/W2089312859","doi":"https://doi.org/10.1109/tase.2015.2415514","mag":"2089312859"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2015.2415514","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2015.2415514","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"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 Automation Science and Engineering","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/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, Texas A&M University, College Station, Texas, USA#TAB#"],"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, Texas A&M University, College Station, Texas, USA#TAB#","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, Texas A&M University, College Station, Texas, USA#TAB#"],"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, Texas A&M University, College Station, Texas, USA#TAB#","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.3282,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.92970205,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"12","issue":"3","first_page":"889","last_page":"900"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"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.9987000226974487,"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.996999979019165,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9922999739646912,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.7115035057067871},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6545232534408569},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.6047780513763428},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5871293544769287},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5727720260620117},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.526505172252655},{"id":"https://openalex.org/keywords/resource-management","display_name":"Resource management (computing)","score":0.5025444030761719},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.48191145062446594},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.4649689495563507},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4362652599811554},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41883689165115356},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37947314977645874},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3469659984111786},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18627119064331055},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14911893010139465},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11957821249961853}],"concepts":[{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.7115035057067871},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6545232534408569},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.6047780513763428},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5871293544769287},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5727720260620117},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.526505172252655},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.5025444030761719},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.48191145062446594},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.4649689495563507},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4362652599811554},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41883689165115356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37947314977645874},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3469659984111786},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18627119064331055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14911893010139465},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11957821249961853},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems 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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tase.2015.2415514","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2015.2415514","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"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 Automation Science and Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":64,"referenced_works":["https://openalex.org/W39785869","https://openalex.org/W98621763","https://openalex.org/W1496411490","https://openalex.org/W1528546869","https://openalex.org/W1554682999","https://openalex.org/W1568175246","https://openalex.org/W1577083826","https://openalex.org/W1594393406","https://openalex.org/W1603834604","https://openalex.org/W1608488823","https://openalex.org/W1632601927","https://openalex.org/W1723186713","https://openalex.org/W1892845116","https://openalex.org/W1970422301","https://openalex.org/W1979690402","https://openalex.org/W1980402871","https://openalex.org/W1999731981","https://openalex.org/W2007787872","https://openalex.org/W2010997912","https://openalex.org/W2011087880","https://openalex.org/W2026129593","https://openalex.org/W2029958010","https://openalex.org/W2033087107","https://openalex.org/W2036075346","https://openalex.org/W2053352956","https://openalex.org/W2056190725","https://openalex.org/W2063753743","https://openalex.org/W2080193201","https://openalex.org/W2096416100","https://openalex.org/W2096440680","https://openalex.org/W2107258648","https://openalex.org/W2113257089","https://openalex.org/W2114616381","https://openalex.org/W2122350220","https://openalex.org/W2122846259","https://openalex.org/W2123008124","https://openalex.org/W2128285524","https://openalex.org/W2137311341","https://openalex.org/W2137714578","https://openalex.org/W2142544818","https://openalex.org/W2144583323","https://openalex.org/W2149489849","https://openalex.org/W2151654592","https://openalex.org/W2154417273","https://openalex.org/W2157488300","https://openalex.org/W2165718261","https://openalex.org/W2169645448","https://openalex.org/W2222512263","https://openalex.org/W2294153305","https://openalex.org/W2401610261","https://openalex.org/W2964211993","https://openalex.org/W3149604617","https://openalex.org/W4210280015","https://openalex.org/W4233915855","https://openalex.org/W4252673810","https://openalex.org/W4299798129","https://openalex.org/W6629547660","https://openalex.org/W6633241960","https://openalex.org/W6634592827","https://openalex.org/W6636365345","https://openalex.org/W6637865423","https://openalex.org/W6674369575","https://openalex.org/W6681088732","https://openalex.org/W6682001992"],"related_works":["https://openalex.org/W2923452570","https://openalex.org/W206598027","https://openalex.org/W2978610750","https://openalex.org/W2022931285","https://openalex.org/W1589966275","https://openalex.org/W2086872282","https://openalex.org/W2137789903","https://openalex.org/W1592324786","https://openalex.org/W2534160330","https://openalex.org/W2153007255"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"multirobot":[3],"task":[4,60],"allocation":[5],"problems":[6,135],"where":[7],"the":[8,17,34,42,76,82,96,139,143],"estimated":[9],"costs":[10,36],"for":[11,134],"performing":[12],"tasks":[13],"are":[14],"interrelated,":[15],"and":[16,68,87],"overall":[18],"team":[19,47],"objective":[20],"need":[21],"not":[22],"be":[23],"a":[24,46,52,59,66,110],"standard":[25],"sum-of-costs":[26],"(or":[27],"utilities)":[28],"model,":[29],"enabling":[30],"straightforward":[31],"treatment":[32],"of":[33,51,54,136],"additional":[35],"incurred":[37],"by":[38],"resource":[39],"contention.":[40],"In":[41],"model":[43],"we":[44,99,120],"introduce,":[45],"may":[48],"choose":[49],"one":[50],"set":[53],"shared":[55],"resources":[56],"to":[57,64],"perform":[58],"(e.g.,":[61],"several":[62],"routes":[63],"reach":[65],"destination),":[67],"interference":[69],"is":[70,85],"modeled":[71],"when":[72],"multiple":[73],"robots":[74],"use":[75],"same":[77],"resource.":[78],"We":[79],"show":[80],"that":[81,129],"general":[83,97],"problem":[84],"NP-hard,":[86],"investigate":[88],"specialized":[89],"subinstances":[90],"with":[91,154],"particular":[92,123],"cost":[93],"structures.":[94],"For":[95],"problem,":[98],"describe":[100],"an":[101,106,126,146],"exact":[102],"algorithm":[103,148],"which":[104],"finds":[105],"optimal":[107],"assignment":[108],"in":[109],"reasonable":[111],"time":[112],"on":[113],"small":[114],"instances.":[115],"Aiming":[116],"at":[117],"larger":[118],"problems,":[119],"turn":[121],"two":[122,127],"subinstances,":[124],"introducing":[125],"algorithms":[128],"find":[130],"assignments":[131],"quickly":[132],"even":[133],"considerable":[137],"size,":[138],"first":[140],"being":[141,145],"optimal,":[142],"second":[144],"approximation":[147],"but":[149],"also":[150],"producing":[151],"high-quality":[152],"solutions":[153],"bounded":[155],"suboptimality.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}