Resource Allocation and Constraint Satisfaction Techniques
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Distributed Constraint Satisfaction Algorithm for Complex Local Problems
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Poaching and Distraction in Asynchronous Agent Activities
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Coordinated Hospital Patient Scheduling
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Local search for distributed SAT with complex local problems
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Constraint Programming for Distributed Resource Allocation
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
An asynchronous complete method for distributed constraint optimization
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Performance models for large scale multiagent systems: using distributed POMDP building blocks
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
A prototype infrastructure for distributed robot-agent-person teams
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Conflicts in teamwork: hybrids to the rescue
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Agent-organized networks for dynamic team formation
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Sensor networks and distributed CSP: communication, computation and complexity
Artificial Intelligence - Special issue: Distributed constraint satisfaction
A complete distributed constraint optimization method for non-traditional pseudotree arrangements
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Sensor networks and distributed CSP: communication, computation and complexity
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Optimization-based dynamic sensor management for distributed multitarget tracking
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
On communication in solving distributed constraint satisfaction problems
CEEMAS'05 Proceedings of the 4th international Central and Eastern European conference on Multi-Agent Systems and Applications
MMAS'04 Proceedings of the First international conference on Massively Multi-Agent Systems
Hi-index | 0.00 |
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.