Tampere University of Technology

TUTCRIS Research Portal

MetrIntSimil-an accurate and robust metric for comparison of similarity in intelligence of any number of cooperative multiagent systems

Research output: Contribution to journalArticleScientificpeer-review

Details

Original languageEnglish
Article number48
JournalSymmetry
Volume10
Issue number2
DOIs
Publication statusPublished - 1 Feb 2018
Publication typeA1 Journal article-refereed

Abstract

Intelligent cooperative multiagent systems are applied for solving a large range of real-life problems, including in domains like biology and healthcare. There are very few metrics able to make an effective smeasure of the machine intelligence quotient. The most important drawbacks of the designed metrics presented in the scientific literature consist in the limitation in universality, accuracy, and robustness. In this paper, we propose a novel universal metric called MetrIntSimil capable of making an accurate and robust symmetric comparison of the similarity in intelligence of any number of cooperative multiagent systems specialized in difficult problem solving. The universality is an important necessary property based on the large variety of designed intelligent systems. MetrIntSimil makes a comparison by taking into consideration the variability in intelligence in the problem solving of the compared cooperativemultiagent systems. It allows a classification of the cooperativemultiagent systems based on their similarity in intelligence. A cooperative multiagent system has variability in the problem solving intelligence, and it can manifest lower or higher intelligence in different problem solving tasks. More cooperative multiagent systems with similar intelligence can be included in the same class. For the evaluation of the proposed metric, we conducted a case study for more intelligent cooperative multiagent systems composed of simple computing agents applied for solving the Symmetric Travelling Salesman Problem (STSP) that is a class of NP-hard problems. STSP is the problem of finding the shortest Hamiltonian cycle/tour in a weighted undirected graph that does not have loops or multiple edges. The distance between two cities is the same in each opposite direction. Two classes of similar intelligence denoted IntClassA and IntClassB were identified. The experimental results show that the agent belonging to IntClassA intelligence class is less intelligent than the agents that belong to the IntClassB intelligence class.

Keywords

  • Computational-hard problem, Cooperative problem solving, Diversity of intelligent systems, Machine intelligence measure, Similarity in intelligence, Symmetric travelling salesman problem

Publication forum classification

Field of science, Statistics Finland

Downloads statistics

No data available