{"id":"https://openalex.org/W2892376036","doi":"https://doi.org/10.1109/icra.2018.8461040","title":"Algorithm for Optimal Chance Constrained Knapsack Problem with Applications to Multi-Robot Teaming","display_name":"Algorithm for Optimal Chance Constrained Knapsack Problem with Applications to Multi-Robot Teaming","publication_year":2018,"publication_date":"2018-05-01","ids":{"openalex":"https://openalex.org/W2892376036","doi":"https://doi.org/10.1109/icra.2018.8461040","mag":"2892376036"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2018.8461040","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2018.8461040","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 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/A5102023865","display_name":"Fan Yang","orcid":"https://orcid.org/0009-0001-0601-3334"},"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":["Mechanical Engineering Department, Stony Brook University"],"affiliations":[{"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":["Mechanical Engineering Department, Stony Brook University"],"affiliations":[{"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/A5102023865"],"corresponding_institution_ids":["https://openalex.org/I59553526"],"apc_list":null,"apc_paid":null,"fwci":1.4763,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.84442533,"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":"1043","last_page":"1049"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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.9998000264167786,"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.9987999796867371,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9958999752998352,"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.9917924404144287},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.7492492198944092},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7025577425956726},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.556627631187439},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.5224838852882385},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5149415135383606},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47819092869758606},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.4689820408821106},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.42918241024017334},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38640254735946655}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9917924404144287},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7492492198944092},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7025577425956726},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.556627631187439},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.5224838852882385},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5149415135383606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47819092869758606},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.4689820408821106},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42918241024017334},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38640254735946655}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2018.8461040","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2018.8461040","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1506734247","https://openalex.org/W1976174751","https://openalex.org/W2011565421","https://openalex.org/W2013304545","https://openalex.org/W2027111774","https://openalex.org/W2037684294","https://openalex.org/W2041025394","https://openalex.org/W2066671865","https://openalex.org/W2090314309","https://openalex.org/W2096615883","https://openalex.org/W2108088553","https://openalex.org/W2109336437","https://openalex.org/W2119064613","https://openalex.org/W2120268911","https://openalex.org/W2122967662","https://openalex.org/W2156293131","https://openalex.org/W2165622730","https://openalex.org/W2294586855","https://openalex.org/W2462276508","https://openalex.org/W2506642202","https://openalex.org/W2611804663","https://openalex.org/W2738761080","https://openalex.org/W3134267570","https://openalex.org/W6673028102","https://openalex.org/W6674495725","https://openalex.org/W6677757552"],"related_works":["https://openalex.org/W2889442766","https://openalex.org/W2412614002","https://openalex.org/W2087209118","https://openalex.org/W2005493932","https://openalex.org/W2993365626","https://openalex.org/W2381035939","https://openalex.org/W2089402478","https://openalex.org/W2168163332","https://openalex.org/W1969981152","https://openalex.org/W2122137596"],"abstract_inverted_index":{"Motivated":[0],"by":[1,113],"applications":[2],"in":[3,7,98],"multirobot":[4,131],"team":[5,132],"selection,":[6],"this":[8,25],"paper,":[9],"we":[10,102],"present":[11,103,176],"a":[12,58,104,115,130,137,167],"novel":[13,105],"algorithm":[14,128],"for":[15],"computing":[16],"optimal":[17,111],"solution":[18,112],"of":[19,27,39,79,88,93,117,143,194,199],"chance-constrained":[20,54,95],"0-1":[21],"knapsack":[22,29,47,55,96,119,123],"problem.":[23],"In":[24],"variation":[26],"the":[28,31,37,40,46,53,64,71,82,86,89,94,99,141,144,150,158,192,200],"problem,":[30],"objective":[32],"function":[33],"is":[34,49,146,166,188],"deterministic":[35,106,118],"but":[36],"weights":[38],"items":[41,80],"are":[42],"stochastic":[43],"and":[44,157,173,196],"therefore":[45],"constraint":[48],"stochastic.":[50],"We":[51,125,175],"convert":[52],"problem":[56,62,97,134],"to":[57,81,108,129,135,183],"two-dimensional":[59],"discrete":[60],"optimization":[61],"on":[63,70,179],"variance-mean":[65,100],"plane,":[66,101],"where":[67,140],"each":[68,152],"point":[69],"plane":[72],"can":[73,155,164,205],"be":[74],"identified":[75],"with":[76,190],"an":[77,110,161,202],"assignment":[78],"knapsack.":[83],"By":[84],"exploiting":[85],"geometry":[87],"non-convex":[90],"feasible":[91],"region":[92],"technique":[107],"find":[109],"solving":[114],"sequence":[116],"problems":[120],"(called":[121],"risk-averse":[122],"problem).":[124],"apply":[126],"our":[127,186],"selection":[133],"cover":[136],"given":[138],"route,":[139],"length":[142,151,159],"route":[145],"much":[147],"larger":[148],"than":[149],"individual":[153,162,203],"robot":[154,163,204],"fly":[156,165],"that":[160,185],"random":[168],"variable":[169],"(with":[170],"known":[171],"mean":[172],"variance).":[174],"simulation":[177],"results":[178],"randomly":[180],"generated":[181],"data":[182],"demonstrate":[184],"approach":[187],"scalable":[189],"both":[191],"number":[193],"robots":[195],"increasing":[197],"uncertainty":[198],"distance":[201],"travel.":[206]},"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":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}