Distributed Constraint Satisfaction Among Android Devices.

The constraint satisfaction problem (CSP) has been widely studied in the AI literature, where the aim of this problem is to find an assignment of values to variables that satisfies all constraints. A distributed CSP (DisCSP) is a CSP where variables and constraints are distributed among agents. Various application problems in multi-agent systems can be formalized as DisCSPs. The asynchronous backtracking (ABT) algorithm has been developed for solving DisCSPs in a distributed manner. In this paper, we implement the ABT algorithm as an Android application, which we call ABT on Androids. We evaluate our application by solving the 2-queens problem.