When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.08461.3
URN: urn:nbn:de:0030-drops-18714
Go to the corresponding Portal

Ottens, Brammert

ASODPOP: Making Open DPOP Asynchronous

08461.OttensBrammert.Paper.1871.pdf (0.1 MB)


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

  author =	{Ottens, Brammert},
  title =	{{ASODPOP: Making Open DPOP Asynchronous}},
  booktitle =	{Planning in Multiagent Systems},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{8461},
  editor =	{J\"{u}rgen Dix and Edmund H. Durfee and Cees Witteveen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-18714},
  doi =		{10.4230/DagSemProc.08461.3},
  annote =	{Keywords: DCOP, Logistics, Planning, Coordination}

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

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI