Multi-agent path finding for self interested agents

Zahy Bnaya, Roni Stern, Ariel Felner, Roie Zivan, Steven Okamoto

Research output: Contribution to conferencePaperpeer-review

15 Scopus citations

Abstract

Multi-agent pathfinding (MAPF) deals with planning paths for individual agents such that a global cost function (e.g., the sum of costs) is minimized while avoiding collisions between agents. Previous work proposed centralized or fully cooperative decentralized algorithms assuming that agents will follow paths assigned to them. When agents are self-interested, however, they are expected to follow a path only if they consider that path to be their most beneficial option. In this paper we propose the use of a taxation scheme to implicitly coordinate self-interested agents in MAPF. We propose several taxation schemes and compare them experimentally. We show that intelligent taxation schemes can result in a lower total cost than the non coordinated scheme even if we take into consideration both travel cost and the taxes paid by agents.

Original languageEnglish
Pages38-46
Number of pages9
StatePublished - 1 Dec 2013
Event6th Annual Symposium on Combinatorial Search, SoCS 2013 - Leavenworth, WA, United States
Duration: 11 Jul 201313 Jul 2013

Conference

Conference6th Annual Symposium on Combinatorial Search, SoCS 2013
Country/TerritoryUnited States
CityLeavenworth, WA
Period11/07/1313/07/13

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Multi-agent path finding for self interested agents'. Together they form a unique fingerprint.

Cite this