Skip to Main content Skip to Navigation
Theses

Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems

Abstract : Distributed Constraint Satisfaction Problems (DisCSP) is a general framework for solving distributed problems. DisCSP have a wide range of applications in multi-agent coordination. In this thesis, we extend the state of the art in solving the DisCSPs by proposing several algorithms. Firstly, we propose the Nogood-Based Asynchronous Forward Checking (AFC-ng), an algorithm based on Asynchronous Forward Checking (AFC). However, instead of using the shortest inconsistent partial assignments, AFC-ng uses nogoods as justifications of value removals. Unlike AFC, AFC-ng allows concurrent backtracks to be performed at the same time coming from different agents having an empty domain to different destinations. Then, we propose the Asynchronous Forward-Checking Tree (AFC- tree). In AFC-tree, agents are prioritized according to a pseudo-tree arrangement of the constraint graph. Using this priority ordering, AFC-tree performs multiple AFC-ng processes on the paths from the root to the leaves of the pseudo-tree. Next, we propose to maintain arc consistency asynchronously on the future agents instead of only maintaining forward checking. Two new synchronous search algorithms that maintain arc consistency asynchronously (MACA) are presented. After that, we developed the Agile Asynchronous Backtracking (Agile-ABT), an asynchronous dynamic ordering algorithm that does not follow the standard restrictions in asynchronous backtracking algorithms. The order of agents appearing before the agent receiving a backtrack message can be changed with a great freedom while ensuring polynomial space complexity. Next, we present a corrigendum of the protocol designed for establishing the priority between orders in the asynchronous backtracking algorithm with dynamic ordering using retroactive heuristics (ABT_DO-Retro). Finally, the new version of the DisChoco open-source platform for solving distributed constraint reasoning problems is described. The new version is a complete redesign of the DisChoco platform. DisChoco 2.0 is an open source Java library which aims at implementing distributed constraint reasoning algorithms.
Complete list of metadatas

Cited literature [101 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00718537
Contributor : Mohamed Wahbi <>
Submitted on : Monday, August 27, 2012 - 2:53:39 PM
Last modification on : Friday, May 17, 2019 - 11:38:47 AM
Long-term archiving on: : Friday, December 16, 2016 - 8:23:05 AM

Identifiers

  • HAL Id : tel-00718537, version 2

Collections

Citation

Mohamed Wahbi. Algorithms and Ordering Heuristics for Distributed Constraint Satisfaction Problems. Artificial Intelligence [cs.AI]. Université Montpellier II - Sciences et Techniques du Languedoc; Université Mohammed V-Agdal, Rabat, 2012. English. ⟨tel-00718537v2⟩

Share

Metrics

Record views

649

Files downloads

2921