paper-with-me

Papers

Sequential Online Chore Division for Autonomous Vehicle Convoy Formation

2021-04-09 · Harel Yedidsion, Shani Alkoby, Peter Stone

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.

📄 PDF Abstract BibTeX arXiv:2104.04159

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

FAVOR+ 설명 없음
Performer Performer is a Transformer architecture which can estimate regular…

Similar Papers 제목 키워드 기반

Temporal Fair Division of Indivisible Items

2024-10-18 · Edith Elkind, Alexander Lam, Mohamad Latifian, Tzeh Yuan Neoh 외

We study a fair division model where indivisible items arrive sequentially, and must be allocated immediately and irrevocably. Previous work on online fair division has shown impossibility results in achieving approximat…

Externalities in Chore Division

2023-03-22 · Mohammad Azharuddin Sanpui

The chore division problem simulates the fair division of a heterogeneous, undesirable resource among several agents. In the fair division of chores, each agent only gets the disutility from its own piece. Agents may, ho…

Chore division on a graph

2018-12-05 · Sylvain Bouveret, Katarína Cechlárová, Julien Lesca

The paper considers fair allocation of indivisible nondisposable items that generate disutility (chores). We assume that these items are placed in the vertices of a graph and each agent's share has to form a connected su…

Choreographing the Way of Water: A Computational Framework for Aquatic Robotic Art

2026-07-02 · Aswin Ramachandran, Christopher Golling, Sebastian Burmester, Noa Sendlhofer 외 arxiv

Robotic choreography in open water is governed by nonlinear fluid dynamics, which impose significant challenges due to environmental disturbances and nonlinear system dynamics. This paper presents the cyber-physical arch…

Measuring Similarity of Interactive Driving Behaviors Using Matrix Profile

2019-10-28 · Qin Lin, Wenshuo Wang, Yihuan Zhang, John Dolan

Understanding multi-vehicle interactive behaviors with temporal sequential observations is crucial for autonomous vehicles to make appropriate decisions in an uncertain traffic environment. On-demand similarity measures …

Autonomous VehiclesClustering