{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T10:57:08Z","timestamp":1757588228502,"version":"3.28.0"},"reference-count":43,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T00:00:00Z","timestamp":1603497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T00:00:00Z","timestamp":1603497600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T00:00:00Z","timestamp":1603497600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,10,24]]},"DOI":"10.1109\/iros45743.2020.9341726","type":"proceedings-article","created":{"date-parts":[[2021,2,13]],"date-time":"2021-02-13T02:26:48Z","timestamp":1613183208000},"page":"4329-4336","source":"Crossref","is-referenced-by-count":6,"title":["Algorithm for Multi-Robot Chance-Constrained Generalized Assignment Problem with Stochastic Resource Consumption"],"prefix":"10.1109","author":[{"given":"Fan","family":"Yang","sequence":"first","affiliation":[{"name":"Stony Brook University,Mechanical Engineering Department"}]},{"given":"Nilanjan","family":"Chakraborty","sequence":"additional","affiliation":[{"name":"Stony Brook University,Mechanical Engineering Department"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2010.01.003"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814632"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1980.189"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1287\/opre.38.5.820"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3220400203"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-642-40328-6_2","article-title":"The online stochastic generalized assignment problem","author":"alaei","year":"2013","journal-title":"Approximation Randomization and Combinatorial Optimization Algorithms and Techniques"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258661"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.127"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1080.0330"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1287\/opre.46.1.17"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2014.2370831"},{"key":"ref40","first-page":"1286","article-title":"Boolean function analysis meets stochastic optimization: an approximation scheme for stochastic knapsack","author":"de","year":"2018","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2005.I.045"},{"key":"ref12","article-title":"Auction mechanism design for multi-robot coordination","author":"bererton","year":"2003","journal-title":"NIPS"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.876939"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2009.2022423"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2438032"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1177\/0278364904045564"},{"key":"ref17","article-title":"A survey of multi-robot task allocation","author":"mosteo","year":"2010","journal-title":"Instituto de Investigacin en Ingeniera de Aragn (I3A) Tech Rep"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2016.10.008"},{"key":"ref19","first-page":"193","article-title":"Analyzing the sensitivity of the optimal assignment in probabilistic multi-robot task allocation","volume":"2","author":"nam","year":"2017","journal-title":"IEEE l of Robotics and Automation"},{"key":"ref28","article-title":"A stochastic generalized assignment problem","author":"spoerl","year":"2004","journal-title":"Department of Operations Research Naval Postgraduate School Monterey California 93943 USA Tech Rep"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580430"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.01.035"},{"key":"ref3","article-title":"Distributed algorithm design for multi-robot generalized task assignment problem","author":"luo","year":"2013","journal-title":"Proceedings of International Conference on Intelligent Robots and Systems (IROS)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585178"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.07.015"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.6.831"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109624"},{"key":"ref7","first-page":"213","article-title":"A ptas for the multiple knapsack problem","author":"chekuri","year":"2001","journal-title":"Proc of SODA"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.06.003"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8461040"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717754"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-3-030-05816-6_22","article-title":"Redundant robot assignment on graphs with uncertain edge costs","author":"prorok","year":"2019","journal-title":"Distributed Autonomous Robotic Systems"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2013.6580329"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2012.6315626"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15369-3_26"},{"key":"ref24","article-title":"An approximation algorithm for risk-averse submodular optimization","author":"zhou","year":"2018","journal-title":"2018 International Workshop on the Algorithmic Foundations of Robotics (WAFR)"},{"key":"ref41","first-page":"72:1","article-title":"A Relaxed FPTAS for ChanceConstrained Knapsack","volume":"123","author":"shabtai","year":"2018","journal-title":"29th International Symposium on Algorithms and Computation (ISAAC 2018)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989099"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF02628554"},{"key":"ref43","article-title":"The knapsack problem and fully polynomial time approximation schemes","author":"lai","year":"2006","journal-title":"Massachusetts Institute of Technology Department of Mathematics Tech Rep"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197354"}],"event":{"name":"2020 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","start":{"date-parts":[[2020,10,24]]},"location":"Las Vegas, NV, USA","end":{"date-parts":[[2021,1,24]]}},"container-title":["2020 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9340668\/9340635\/09341726.pdf?arnumber=9341726","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T21:54:45Z","timestamp":1656453285000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9341726\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,24]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/iros45743.2020.9341726","relation":{},"subject":[],"published":{"date-parts":[[2020,10,24]]}}}