2023
Improvement of Submodular Maximization Problems With Routing Constraints via Submodularity and Fourier Sparsity
RA-L 2023
Various robotic problems (e.g., map exploration, environmental monitoring and spatial search) can be formulated as submodular maximization problems with routing constraints. These problems involve two NP-hard problems, maximal coverage and traveling salesman problems. The generalized cost-benefit al