ASODPOP: Making Open DPOP Asynchronous

Planning in Multiagent Systems

计算机科学;物理学

Brammert Ottens ; Boi Faltings

Others  :  http://drops.dagstuhl.de/opus/volltexte/2009/1871/pdf/08461.OttensBrammert.Paper.1871.pdf
PID  :  18283

学科分类：计算机科学（综合）

来源: CEUR

【 摘 要 】

In this paper we show how ODPOP can be adapted to an asynchronousenvironment 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.