You are here

Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems

Authors: 

Younes Mechqrane, Mohamed Wahbi, Christian Bessiere, Ken Brown

Publication Type: 
Refereed Original Article
Abstract: 
Distributed constraint satisfaction problems (DisCSPs) can express decision problems where physically distributed agents control different decision variables, but must coordinate with each other to agree on a global solution. Asynchronous Backtracking (ABT) is a pivotal search procedure for DisCSPs. ABT requires a static total ordering on the agents. However, reordering agents during search is an essential component for efficiently solving a DisCSP. All polynomial space algorithms proposed so far to improve ABT by reordering agents during search only allow a limited amount of reordering. In this paper, we propose AgileABT, a general framework for reordering agents asynchronously that is able to change the ordering of all agents. This is done via the original notion of termination value, a label attached to the orders exchanged by agents during search. We prove that AgileABT is sound and complete. We show that, thanks to termination values, our framework allows us to implement the main variable ordering heuristics from centralized CSPs, which until now could not be applied to the distributed setting. We prove that AgileABT terminates and has a polynomial space complexity in all these cases. Our empirical study shows the significance of our framework compared to state-of-the-art asynchronous dynamic ordering algorithms for solving distributed CSP.
Digital Object Identifer (DOI): 
10.1016/j.artint.2019.103169
Publication Status: 
In Press
Date Accepted for Publication: 
Saturday, 24 August, 2019
Publication Date: 
31/01/2020
Journal: 
Artificial Intelligence
Volume: 
278
Institution: 
National University of Ireland, Cork (UCC)
Open access repository: 
No