{"id":"https://openalex.org/W3132250512","doi":"https://doi.org/10.1109/iros45743.2020.9341726","title":"Algorithm for Multi-Robot Chance-Constrained Generalized Assignment Problem with Stochastic Resource Consumption","display_name":"Algorithm for Multi-Robot Chance-Constrained Generalized Assignment Problem with Stochastic Resource Consumption","publication_year":2020,"publication_date":"2020-10-24","ids":{"openalex":"https://openalex.org/W3132250512","doi":"https://doi.org/10.1109/iros45743.2020.9341726","mag":"3132250512"},"language":"en","primary_location":{"id":"doi:10.1109/iros45743.2020.9341726","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros45743.2020.9341726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/A5102023862","display_name":"Fan Yang","orcid":"https://orcid.org/0000-0002-1271-2705"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Fan Yang","raw_affiliation_strings":["Stony Brook University,Mechanical Engineering Department","Mechanical Engineering Department, Stony Brook University"],"affiliations":[{"raw_affiliation_string":"Stony Brook University,Mechanical Engineering Department","institution_ids":["https://openalex.org/I59553526"]},{"raw_affiliation_string":"Mechanical Engineering Department, Stony Brook University","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101455544","display_name":"Nilanjan Chakraborty","orcid":"https://orcid.org/0000-0003-0574-3041"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nilanjan Chakraborty","raw_affiliation_strings":["Stony Brook University,Mechanical Engineering Department","Mechanical Engineering Department, Stony Brook University"],"affiliations":[{"raw_affiliation_string":"Stony Brook University,Mechanical Engineering Department","institution_ids":["https://openalex.org/I59553526"]},{"raw_affiliation_string":"Mechanical Engineering Department, Stony Brook University","institution_ids":["https://openalex.org/I59553526"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102023862"],"corresponding_institution_ids":["https://openalex.org/I59553526"],"apc_list":null,"apc_paid":null,"fwci":0.9251,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.78087549,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"4329","last_page":"4336"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"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.9986000061035156,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9937999844551086,"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/knapsack-problem","display_name":"Knapsack problem","score":0.9277581572532654},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.8331112265586853},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7103886008262634},{"id":"https://openalex.org/keywords/weapon-target-assignment-problem","display_name":"Weapon target assignment problem","score":0.5655511021614075},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.564552903175354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5394066572189331},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4414232671260834},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4408726394176483},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.4373059868812561},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.4318614602088928},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3946376442909241},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28609326481819153},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2032952904701233},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08109733462333679}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9277581572532654},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.8331112265586853},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7103886008262634},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.5655511021614075},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.564552903175354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5394066572189331},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4414232671260834},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4408726394176483},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4373059868812561},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.4318614602088928},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3946376442909241},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28609326481819153},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2032952904701233},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08109733462333679},{"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/iros45743.2020.9341726","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros45743.2020.9341726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6299999952316284,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W56687990","https://openalex.org/W1506734247","https://openalex.org/W1707207708","https://openalex.org/W1825072153","https://openalex.org/W1966079129","https://openalex.org/W1976174751","https://openalex.org/W1996837595","https://openalex.org/W2013198217","https://openalex.org/W2013304545","https://openalex.org/W2014369282","https://openalex.org/W2014423113","https://openalex.org/W2020030076","https://openalex.org/W2020313791","https://openalex.org/W2037684294","https://openalex.org/W2041025394","https://openalex.org/W2059961050","https://openalex.org/W2070561923","https://openalex.org/W2090314309","https://openalex.org/W2090775737","https://openalex.org/W2092021991","https://openalex.org/W2096615883","https://openalex.org/W2103001076","https://openalex.org/W2109336437","https://openalex.org/W2120268911","https://openalex.org/W2126366668","https://openalex.org/W2142544818","https://openalex.org/W2144827113","https://openalex.org/W2148849245","https://openalex.org/W2157488300","https://openalex.org/W2158760370","https://openalex.org/W2167723074","https://openalex.org/W2373591242","https://openalex.org/W2462276508","https://openalex.org/W2467020497","https://openalex.org/W2537545174","https://openalex.org/W2738761080","https://openalex.org/W2883906040","https://openalex.org/W2891317153","https://openalex.org/W2892376036","https://openalex.org/W2907646362","https://openalex.org/W2963823584","https://openalex.org/W3022966133","https://openalex.org/W3090344418","https://openalex.org/W4234897719","https://openalex.org/W4239749705","https://openalex.org/W4240196045","https://openalex.org/W6653593260","https://openalex.org/W6673028102","https://openalex.org/W6675210803","https://openalex.org/W6684701531","https://openalex.org/W6718747770","https://openalex.org/W6746527153","https://openalex.org/W6753396549","https://openalex.org/W6757739353"],"related_works":["https://openalex.org/W4288642040","https://openalex.org/W2889442766","https://openalex.org/W2908214350","https://openalex.org/W2089402478","https://openalex.org/W2412614002","https://openalex.org/W2020030076","https://openalex.org/W2087209118","https://openalex.org/W2381035939","https://openalex.org/W591981591","https://openalex.org/W2068132295"],"abstract_inverted_index":{"We":[0,109,144,190],"present":[1,191],"a":[2,22,31,38,47,60,114,141,162],"novel":[3],"algorithm":[4,148,175,198],"for":[5,45,98,149],"the":[6,42,56,76,82,95,111,122,134,180,202],"multi-robot":[7],"generalized":[8,124,136],"assignment":[9,74,125,137],"problem":[10,112,118,126,129,165,183],"(GAP)":[11],"with":[12,63,105,201],"stochastic":[13],"resource":[14,23,35,43,57,96],"consumption.":[15],"In":[16,40],"this":[17],"problem,":[18,138],"each":[19,99,154],"robot":[20,93,100,155],"has":[21,101],"(e.g.,":[24],"battery":[25],"life)":[26],"constraint":[27,97],"and":[28,66,94,119,206],"it":[29,121],"consumes":[30],"certain":[32],"amount":[33],"of":[34,75,133,173,204],"to":[36,71,78,89,102,194],"perform":[37],"task.":[39],"practice,":[41],"consumed":[44],"performing":[46],"task":[48,86],"can":[49],"be":[50,103],"uncertain.":[51],"Therefore,":[52],"we":[53],"assume":[54],"that":[55,80,179,196],"consumption":[58],"is":[59,70,87,130,140,176,184,199],"random":[61],"variable":[62],"known":[64],"mean":[65],"variance.":[67],"The":[68,170],"objective":[69,159],"find":[72],"an":[73,131,146,167,187],"robots":[77,205],"tasks":[79],"maximizes":[81,156],"team":[83],"payoff.":[84],"Each":[85],"assigned":[88],"at":[90],"most":[91],"one":[92],"satisfied":[104],"very":[106],"high":[107],"probability.":[108],"formulate":[110],"as":[113],"chance-constrained":[115,123,163],"combinatorial":[116],"optimization":[117],"call":[120],"(CC-GAP).":[127],"This":[128],"extension":[132],"deterministic":[135,181],"which":[139,153],"NP-hard":[142],"problem.":[143],"design":[145],"iterative":[147,168],"solving":[150,161],"CC-GAP":[151],"in":[152,166],"its":[157],"own":[158],"by":[160,186],"knapsack":[164,182],"manner.":[169],"approximation":[171],"ratio":[172],"our":[174,197],"(1+\u03b1),":[177],"assuming":[178],"solved":[185],"\u03b1-approximation":[188],"algorithm.":[189],"simulation":[192],"results":[193],"demonstrate":[195],"scalable":[200],"number":[203],"tasks.":[207]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}