Distributed constraint satisfaction with multiply sectioned constraint networks

Yang Xiang, Younis Mohamed and Wanling Zhang

International Journal of Information and Decision Sciences, 2014, vol. 6, issue 2, 127-152

Abstract: 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 exponential on cluster size of LJF. We show that the MSCN-LJF algorithm is more efficient than junction tree-based DisCSP algorithms. When a DisCSP is not naturally an MSCN, we show how to convert it into an MSCN, so that any DisCSP can be solved as above.

Keywords: distributed CSP; constraint satisfaction problems; multiply sectioned constraint networks; linked junction forests; LJF; complex local problems; multi-agent systems; agent-based systems; MAS; junction trees. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=61771 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijidsc:v:6:y:2014:i:2:p:127-152

Access Statistics for this article

More articles in International Journal of Information and Decision Sciences from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().