The Team Surviving Orienteers problem: routing teams of robots in uncertain environments with survival constraints

  title={The Team Surviving Orienteers problem: routing teams of robots in uncertain environments with survival constraints},
  author={Stefan Jorgensen and Robert H. Chen and Mark B. Milam and Marco Pavone},
  journal={Autonomous Robots},
We study the following multi-robot coordination problem: given a graph, where each edge is weighted by the probability of surviving while traversing it, find a set of paths for K robots that maximizes the expected number of nodes collectively visited, subject to constraints on the probabilities that each robot survives to its destination. We call this the Team Surviving Orienteers (TSO) problem, which is motivated by scenarios where a team of robots must traverse a dangerous environment, such… 

For Peer Review The Matroid Team Surviving Orienteers Problem and its Variants : Constrained Routing of Heterogeneous Teams with Risky Traversal

The objective for the MTSO problem has submodular structure, which leads to two polynomial time algorithms which are guaranteed to find a solution with value within a constant factor of the optimum, and can be applied to much broader classes of constraints while maintaining bounds on suboptimality.

Optimal Routing Schedules for Robots Operating in Aisle-Structures

The optimal solutions for COP-FR and COP-SC turn out to be competitive in terms of achieved rewards even for COP, and a new heuristic for the general case outperforms state-of-art algorithms, especially for input with highly unbalanced rewards.

Speeding-up Routing Schedules on Aisle-Graphs

This paper proposes four algorithms that iteratively build the OASP for constrained aisle-graphs composed by m rows of length n in at most $\mathcal{O}(mn(m + n))$ time, thus improving the optimal solution by a factor of n.

Multi-Robot Coordination and Planning in Uncertain and Adversarial Environments

This report reviews recent algorithmic development in making multi-robot systems robust to environmental uncertainties, failures, and adversarial attacks and finds resilient coordination to either withstand failures and/or attack or recover from failures/attacks.

Energy-Aware, Collision-Free Information Gathering for Heterogeneous Robot Teams

This work proposes a hierarchical approach with a distributed planner that uses local search with a worst-case performance guarantees and a decentralized controller based on control barrier functions that ensures safety and encourages timely arrival at sensing locations.

Risk-aware Collection Strategies for Multirobot Foraging in Hazardous Environments

This study addresses the challenges of foraging robots in two fundamental environmental settings: homogeneous and heterogeneous cases, and proposes an exact foraging task allocation algorithm, and grafts it to another exactForaging task execution algorithm to find an optimal solution within the polynomial time.

Speeding up Routing Schedules on Aisle Graphs With Single Access

In this article, we study the orienteering aisle-graph single-access problem (OASP), a variant of the orienteering problem for a robot moving in a so-called <italic>single-access aisle

Non-Monotone Energy-Aware Information Gathering for Heterogeneous Robot Teams

The proposed distributed planning approach based on local search saves up to 60% communication and 80–92% computation on average when coordinating up to 10 robots, while outperforming the coordinate descent based algorithm in achieving a desirable trade-off between sensing and energy cost.

Risk-Aware Submodular Optimization for Multirobot Coordination

This work proposes the sequential greedy algorithm that provides an approximation guarantee on finding the maxima of the CVaR cost function under a matroid constraint and designs a heuristic solution that triggers the replanning only when certain conditions are satisfied, to eliminate unnecessary planning.

A clustering metaheuristic for large orienteering problems

This work proposes a multi-stage clustering-based metaheuristic that aims to dramatically improve the computation time of a given Orienteering Problem algorithm without a significant decrease in the solution quality of that algorithm, especially for large Orienteering Problems.



The Team Surviving Orienteers Problem: Routing Robots in Uncertain Environments with Survival Constraints

This work proposes an approximate greedy approach for selecting paths, and proves that the value of its output is within a factor 1 –e–ps/λ of the optimum where ps is the per-robot survival probability threshold and 1/λ ≤ 1 is the approximation factor of an oracle routine for the well-known orienteering problem.

Approximation algorithms for stochastic orienteering

A constant-factor approximation algorithm for the best non-adaptive policy for the Stochastic Orienteering problem and shows a small adaptivity gap, and addresses the case when the node rewards are also random and could be correlated with the waiting time.

A Framework For Probabilistic Vehicle Routing

This paper investigates solution procedures for the case where other appropriate probability distributions are assumed and develops an efficient heuristic solution procedure which was quite effective in generating an excellent set of fixed vehicle routes.

Optimization Approaches for Solving Chance Constrained Stochastic Orienteering Problems

This paper contributes a scalable mixed integer LP formulation for solving risk aware SOPs, which is a principled approximation of the underlying stochastic optimization problem.

Iterated local search for the team orienteering problem with time windows

Orienteering Problem: A survey of recent variants, solution approaches and applications

Submodular Optimization with Routing Constraints

This work proposes a generalized cost-benefit (GCB) greedy algorithm for the submodular optimization problem, and proves bi-criterion approximation guarantees under significantly weaker assumptions than those in related literature.

A recursive greedy algorithm for walks in directed graphs

  • C. ChekuriMartin Pál
  • Computer Science, Mathematics
    46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
  • 2005
An O(log OPT) approximation is obtained for a generalization of the orienteering problem in which the profit for visiting each node may vary arbitrarily with time and the implications for the approximability of several basic optimization problems are interesting.