Multi-robot search in 3D environments using submodularity with matroid intersection constraints
The International Journal of Robotics Research
Published online on October 16, 2025
Abstract
The International Journal of Robotics Research, Ahead of Print.
The multi-robot search problem is challenging since it involves task allocation, minimal routing, and maximal coverage problems, which are NP-hard. To solve this problem with theoretical guarantees, it is reformulated as a maximal coverage problem subject ...
The multi-robot search problem is challenging since it involves task allocation, minimal routing, and maximal coverage problems, which are NP-hard. To solve this problem with theoretical guarantees, it is reformulated as a maximal coverage problem subject ...