自动驾驶汽车编队中的顺序在线任务划分
Sequential Online Chore Division for Autonomous Vehicle Convoy Formation
摘要：
家务分工是一类公平分工问题，其中一些不需要的“资源”必须在一组参与者之间共享，每个参与者都希望得到尽可能少的资源。通常，参与者的集合是固定的，并且在一开始就知道。本文介绍了一种新的变体，称为顺序在线家务分工（SOCD），参与者到达和离开在线，而家务正在执行：参与者的总数和他们的到达/离开时间最初是未知的。在SOCD中，在任何给定时间都必须有一个智能体执行家务（例如，保持瞭望），并且切换执行者会产生成本。在本文中，我们提出并分析了三种机制SOCD：一个集中式机制，使用侧支付，和两个分布式的，寻求平衡参与者的负载。分析和结果是在以自动驾驶汽车车队编队为动机的领域中呈现的，其中杂务是引导车队，以便所有跟随者都可以享受降低的风阻。
英文摘要：
Chore division is a class of fair division problems in which some undesirable "resource" must be shared among a set of participants, with each participant wanting to get as little as possible. Typically the set of participants is fixed and known at the outset. This paper introduces a novel variant, called sequential online chore division (SOCD), in which participants arrive and depart online, while the chore is being performed: both the total number of participants and their arrival/departure times are initially unknown. In SOCD, exactly one agent must be performing the chore at any give time (e.g. keeping lookout), and switching the performer incurs a cost. In this paper, we propose and analyze three mechanisms for SOCD: one centralized mechanism using side payments, and two distributed ones that seek to balance the participants' loads. Analysis and results are presented in a domain motivated by autonomous vehicle convoy formation, where the chore is leading the convoy so that all followers can enjoy reduced wind resistance.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
