Risk-Aware Submodular Optimization for Multi-Robot Coordination

03/23/2020
by   Lifeng Zhou, et al.
0

We study the problem of incorporating risk while making combinatorial decisions under uncertainty. We formulate a discrete submodular maximization problem for selecting a set using Conditional-Value-at-Risk (CVaR), a risk metric commonly used in financial analysis. While CVaR has recently been used in optimization of linear cost functions in robotics, we take the first step towards extending this to discrete submodular optimization and provide several positive results. Specifically, we propose the Sequential Greedy Algorithm that provides an approximation guarantee on finding the maxima of the CVaR cost function under a matroidal constraint. The approximation guarantee shows that the solution produced by our algorithm is within a constant factor of the optimal and an additive term that depends on the optimal. Our analysis uses the curvature of the submodular set function, and proves that the algorithm runs in polynomial time. This formulates a number of combinatorial optimization problems that appear in robotics. We use two such problems, vehicle assignment under uncertainty for mobility-on-demand and sensor selection with failures for environmental monitoring, as case studies to demonstrate the efficacy of our formulation. In particular, for the mobility-on-demand study, we propose an online triggering assignment algorithm that triggers a new assignment only can potentially lead to reducing the waiting time at demand locations. We verify the performance of the Sequential Greedy Algorithm and the online triggering assignment algorithm through simulations.

READ FULL TEXT

page 1

page 4

page 11

research
07/24/2018

An Approximation Algorithm for Risk-averse Submodular Optimization

We study the problem of incorporating risk while making combinatorial de...
research
11/02/2020

Risk-Aware Submodular Optimization for Multi-objective Travelling Salesperson Problem

We introduce a risk-aware multi-objective Traveling Salesperson Problem ...
research
11/17/2021

Submodular Optimization for Coupled Task Allocation and Intermittent Deployment Problems

In this paper, we demonstrate a formulation for optimizing coupled submo...
research
04/13/2018

Supermodular Optimization for Redundant Robot Assignment under Travel-Time Uncertainty

This paper considers the assignment of multiple mobile robots to goal lo...
research
10/30/2017

How Should a Robot Assess Risk? Towards an Axiomatic Theory of Risk in Robotics

Endowing robots with the capability of assessing risk and making risk-aw...
research
03/31/2020

Robust Multiple-Path Orienteering Problem: Securing Against Adversarial Attacks

The multiple-path orienteering problem asks for paths for a team of robo...
research
05/18/2020

Optimal target assignment for massive spectroscopic surveys

Robotics have recently contributed to cosmological spectroscopy to autom...

Please sign up or login with your details

Forgot password? Click here to reset