Congestion-Aware Policy Synthesis for Multirobot Systems

摘要

Multirobot systems must be able to maintain performance when robots get delayed during execution. For mobile robots, one source of delays is <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">congestion</i> . Congestion occurs when robots deployed in shared physical spaces interact, as robots present in the same area simultaneously must maneuver to avoid each other. Congestion can adversely affect navigation performance and increase the duration of navigation actions. In this article, we present a multirobot planning framework that utilizes learnt probabilistic models of how congestion affects navigation duration. Central to our framework is a <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">probabilistic reservation table</i> , which summarizes robot plans, capturing the effects of congestion. To plan, we solve a sequence of single-robot <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">time-varying Markov automata</i> , where transition probabilities and rates are obtained from the probabilistic reservation table. We also present an iterative model refinement procedure for accurately predicting execution-time robot performance. We evaluate our framework with extensive experiments on synthetic data and simulated robot behavior.