Abstract
Search problems are fundamental in artificial intelligence. When domain knowledge is limited or not available, search is the only way to solve a problem. Although search algorithms have been widely implemented using structured or object-oriented programming, the design of a multiagent system for solving search problems raises a different type of challenges. In this paper, the design of such a system is presented, along with some implementation details. The performance of the system is analysed for several problems using different algorithms and parameters.
Cuvinte cheie
search
path finding
intelligent agents
JADE framework