.png){kind=icon}
返回
Assessing optimal assignment under uncertainty: An interval-based algorithm
.png){kind=icon}
OA
AI
DOI：10.1177/0278364911404579.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Interval Hungarian algorithm
multi-robot
assignment problem
uncertainty
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5
论文数:
2.4K
被引数:
1.5W
机构
引用论文
分享收藏分享收藏分享收藏Hydrothermal preparation and low temperature magnetic properties of TbOOH, DyOOH, HoOOH, ErOOH, and YbOOHTbOOH，DyOOH，HoOOH，ErOOH和YbOOH的水热制备和低温磁性
PREAI
分享收藏Market-based multirobot coordination: A survey and analysis基于市场的多机器人协调: 调查与分析.png)
PROCEEDINGS OF THE IEEE
OAAI
PROCEEDINGS OF THE IEEEIF25.9
OAAI分享收藏
查看更多内容