4 accepted papers
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…
Map exploration in unknown environments is the key to various robotics applications (e.g., 3D reconstruction, search and rescue). However, finding the optimal path to maximize the environmental coverage is NP-hard. To overcome this problem, this research proposes a dynamic generalized cost-benefit (
Efficient task allocation is a challenge for multirobot search. The multi-robot search problem is reformulated as submodular maximization subject to intersection system constraints. The objective function is submodular and consists of a coverage function to cover environments and a balancing functio…
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