Assessing optimal assignment under uncertainty: An interval-based algorithm

doi:10.1177/0278364911404579

Return

Assessing optimal assignment under uncertainty: An interval-based algorithm

2011-06-03

Lantao Liu *

Dylan A. Shell

DOI：10.1177/0278364911404579

Original

Save

View PDF

Abstract

En 中文

We consider the problem of multi-robot task-allocation when robots have to deal with uncertain utility estimates. Typically an allocation is performed to maximize expected utility; we consider a means for measuring the robustness of a given optimal allocation when robots have some measure of the uncertainty (e.g. a probability distribution, or moments of such distributions). We introduce the interval Hungarian algorithm, a new algorithm that extends the classic Kuhn-Munkres Hungarian algorithm to compute the maximum interval of deviation, for each entry in the assignment matrix, which will retain the same optimal assignment. The algorithm has a worst-case time complexity of O(n(4)); we also introduce a parallel variant with O(n(3)) running time, which is able to exploit the concurrent computing capabilities of distributed multi-robot systems. This provides an efficient measurement of the tolerance of the allocation to the uncertainties and dynamics, for both a specific interval and a set of interrelated intervals. We conduct experiments both in simulation and with physical robots to validate the approach and to gain insight into the effect of location uncertainty on allocations for multi-robot multi-target navigation tasks.

Keywords:

Interval Hungarian algorithm

multi-robot

assignment problem

uncertainty

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.