Metrics for the Evaluation of DisCSP: Some Experiments on Multi-robot Exploration

Many algorithms to solve Distributed Constraint Satisfaction Problems (DisCSP) have been introduced in the literature. In this paper, we propose to compare three different algorithms to solve DisCSP. Contrary to algorithms of the literature which are evaluated on graph coloring problems or uniform random binary DisCSPs, we use a multi-robot exploration problem. We show that, for this real world application, the comparison of algorithms may be improved by using additional metrics than those used in the literature. We will define other metrics that can be used for measuring different aspects of the multi-robot exploration problem. The aim of our attempt for defining metrics is to analyze and compare different aspects of complexity of this multi-robot problem. We will observe that using both classical and real world metrics is interesting to obtain a better and more precise comparison.

[1]  C. Malcolm,et al.  Distributed multirobot exploration maintaining a mobile network , 2004, 2004 2nd International IEEE Conference on 'Intelligent Systems'. Proceedings (IEEE Cat. No.04EX791).

[2]  Brian Yamauchi,et al.  Frontier-based exploration using multiple robots , 1998, AGENTS '98.

[3]  Sylvain Piechowiak,et al.  A complete algorithm for DisCSP : Distributed Backtracking with Sessions ( DBS ) , 2009 .

[4]  Jindong Tan,et al.  Distributed multi-robot coordination in area exploration , 2006, Robotics Auton. Syst..

[5]  Bhaskar Krishnamachari,et al.  Communication and Computation in Distributed CSP Algorithms , 2002, CP.

[6]  Noury Bouraqadi,et al.  Distributed Constraint Reasoning Applied to Multi-robot Exploration , 2009, 2009 21st IEEE International Conference on Tools with Artificial Intelligence.

[7]  Noury Bouraqadi,et al.  Making networked robots connectivity-aware , 2009, 2009 IEEE International Conference on Robotics and Automation.

[8]  Sylvain Piechowiak,et al.  A DisCSP Solving Algorithm Based on Sessions , 2005, FLAIRS.

[9]  Amnon Meisels,et al.  Comparing performance of distributed constraints process ing algorithms , 2002 .

[10]  Makoto Yokoo,et al.  Distributed Constraint Satisfaction , 2000, Springer Series on Agent Technology.

[11]  Yang Xiang,et al.  Distributed University Timetabling with Multiply Sectioned Constraint Networks , 2008, FLAIRS Conference.