Approach to solving DCSP using BDI

Authors:
José Miguel Rubio;Broderick Crawford;Jimena Ahumada
Affiliations:
Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Valparaíso, Chile;Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Valparaíso, Chile;Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Valparaíso, Chile
Venue:
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
Year:
2009

Citing 3
Cited 0

A methodology and modelling technique for systems of BDI agents

MAAMAW '96 Proceedings of the 7th European workshop on Modelling autonomous agents in a multi-agent world : agents breaking away: agents breaking away
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms

IEEE Transactions on Knowledge and Data Engineering
Handbook of Constraint Programming (Foundations of Artificial Intelligence)

Handbook of Constraint Programming (Foundations of Artificial Intelligence)

Quantified Score

Hi-index	0.00

Visualization

Abstract

BDI is an agent who works based on three basic attitudes: beliefs, desires and intentions. Is presented in this paper the development of a multiagent system based on BDI agents or intentional agents to solve problems of satisfaction of typical restrictions, using the algorithm "Asynchronous Backtracking. The problem is distributed on several agents working together to find a solution. Is shown part of the system design, through development methodology oriented to AAII agents, and the application of the above by implementing two such problems: N-Queens and Sudoku, the results obtained from experiments and conclusions based on this.