Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
The paper explores a very simple agent design method called Q-decomposition, wherein a complex agent is built from simpler subagents. Each subagent has its own reward function and...
In this work we examined the performance of two evolutionary algorithms, a genetic algorithm (GA) and particle swarm optimization (PSO), in the estimation of the parameters of a mo...
Dulce Calcada, Agostinho Rosa, Luis C. Duarte, Vit...
The algorithm we present in this paper aims to optimally distribute and connect the community of loosely coupled middle agents ensuring communication accessibility in a dynamic, i...
Agent-based approaches to manufacturing scheduling and control have gained increasing attention in recent years. Such approaches are attractive because they o er increased robustn...