• Home
  • Search
  • The distributed constraint satisfaction problem: formalization and algorithms
  • Cite Icon674
  • https://doi.org/10.1109/69.729707Copy DOI Icon

The distributed constraint satisfaction problem: formalization and algorithms

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving distributed CSPs. A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various application problems in distributed artificial intelligence can be formalized as distributed CSPs. We present our newly developed technique called asynchronous backtracking that allows agents to act asynchronously and concurrently without any global control, while guaranteeing the completeness of the algorithm. Furthermore, we describe how the asynchronous backtracking algorithm can be modified into a more efficient algorithm called an asynchronous weak-commitment search, which can revise a bad decision without exhaustive search by changing the priority order of agents dynamically. The experimental results on various example problems show that the asynchronous weak-commitment search algorithm is, by far more, efficient than the asynchronous backtracking algorithm and can solve fairly large-scale problems.

Similar Papers
  • Research Article
  • Citations1

Cooperative Problem Solving against Adversary: Quantified Distributed Constraint Satisfaction Problem

  • Jan 01, 2011
  • Transactions of the Japanese Society for Artificial Intelligence
  • Satomi Baba +5
  • Book Chapter
  • Citations1

Effect of DisCSP Variable-Ordering Heuristics in Scale-Free Networks

  • Jan 01, 2012
  • Tenda Okimoto +2
  • Conference Article
  • Citations5

DOC

  • Jan 01, 2008
  • Kais Ben Salah +1
  • Research Article
  • Citations2

The message management asynchronous backtracking algorithm

  • Jun 01, 2008
  • Journal of Experimental & Theoretical Artificial Intelligence
  • Hong Jiang +1
  • Research Article

A new distributed algorithm for efficient generalized arc-consistency propagation

  • May 10, 2018
  • Autonomous Agents and Multi-Agent Systems
  • Shufeng Kong +2
  • Conference Article
  • Citations6

The Complexity of the Distributed Constraint Satisfaction Problem.

  • Mar 02, 2021
  • Repositori digital de la UPF (Universitat Pompeu Fabra)
  • Silvia Butti +1
  • Research Article
  • Citations10

Multi-variable distributed backtracking with sessions

  • Jul 09, 2014
  • Applied Intelligence
  • René Mandiau +3
  • Conference Article

Controller Agents for Constraints Solving: Implementation and Use of CACS Prototype

  • Nov 01, 2008
  • Sami Al-Maqtari +1
  • Research Article
  • Citations3

Effect of DisCSP variable-ordering heuristics in scale-free networks

  • May 04, 2012
  • Multiagent and Grid Systems
  • Tenda Okimoto +2
  • Book Chapter
  • Citations7

On Communication in Solving Distributed Constraint Satisfaction Problems

  • Jan 01, 2005
  • Hyuckchul Jung +1
  • Conference Article
  • Citations26

Distributed problem solving and the boundaries of self-configuration in multi-hop wireless networks

  • Jan 07, 2002
  • B Krishnamachari +2
  • Book Chapter
  • Citations7

Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems

  • Jan 01, 2003
  • Lingzhong Zhou +2
  • Research Article
  • Citations2

Nogood-FC for solving partitionable constraint satisfaction problems

  • Nov 08, 2008
  • Journal of Intelligent Manufacturing
  • Montserrat Abril +2
  • Conference Article

A study on one distributed CSPS solving algorithm based on concurrent search

  • Jul 01, 2008
  • Chun-Hui Liu +3
  • Research Article

Efficient Knowledge Base Management in DCSP

  • Sep 30, 2010
  • International Journal of Ad hoc, Sensor & Ubiquitous Computing
  • Hong Jiang
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.