Distributed task allocation algorithms requires a set of agents to intelligently allocate their resources to a set of tasks. The problem is often complicated by the fact that resources may be limited, the set of tasks may not be exactly known, and the set of tasks may change over time. Previous resource allocation algorithms have not been able to handle overconstrained situations, the uncertainty in the environment and/or dynamics. In this paper, we present extensions to an algorithm for distributed constraint optimization, called Adopt-SC which allows it to be applied in such real-world domains. The approach relies on maintaining a probability distribution over tasks that are potentially present. The distribution is updated with both information from local sensors and information inferred from communication between agents. We present promising results with the approach on a distributed task allocation problem consisting of a set of stationary sensors that must track a moving target. The techniques proposed in this paper are evaluated on real hardware tracking real moving targets.
[1]
Michael L. Littman,et al.
Solving Crossword Puzzles as Probabilistic Constraint Satisfaction
,
1999,
AAAI/IAAI.
[2]
Wei-Min Shen,et al.
A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation
,
2001,
CP.
[3]
Pragnesh Jay Modi,et al.
Distributed constraint optimization and its application to multiagent resource allocation
,
2002,
AAAI/IAAI.
[4]
Makoto Yokoo,et al.
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
,
1998,
IEEE Trans. Knowl. Data Eng..
[5]
Makoto Yokoo,et al.
An approach to over-constrained distributed constraint satisfaction problems: distributed hierarchical constraint satisfaction
,
2000,
Proceedings Fourth International Conference on MultiAgent Systems.