Robert H. Chen

The Matroid Team Surviving Orienteers problem: Constrained routing of heterogeneous teams with risky traversal

Consider a setting where robots must visit sites represented as nodes in a graph, but each robot may fail when traversing an edge. The goal is to find a set of paths for a team of robots which maximizes the expected number of nodes collectively visited, while guaranteeing that the paths satisfy a no…