Pseudo-Tree Construction Heuristics for DCOPs and Evaluations on the ns-2 Network Simulator
Pseudo-Tree Construction Heuristics for DCOPs and Evaluations on the ns-2 Network Simulator
复制标题
DCOP 的伪树构建启发式以及 ns-2 网络模拟器的评估
DOI：
10.1109/ictai.2017.00169
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
S. Misra
中科院分区：
文献类型：
--
作者：
Atena M. Tabakhi;R. Tourani;Francisco Natividad;W. Yeoh;S. Misra
分布式约束优化问题（DCOPs）通常用于建模多智能体协调问题。然而，DCOP算法的经验评估通常是在所有代理对之间的通信时间是相同的假设下在模拟中完成的，这在许多现实世界的应用中是不现实的。在本文中，我们调查的影响下，对代理之间的通信时间可以变化的假设下，经验评估DCOP算法，并提出使用的NS-2，事实上的模拟器使用的计算机网络社区，模拟的通信时间。此外，我们还介绍了利用非均匀通信时间来加速伪树上操作的DCOP算法的算法。
Distributed Constraint Optimization Problems (DCOPs) are commonly used to model multi-agent coordination problems. However, empirical evaluations of DCOP algorithms are typically done in simulation under the assumption that the communication times between all pairs of agents are identical, which is unrealistic in many real-world applications. In this paper, we investigate the impact of empirically evaluating a DCOP algorithm under the assumption that communication times between pairs of agents can vary and propose the use of ns-2, a de-facto simulator used by the computer networking community, to simulate the communication times. Additionally, we introduce heuristics that exploit the non- uniform communication times to speed up DCOP algorithms that operate on pseudo-trees.