×

You are using an outdated browser Internet Explorer. It does not support some functions of the site.

Recommend that you install one of the following browsers: Firefox, Opera or Chrome.

Contacts:

+7 961 270-60-01
ivdon3@bk.ru

  • Optimization of result of the "Cut-Glue" approximation method of experimental data using a swarm algorithm

    The construction of mathematical models of objects of experimental or computer simulation is associated with the mathematical processing of experimental data. The point dependences of the output variables for the input variables obtained for them are essentially nonlinear, piecewise, sometimes discontinuous. Approximation of such dependencies using polynomial expansions or spline functions is both difficult and involves large errors. A fundamentally new solution to this problem was proposed in the article. This method, called the "Cut-Glue" approximation method, is based on the partitioning of the modeled dependence into sections, the approximation of each section by polynomial dependencies, the multiplicative "excision" from each dependence of the fragments along the boundaries of the plot and the additive "gluing" them together into a single function - the model of the approximated dependence . The analyticity property of the resulting function allows to study the model and use it in models of vehicle dynamics. One of the stages of the "Cut-Glue" method is the "Glue" process - the additive "gluing" of fragments into a single function. For this, an auxiliary multiplicative function is used. The function of this function includes the steepness of the pulse fronts. In this paper, a developed modification of the method of burrowing particles is used in the problem of research and suboptimization of this parameter. As a test bench of the developed algorithm developed a special software tool.

    Keywords: optimization, approximation, mathematical model, experimental data, heuristic methods, the method of burrowing particles

  • Target distribution methods for vehicles in the group for warfare

    In this paper, we describe three target distribution methods for vehicle group control. The purpose of the methods being developed is to increase the number of defenders who survived after the fight with the enemy. The first method introduces a priority system based on the distance to the robot, as well as the distance to the protected area. The second method is based on the application of the modified swarm particle method, and the third method is based on the evolutionary-genetic algorithm. To demonstrate the work of each method, software was developed in C # and Python. The performed simulation showed the effectiveness of each method developed. Sixty experiments were carried out, 3 parameters were evaluated in each experiment. The best results were achieved using a method based on the priority system.

    Keywords: vehicle, group control, priority, target distribution, optimization, particle swarm optimization, evolutionary-genetic algorithm, heuristic method