Preference Elicitation for DCOPs
Preference Elicitation for DCOPs
复制标题
DCOP 的偏好诱导
DOI：
10.1007/978-3-319-66158-2_18
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
W. Yeoh
中科院分区：
文献类型：
--
作者：
Atena M. Tabakhi;Tiep Le;Ferdinando Fioretto;W. Yeoh
分布式约束优化问题（DCOPs）为多智能体协作问题的描述和求解提供了一种强有力的方法。在这个模型中，一组代理协调他们的行动，以优化全局目标函数，考虑到他们的偏好或约束。该模型的一个核心限制是假设所有代理人的偏好或所有约束的成本都是先验指定的。不幸的是，这个假设并不适用于许多应用领域，其中的偏好或约束必须从用户那里得到。其中一个领域是智能家居设备调度（SHDS）问题。基于这一局限性，本文做出了以下贡献：（1）我们提出了一个通用的模型，在DCOPs的偏好诱导;（2）我们提出了几个启发式的DCOPs的偏好诱导;（3）我们经验评估这些启发式的随机二进制DCOPs以及SHDS问题的效果。
Distributed Constraint Optimization Problems (DCOPs) offer a powerful approach for the description and resolution of cooperative multi-agent problems. In this model, a group of agents coordinate their actions to optimize a global objective function, taking into account their preferences or constraints. A core limitation of this model is the assumption that the preferences of all agents or the costs of all constraints are specified a priori. Unfortunately, this assumption does not hold in a number of application domains where preferences or constraints must be elicited from the users. One of such domains is the Smart Home Device Scheduling (SHDS) problem. Motivated by this limitation, we make the following contributions in this paper: (1) We propose a general model for preference elicitation in DCOPs; (2) We propose several heuristics to elicit preferences in DCOPs; and (3) We empirically evaluate the effect of these heuristics on random binary DCOPs as well as SHDS problems.