License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-18714
URL: http://drops.dagstuhl.de/opus/volltexte/2009/1871/
Ottens, Brammert

ASODPOP: Making Open DPOP Asynchronous

pdf-format:
Dokument 1.pdf (146 KB)

Abstract

In this paper we show how ODPOP can be adapted to an asynchronous environment where agents might have to decide their values before the algorithm has ended, giving us Asynchronous ODPOP (ASODPOP). We have compared the algorithm with both ADOPT and distributed local search (DSA). Compared to ADOPT we show that our approach sends fewer messages, converges to a reasonable solution faster, and uses an equal amount of NCCCs. We also show that this convergence is much faster than local search, whilst the solution that local search converges to is far from optimal.

BibTeX - Entry

@InProceedings{ottens:DSP:2009:1871,
  author =	{Brammert Ottens},
  title =	{ASODPOP: Making Open DPOP Asynchronous},
  booktitle =	{Planning in Multiagent Systems},
  year =	{2009},
  editor =	{J{\"u}rgen Dix and Edmund H. Durfee and Cees Witteveen},
  number =	{08461},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/1871},
  annote =	{Keywords: DCOP, Logistics, Planning, Coordination}
}

Keywords: DCOP, Logistics, Planning, Coordination
Seminar: 08461 - Planning in Multiagent Systems
Issue date: 2009
Date of publication: 05.02.2009

DROPS-Home | Fulltext Search | Imprint Published by LZI