Distributed constraint satisfaction for formalizing distributed problem solving

Yokoo, Makoto; Ishida, T.; Durfee, Edmund H.; Kuwabara, Kazuhiro

doi:10.1109/icdcs.1992.235101

Cited by 195 publications

(155 citation statements)

References 4 publications

Supporting

Mentioning

154

Contrasting

Order By: Relevance

“…In recent years we have seen an increasing interest in Distributed Constraint Satisfaction Problem (DisCSP) formulations to model combinatorial problems arising in distributed, multi-agent environments [2,14,16,17,18,20]. There is a rich set of real-world distributed applications, such as in the area of networked systems, for which the DisCSP paradigm is particularly useful.…”

Section: Introductionmentioning

confidence: 99%

“…This aspect has been overlooked in the literature due to the fact that, so far, the performance of DisCSP algorithms has been evaluated mainly on satisfiable instances. We study the performance of two well known DisCSP algorithms -asynchronous backtracking (ABT) [18], and asynchronous weak commitment search (AWC) [17]-on SensorDCSP. Both ABT and AWC use agent priority ordering during the search process.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Communication and Computation in Distributed CSP Algorithms

Fernàndez

Béjar

Krishnamachari

et al. 2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We introduce SensorDCSP, a naturally distributed benchmark based on a real-world application that arises in the context of networked distributed systems. In order to study the performance of Distributed CSP (DisCSP) algorithms in a truly distributed setting, we use a discrete-event network simulator, which allows us to model the impact of different network traffic conditions on the performance of the algorithms. We consider two complete DisCSP algorithms: asynchronous backtracking (ABT) and asynchronous weak commitment search (AWC). In our study of different network traffic distributions, we found that, random delays, in some cases combined with a dynamic decentralized restart strategy, can improve the performance of DisCSP algorithms. More interestingly, we also found that the active introduction of message delays by agents can improve performance and robustness, while reducing the overall network load. Finally, our work confirms that AWC performs better than ABT on satisfiable instances. However, on unsatisfiable instances, the performance of AWC is considerably worse than ABT.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Communication and Computation in Distributed CSP Algorithms

Fernàndez

Béjar

Krishnamachari

et al. 2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Therefore, we employ an ontological layer, based on a logic theory of configuration described in [6] that enables communication by mapping the specific representations onto more general ontological concepts from the configuration domain (compare [17]). Problem-solving itself can be compared to the work of [19], where the authors of that publication describe how several agents can build major subassemblies on their own, but these subassemblies must "hook together" in a compatible way. As a mechanism for problem representation, they propose a distributed Constraint Satisfaction Problem (CSP) and present several algorithms, such as Asynchronous Backtracking [19].…”

Section: Distributed Configurationmentioning

confidence: 99%

“…Problem-solving itself can be compared to the work of [19], where the authors of that publication describe how several agents can build major subassemblies on their own, but these subassemblies must "hook together" in a compatible way. As a mechanism for problem representation, they propose a distributed Constraint Satisfaction Problem (CSP) and present several algorithms, such as Asynchronous Backtracking [19]. However, in contrast to distributed CSP solving, the cooperation among configuration agents has to take two major extensions into account: − On the one hand, configuration tasks have a dynamic nature in the sense that the set of problem variables changes depending on the initial requirements and on the decisions taken during the problem-solving process.…”

Section: Distributed Configurationmentioning

confidence: 99%

Web-Based Commerce in Complex Products and Services with Multiple Suppliers

Ardissono

Felfernig

Friedrich

et al. 2003

E-Business Applications

View full text Add to dashboard Cite

The sale of customisable products and services over the Internet is a challenging task within the area of electronic commerce, as it represents an important extension of the functionalities of electronic catalogues and Web stores, which normally do not support the dynamic configuration of the items to be purchased. In this chapter we shall present a case study which shows how the offering and selling of complex products and services from the telecommunication industry are supported within a generic framework for customer-adaptive distributed online configuration. Following the paradigm of mass customisation, products and services are nowadays sold to customers in many variants according to specific customer requirements. In a Web-based environment, the customer interaction with the sales system must be given special emphasis. Therefore we sketch how a personalised Web interaction may imitate a good salesperson who adapts expert advice according to the customer's interests and skills. The digital economy of the 21st century will be based on flexibly integrated webs of highly specialised solution providers. Regarding configuration technology itself, the joint configuration of organisationally and geographically distributed products and services must be supported. This requires the extension of current configuration technology to include distributed knowledge bases and co-operative problem-solving behaviour. The framework developed here is designed to be generic enough to be also applicable to other industries with similar requirements for electronic commerce systems, such as the areas of facility management equipment and the building and construction industry.

show abstract

“…Yokoo [14], [15] has proposed solving distributed CSP by using an asynchronous backtracking algorithm. This can be done by allowing agents to run concurrently and asynchronously.…”

Section: Distributed Cspmentioning

confidence: 99%

Constraint Programming and Multi-Agent System Mixing Approach for Agricultural Decision Support System

Al-Maqtari

Abdulrab

Nosary

Understanding Complex Systems

View full text Add to dashboard Cite

The objective of this paper is to present the grand schemes of a model to be used in an agricultural Decision support System. We start by explaining and justifying the need for a hybrid system that uses both Multi-Agent System and Constraint Programming paradigms. Then we show our approach for Constraint Programming and Multi-Agent System mixing based on controller agent concept. Also, we present some concrete constraints and agents to be used in an application based on our proposed approach for modeling the problem of water use for agricultural purposes.

show abstract

Distributed constraint satisfaction for formalizing distributed problem solving

Cited by 195 publications

References 4 publications

Communication and Computation in Distributed CSP Algorithms

Communication and Computation in Distributed CSP Algorithms

Web-Based Commerce in Complex Products and Services with Multiple Suppliers

Constraint Programming and Multi-Agent System Mixing Approach for Agricultural Decision Support System

Contact Info

Product

Resources

About