The matroid team surviving orienteers problem and its variants: Constrained routing of heterogeneous teams with risky traversal

INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH(2024)

引用 0|浏览4
暂无评分
摘要
Consider deploying a team of robots in order to visit sites in a risky environment (i.e., where a robot might be lost during a traversal), subject to team-based operational constraints such as limits on team composition, traffic throughputs, and launch constraints. We formalize this problem using a graph to represent the environment, enforcing probabilistic survival constraints for each robot, and using a matroid (which generalizes linear independence to sets) to capture the team-based operational constraints. The resulting "Matroid Team Surviving Orienteers" (MTSO) problem has broad applications for robotics such as informative path planning, resource delivery, and search and rescue. We demonstrate that the objective for the MTSO problem has submodular structure, which leads us to develop two polynomial time algorithms which are guaranteed to find a solution with value within a constant factor of the optimum. The second of our algorithms is an extension of the accelerated continuous greedy algorithm, and can be applied to much broader classes of constraints while maintaining bounds on suboptimality. In addition to in-depth analysis, we demonstrate the efficiency of our approaches by applying them to a scenario where a team of robots must gather information while avoiding dangers in the Coral Triangle and characterize scaling and parameter selection using a synthetic dataset.
更多
查看译文
关键词
Submodular optimization,matroid constraints,path planning,multi-robot control
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络