A new model for solution of complex distributed constrained problems

TL;DR

This paper introduces CACS, a novel computational model combining multi-agent systems and constraint satisfaction paradigms to efficiently solve complex distributed constraint problems, including non-binary constraints, demonstrated through a timetabling application.

Contribution

The paper presents the CACS model, enabling direct handling of non-binary constraints and grouping constraints for local problem solving in distributed environments.

Findings

Prototype implementation of DCSP solver using CACS

Effective handling of non-binary constraints without translation

Application to timetabling problems demonstrates practicality

Abstract

In this paper we describe an original computational model for solving different types of Distributed Constraint Satisfaction Problems (DCSP). The proposed model is called Controller-Agents for Constraints Solving (CACS). This model is intended to be used which is an emerged field from the integration between two paradigms of different nature: Multi-Agent Systems (MAS) and the Constraint Satisfaction Problem paradigm (CSP) where all constraints are treated in central manner as a black-box. This model allows grouping constraints to form a subset that will be treated together as a local problem inside the controller. Using this model allows also handling non-binary constraints easily and directly so that no translating of constraints into binary ones is needed. This paper presents the implementation outlines of a prototype of DCSP solver, its usage methodology and overview of the CACS application for timetabling problems.