A reactive approach for solving constraint satisfaction problems

12Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose in this paper a multi-agent model for solving a class of Constraint Satisfaction Problems: the assignment problem. Our work is based on a real-world problem, the assignment of land-use categories in a farming territory, in the north-east of France. This problem exhibits a function to optimize, while respecting a set of constraints, both local (compatibility of grounds and land-use categories) and global (ratio of production between land-use categories). We developed a model using a purely reactive multi-agent system that builds its solution upon conflicts that arise during the resolution process. In this paper, we present the reactive modelling of the problem solving and experimental results from two points of view: the efficiency of the problem being solved and the properties of the problem solving process.

Cite

CITATION STYLE

APA

Dury, A., Le Ber, F., & Chevrier, V. (1999). A reactive approach for solving constraint satisfaction problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1555, pp. 397–411). Springer Verlag. https://doi.org/10.1007/3-540-49057-4_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free