Skip to main navigation Skip to search Skip to main content

Decentralized multi-agent path finding framework and strategies based on automated negotiation

  • M. Onur Keskin
  • , Furkan Cantürk
  • , Cihan Eran
  • , Reyhan Aydoğan*
  • *Corresponding author for this work

Research output: Contribution to journal › Article › Scientific › peer-review

90 Downloads (Pure)

Abstract

This paper introduces a negotiation framework to solve the Multi-Agent Path Finding (MAPF) Problem for self-interested agents in a decentralized fashion. The framework aims to achieve a good trade-off between the privacy of the agents and the effectiveness of solutions. Accordingly, a token-based bilateral negotiation protocol and two negotiation strategies are presented. The experimental results over four different settings of the MAPF problem show that the proposed approach could find conflict-free path solutions albeit suboptimally, especially when the search space is large and high-density. In contrast, Explicit Estimation Conflict-Based Search (EECBS) struggles to find optimal solutions. Besides, deploying a sophisticated negotiation strategy that utilizes information about local density for generating alternative paths can yield remarkably better solution performance in this negotiation framework.

Original languageEnglish
Article number10
Number of pages30
JournalAutonomous Agents and Multi-Agent Systems
Volume38
Issue number1
DOIs
Publication statusPublished - 2024

Keywords

  • Decentralized coordination
  • Multi-agent path finding
  • Negotiation

Fingerprint

Dive into the research topics of 'Decentralized multi-agent path finding framework and strategies based on automated negotiation'. Together they form a unique fingerprint.

Cite this