{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T05:10:04Z","timestamp":1748495404846,"version":"3.41.0"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"A*STAR","award":["C221518004","SC36\/19-000801-A041"],"award-info":[{"award-number":["C221518004","SC36\/19-000801-A041"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Robot."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tro.2025.3567478","type":"journal-article","created":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T17:07:12Z","timestamp":1746551232000},"page":"3385-3401","source":"Crossref","is-referenced-by-count":0,"title":["R-FAC: Resilient Value Function Factorization for Multirobot Efficient Search With Individual Failure Probabilities"],"prefix":"10.1109","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9836-3090","authenticated-orcid":false,"given":"Hongliang","family":"Guo","sequence":"first","affiliation":[{"name":"Institute for Infocomm Research (I2R), Agency for Science, Technology and Research (A*STAR), Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1634-506X","authenticated-orcid":false,"given":"Qi","family":"Kang","sequence":"additional","affiliation":[{"name":"Institute for Infocomm Research (I2R), Agency for Science, Technology and Research (A*STAR), Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5709-9169","authenticated-orcid":false,"given":"Wei-Yun","family":"Yau","sequence":"additional","affiliation":[{"name":"Institute for Infocomm Research (I2R), Agency for Science, Technology and Research (A*STAR), Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6396-4371","authenticated-orcid":false,"given":"Chee-Meng","family":"Chew","sequence":"additional","affiliation":[{"name":"National University of Singapore (NUS), Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5473-3566","authenticated-orcid":false,"given":"Daniela","family":"Rus","sequence":"additional","affiliation":[{"name":"Computer Science, and Artificial Intelligence Laboratory (CSAIL), Massachusetts Institute of Technology (MIT), Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2023.3263459"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/0278364908099853"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-37841-7_11"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIE.2018.8433772"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561550"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-010-9189-9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2022.3188904"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ROBIO54168.2021.9739257"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FUZZ-IEEE55066.2022.9882685"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3068952"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-017-9681-6"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2019.01.017"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1549\/2\/022104"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2006.282575"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.3017473"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-016-2145-0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jngse.2020.103636"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.3390\/app9224964"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICUAS.2019.8798127"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1142\/S021848851950020X"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9812083"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/IROS45743.2020.9340839"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICUS52573.2021.9641362"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05816-6_18"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/UEMCON.2016.7777836"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.06.031"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3062798"},{"key":"ref28","first-page":"1","article-title":"A multi-robot task assignment framework for search and rescue with heterogeneous teams","volume-title":"Proc. IEEE\/RSJ Int. Conf. Intell. Robots Syst. Adv. Multi-Agent Learn.-Coordination, Percep., Control Workshop","author":"Osooli","year":"2023"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.3390\/app11052383"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9982022"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.01.023"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s40998-019-00245-z"},{"key":"ref33","first-page":"278","article-title":"Game-theoretic utility tree for multi-robot cooperative pursuit strategy","volume-title":"Proc. 54th Int. Symp. Robot.","author":"Yang","year":"2022"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-022-01780-4"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2021.3104253"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-022-04105-y"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-021-09996-w"},{"issue":"PMLR","key":"ref38","first-page":"4295","article-title":"QMIX: Monotonic value function factorisation for deep multi-agent reinforcement learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Rashid","year":"2018"},{"key":"ref39","first-page":"2085","article-title":"Value-decomposition networks for cooperative multi-agent learning based on team reward","volume-title":"Proc. Int. Conf. Auton. Agents MultiAgent Syst.","author":"Sunehag","year":"2018"},{"issue":"178","key":"ref40","first-page":"1","article-title":"Weighted QMIX: Expanding monotonic value function factorisation for deep multi-agent reinforcement learning","volume":"21","author":"Rashid","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref41","article-title":"QPLEX: Duplex dueling multi-agent Q-learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Wang","year":"2021"},{"key":"ref42","first-page":"5887","article-title":"QTRAN: Learning to factorize with transformation for cooperative multi-agent reinforcement learning","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","volume":"97","author":"Son","year":"2019"},{"key":"ref43","first-page":"6380","article-title":"Multi-agent actor-critic for mixed cooperative-competitive environments","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Lowe","year":"2017"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11794"},{"key":"ref45","first-page":"24611","article-title":"The surprising effectiveness of PPO in cooperative multi-agent games","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yu","year":"2022"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28929-8"},{"volume-title":"Reinforcement Learning: An Introduction","year":"2018","author":"Sutton","key":"ref47"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuron.2006.06.027"},{"key":"ref49","article-title":"Empirical evaluation of gated recurrent neural networks on sequence modeling","volume-title":"Proc. NIPS 2014 Workshop Deep Learn.","author":"Chung","year":"2014"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","year":"1979","author":"Garey","key":"ref53"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3274667"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3172168"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TIV.2022.3151665"}],"container-title":["IEEE Transactions on Robotics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8860\/10778592\/10989574.pdf?arnumber=10989574","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T04:36:25Z","timestamp":1748493385000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10989574\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":56,"URL":"https:\/\/doi.org\/10.1109\/tro.2025.3567478","relation":{},"ISSN":["1552-3098","1941-0468"],"issn-type":[{"type":"print","value":"1552-3098"},{"type":"electronic","value":"1941-0468"}],"subject":[],"published":{"date-parts":[[2025]]}}}