DagSemProc.08461.3.pdf
- Filesize: 145 kB
- 6 pages
Document
ASODPOP: Making Open DPOP Asynchronous
Author
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 8461
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2009-02-05
Cite AsGet BibTex
Brammert Ottens. ASODPOP: Making Open DPOP Asynchronous. In Planning in Multiagent Systems. Dagstuhl Seminar Proceedings, Volume 8461, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/DagSemProc.08461.3
https://doi.org/10.4230/DagSemProc.08461.3
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.
Keywords
- DCOP
- Logistics
- Planning
- Coordination
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads