Distributed constraint satisfaction with multiply sectioned constraint networks
نویسندگان
چکیده
منابع مشابه
Distributed constraint satisfaction with multiply sectioned constraint networks
We propose a new algorithmic framework, multiply sectioned constraint networks (MSCNs), for solving distributed constraint satisfaction problems (DisCSPs) with complex local problems. An MSCN is converted into a linked junction forest (LJF) and is solved by a complete algorithm. Its time complexity is linear on the number and size of local problems (each in charge by an agent) and is exponentia...
متن کاملMultiagent Constraint Satisfaction with Multiply Sectioned Constraint Networks
Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Most existing algorithms for DCSPs are extensions of centralized backtracking or iterative improvement with breakout. Their worst case complexity is exponential. On the other hand, directional consistency based algorithms solve c...
متن کاملDistributed University Timetabling with Multiply Sectioned Constraint Networks
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed timetabling problems (DisTTPs) was studied as distributed constraint satisfaction problems (DisCSPs). We present an alternative method for solving DisTTPs based on multiply sectioned constraint networks (MSCNs). The pro...
متن کاملConstraint Relaxation in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (DCSP) formulation has recently been identi ed as a general framework for formalizing various Distributed Arti cial Intelligence problems. In this paper, we extend the DCSP formalization by introducing the notion of importance values of constraints. With these values, we de ne a solution criterion for DCSPs that are over-constrained (where no solu...
متن کاملBoosting Distributed Constraint Satisfaction
Competition and cooperation can boost the performance of search. Both can be implemented with a portfolio of algorithms which run in parallel, give hints to each other and compete for being the first to finish and deliver the solution. In this paper we present a new generic framework for the application of algorithms for distributed constraint satisfaction which makes use of both cooperation an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information and Decision Sciences
سال: 2014
ISSN: 1756-7017,1756-7025
DOI: 10.1504/ijids.2014.061771