R-FAC: Resilient Value Function Factorization for Multirobot Efficient Search With Individual Failure Probabilities

Page view(s)
0
Checked on
R-FAC: Resilient Value Function Factorization for Multirobot Efficient Search With Individual Failure Probabilities
Title:
R-FAC: Resilient Value Function Factorization for Multirobot Efficient Search With Individual Failure Probabilities
Journal Title:
IEEE Transactions on Robotics
Publication Date:
06 May 2025
Citation:
Guo, H., Kang, Q., Yau, W.-Y., Chew, C.-M., & Rus, D. (2025). R-FAC: Resilient Value Function Factorization for Multirobot Efficient Search With Individual Failure Probabilities. IEEE Transactions on Robotics, 41, 3385–3401. https://doi.org/10.1109/tro.2025.3567478
Abstract:
This article investigates the resilient multirobot efficient search problem (R-MuRES), which aims at coordinating multiple robots to detect a “nonadversarial” moving target with the minimal expected time. One unique characteristic of R-MuRES among others is the possibility of individual robot's malfunction and withdrawal from the team during task execution, which results in a variable number of searchers in the deployment phase and entails that the possibility of team member failures must be considered during the planning stage, particularly in the training phase. We propose a resilient value function factorization (R-FAC) paradigm, which constructs the central value function from individual ones in a resilient manner, taking into account individual robots' failures, and ensures that the constructed central value function has the minimal mean squared temporal difference error across various team compositions. R-FAC stipulates that the individual global maximum principle is satisfied for whichever team configuration and thus any functioning robot contributes positively to the remaining team, as long as it executes the greedy policy with respect to the factorized individual value function. Subsequently, we introduce the variational value decomposition network (V2DN) as one of the instantiated R-FAC algorithms. V2DN employs the log-sum-exp mechanism to construct the central value function from individual ones, enabling it to take a varying number of robots' individual value functions as inputs. Then, we explain why, specifically for the multirobot search task, the log-sum-exp mechanism is superior to the brute-force summation operation used in the canonical value decomposition network (VDN), and compare V2DN with state-of-the-art MuRES solutions as well as the vanilla VDN algorithm in two canonical MuRES testing environments and show that it achieves the best resiliency score when one or several individual robots quit the team during task execution. Furthermore, we validate V2DN with a real multirobot system in a self-constructed indoor environment as the proof of concept.
License type:
Publisher Copyright
Funding Info:
This research / project is supported by the ASTAR - Robotics Horizontal Technology Coordinating Office
Grant Reference no. : C221518004

This research / project is supported by the ASTAR - Venture Creation & Growth
Grant Reference no. : SC36/19-000801-A041
Description:
© 2025 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
ISSN:
1552-3098
1941-0468
Files uploaded:

File Size Format Action
guoh-r-fac-preprint.pdf 4.13 MB PDF Open