Abstract
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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
