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

GRAPE-S:面向多服务集群的近实时联盟形成

GRAPE-S: Near Real-Time Coalition Formation for Multiple Service Collectives

Oregon State University(俄勒冈州立大学)

Grace Diehl, Julie A. Adams

AI总结:

针对多服务机器人集群在动态环境下的近实时联盟形成难题,本文将GRAPE算法与服务模型结合,提出GRAPE-S和Pair-GRAPE-S算法,在近实时内实现近最优或最优的联盟划分。

摘要:

用于军事和灾害响应应用的机器人集群需要联盟形成算法,将机器人划分为合适的任务团队。集群的任务通常包含需要多种高级机器人行为或服务的任务,联盟形成必须适应这一点。高度动态和非结构化的应用领域还要求联盟形成算法在近实时(即<5分钟)内为超大规模集群(即数百个机器人)产生近最优解(即>95%效用)。此前没有联盟形成算法能满足这些要求。初步评估发现,传统的基于拍卖的算法运行时间过长,尽管集中式模拟器包含了现实部署中不太可能发生的理想条件(即机器人间的同步和完美、即时的通信)。基于享乐博弈的GRAPE算法能够在近实时内产生解决方案,但无法应用于多服务集群。本文将GRAPE与服务模型相集成,提出了GRAPE-S和Pair-GRAPE-S。使用最多1000个机器人的集中式模拟器,以及迄今为止规模最大的分布式联盟形成模拟评估(最多500个机器人),对这些算法和两种拍卖基准进行了评估。评估表明,拍卖难以有效迁移至分布式集群,导致运行时间过长且效用低下。GRAPE-S满足目标领域的联盟形成要求,在近实时内产生近最优解,而Pair-GRAPE-S则超额满足领域要求,在近实时内产生最优解。GRAPE-S和Pair-GRAPE-S是首批被证明能够支持具有多种服务的超大规模分布式集群实现近实时联盟形成的算法。

英文摘要:

Robotic collectives for military and disaster response applications require coalition formation algorithms to partition robots into appropriate task teams. Collectives' missions will often incorporate tasks that require multiple high-level robot behaviors or services, which coalition formation must accommodate. The highly dynamic and unstructured application domains also necessitate that coalition formation algorithms produce near optimal solutions (i.e., >95% utility) in near real-time (i.e., <5 minutes) with very large collectives (i.e., hundreds of robots). No previous coalition formation algorithm satisfies these requirements. An initial evaluation found that traditional auction-based algorithms' runtimes are too long, even though the centralized simulator incorporated ideal conditions unlikely to occur in real-world deployments (i.e., synchronization across robots and perfect, instantaneous communication). The hedonic game-based GRAPE algorithm can produce solutions in near real-time, but cannot be applied to multiple service collectives. This manuscript integrates GRAPE and a services model, producing GRAPE-S and Pair-GRAPE-S. These algorithms and two auction baselines were evaluated using a centralized simulator with up to 1000 robots, and via the largest distributed coalition formation simulated evaluation to date, with up to 500 robots. The evaluations demonstrate that auctions transfer poorly to distributed collectives, resulting in excessive runtimes and low utility solutions. GRAPE-S satisfies the target domains' coalition formation requirements, producing near optimal solutions in near real-time, and Pair-GRAPE-S more than satisfies the domain requirements, producing optimal solutions in near real-time. GRAPE-S and Pair-GRAPE-S are the first algorithms demonstrated to support near real-time coalition formation for very large, distributed collectives with multiple services.

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

↑