Benchmark analysis of novel multi-agent optimization algorithm using linear regulators for agents motion control

The aim of this paper is to develop algorithm and software for a novel multi-agent constrained global optimization method. In multi-agent algorithms, the solution search area is populated with agents. Some transformations occur over them, which lead to a global extremum. It was proposed to take as a...

Full description

Saved in:
Bibliographic Details
Published inIOP conference series. Materials Science and Engineering Vol. 927; no. 1; pp. 12023 - 12030
Main Authors Karane, M, Panteleev, A
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.09.2020
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:The aim of this paper is to develop algorithm and software for a novel multi-agent constrained global optimization method. In multi-agent algorithms, the solution search area is populated with agents. Some transformations occur over them, which lead to a global extremum. It was proposed to take as a basis the use of linear regulators to control the movement of agents group. At each stage of the algorithm, a search is made by closed loop agents control with various types of criteria. Using criteria of various types, a more detailed study of the solution search area and finding a global extremum is provided. This is the main feature and novelty of the algorithm under consideration. The method efficiency is studied on a standard set of test functions of two variables with a complex structure of level lines using the software developed. Efficiency analysis is carried out for Schweffel function and multifunction from the benchmark set. During the study, statistical characteristics were calculated, according to which the most suitable parameters were selected. The results obtained indicate that the algorithm successfully copes with such problems and can be used, for example, for problems in the theory of optimal control of dynamic systems.
ISSN:1757-8981
1757-899X
DOI:10.1088/1757-899X/927/1/012023