arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1309.1973cs.AI
收藏

任务报酬不确定的基于后悔的多Agent协调

Regret-Based Multi-Agent Coordination with Uncertain Task Rewards

University of Southampton(南安普顿大学)

Feng Wu, Nicholas R. Jennings

摘要:

许多多智能体协调问题可以表示为DCOP。出于灾难响应中的任务分配,我们扩展了标准DCOP模型,以考虑不确定的任务奖励,完成任务的结果取决于其当前状态,这是随机抽取的未知分布。解决这个问题的目标是为所有代理找到一个最小化整体最坏情况损失的解决方案。这是一个具有挑战性的问题,集中式算法,因为搜索空间的增长指数与代理的数量和标准的DCOP算法,我们有。为了解决这个问题,我们提出了一种新的分散式算法,它结合了最大和迭代约束生成,通过在代理之间传递消息来解决问题。通过这样做,我们的方法扩展性很好,可以解决数百个代理和任务的任务分配问题的实例。

英文摘要:

Many multi-agent coordination problems can be represented as DCOPs. Motivated by task allocation in disaster response, we extend standard DCOP models to consider uncertain task rewards where the outcome of completing a task depends on its current state, which is randomly drawn from unknown distributions. The goal of solving this problem is to find a solution for all agents that minimizes the overall worst-case loss. This is a challenging problem for centralized algorithms because the search space grows exponentially with the number of agents and is nontrivial for standard DCOP algorithms we have. To address this, we propose a novel decentralized algorithm that incorporates Max-Sum with iterative constraint generation to solve the problem by passing messages among agents. By so doing, our approach scales well and can solve instances of the task allocation problem with hundreds of agents and tasks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑