Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Chia, D. Neiman, and V. Lesser. Poaching and distraction in asynchronous agent activities. In ICMAS, 1998.
K. Decker and J. Li. Coordinated hospital patient scheduling. In ICMAS, 1998.
C. Frei and B. Faltings. Resource allocation in networks using abstraction and constraint satisfaction techniques. In Proc of Constraint Programming, 1999.
Hiroaki Kitano. Robocup rescue:A grand challenge for multi-agent systems. In ICMAS, 2000.
J. Liu and K. Sycara. Multiagent coordination in tightly coupled task scheduling. In ICMAS, 1996.
S. Mittal and B. Falkenhainer. Dynamic constraint satisfaction problems. In AAAI, 1990.
Sanders. Ecm challenge problem, http://www.sanders.com/ants/ecm.htm. 2001.
M. Yokoo and K. Hirayama. Distributed constraint satisfaction algorithm for complex local problems. In ICMAS, July 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Modi, P.J., Jung, H., Tambe, M., Shen, WM., Kulkarni, S. (2001). A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_56
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive