2024
Computation-Aware Multi-object Search in 3D Space using Submodular Tree
ICRA 2024poster
Searching for targets in 3D environments can be formulated as submodular maximization problems with routing constraints. However, it involves solving two NP-hard problems: the maximal coverage problem and the traveling salesman problem. Since the time constraint is critical for search problems, this…