A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation
A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation
复制标题
资源分配的动态分布式约束满足方法
DOI：
10.1007/3-540-45578-7_56
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
S. Kulkarni
中科院分区：
文献类型：
--
作者：
Pragnesh Jay Modi;Hyuckchul Jung;Milind Tambe;Wei;S. Kulkarni
在分布式资源分配中，一组代理必须将其资源分配给一组任务。这个问题出现在许多现实世界的领域，如灾难救援，医院调度和本文所描述的域：分布式传感器网络。尽管提出了各种分布式资源分配的方法，一个系统的形式化的问题和一般的解决方案的战略是失踪。本文提出了一个分布式资源分配的形式化，代表了动态和分布式方面的问题和一般的解决策略，使用分布式约束满足技术，朝着这个目标迈出了一步。本文定义了动态分布式约束满足问题（DyDCSP）的概念，并提出了两种从分布式资源分配到DyDCSP的广义映射，每一种映射都被证明可以正确地执行特定难度的资源分配问题，这一理论结果在实际分布式传感器网络中得到了验证。
In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as disaster rescue, hospital scheduling and the domain described in this paper: distributed sensor networks. Despite the variety of approaches proposed for distributed resource allocation, a systematic formalization of the problem and a general solution strategy are missing. This paper takes a step towards this goal by proposing a formalization of distributed resource allocation that represents both dynamic and distributed aspects of the problem and a general solution strategy that uses distributed constraint satisfaction techniques. This paper defines the notion of Dynamic Distributed Constraint Satisfaction Problem (DyDCSP) and proposes two generalized mappings from distributed resource allocation to DyDCSP, each proven to correctly perform resource allocation problems of specific difficulty and this theoretical result is verified in practice by an implementation on a real-world distributed sensor network.