Abstract
Distributed Constraint Satisfaction Problems (DCSP) provide a formalism for representing, in a simple and efficient way, distributed problems. Different agents collaborate with each other in order to find a global solution subject to constraints. In general, researchers evaluate DCSP algorithms on graph coloring problems or uniform random binary DCSP. In this paper, we propose to compare DCSP algorithms on a multi-agent exploration problem. This problem is a particular case of multi-agent coordination problems and the evaluation of DCSP algorithms on this problem is difficult. In order to measure different aspects of this multi-agent exploration problem, we use six different criteria: classical criteria from DCSP benchmarks and specific criteria for this problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
