All issues

This paper presents a universal method for constructing an agent-based model of complex systems for their further clear computer representation by means of object-oriented programming languages. The method specifies both steps of model developing from the mathematical description of the system to the determined architecture of the program simulating the system. The efficiency of the method is illustrated by the construction of the two simulation models for the complex systems of various origins: the interactive simulation of the stock exchange and space-time simulation of biological species competition.

Scheduling computational workflows represented by directed acyclic graphs (DAGs) is crucial in many areas of computer science, such as cloud/edge tasks with distributed workloads and data mining. The complexity of online DAG scheduling is compounded by the large number of computational nodes, data transfer delays, heterogeneity (by type and processing power) of executors, precedence constraints imposed by DAG, and the nonuniform arrival of tasks. This paper introduces the Multi-Agent Local Voting Protocol (MLVP), a novel approach focused on dynamic load balancing for DAG scheduling in heterogeneous computing environments, where executors are represented as agents. The MLVP employs a local voting protocol to achieve effective load distribution by formulating the problem as a differentiated consensus achievement. The algorithm calculates an aggregated DAG metric for each executor-node pair based on node dependencies, node availability, and executor performance. The balance of these metrics as a weighted sum is optimized using a genetic algorithm to assign tasks probabilistically, achieving efficient workload distribution via information sharing and reaching consensus among the executors across the system and thus improving makespan. The effectiveness of the MLVP is demonstrated through comparisons with the state-of-the-art DAG scheduling algorithm and popular heuristics such as DONF, FIFO, Min- Min, and Max-Min. Numerical simulations show that MLVP achieves makepsan improvements of up to 70% on specific graph topologies and an average makespan reduction of 23.99% over DONF (state-of-the-art DAG scheduling heuristic) across randomly generated diverse set of DAGs. Notably, the algorithm’s scalability is evidenced by enhanced performance with increasing numbers of executors and graph nodes.

The gradual incorporation of automated vehicles into the global transport networks leads to the need to develop tools to assess the impact of this process on various aspects of traffic. This implies a more organized movement of automated vehicles which can form uniformly moving platoons. The influence of the formation and movement of these platoons on the dynamics of traffic flow is of great interest. The currently most developed traffic flow models are based on the cellular automaton approach. They are mainly developed in the direction of increasing accuracy. This inevitably leads to the complication of models, which in their modern form have significantly moved away from the original philosophy of cellular automata, which implies simplicity and schematicity of models at the level of evolution rules, leading, however, to a complex organized behavior of the system. In the present paper, a simulation model of connected automated vehicles platoon dynamics in a heterogeneous transport system is proposed, consisting of two types of agents (vehicles): human-driven and automated. The description of the temporal evolution of the system is based on modified rules 184 and 240 for elementary cellular automata. Human-driven vehicles move according to rule 184 with the addition of accidental braking, the probability of which depends on the distance to the vehicle in front. For automated vehicles, a combination of rules is used depending on the type of nearest neighbors, regardless of the distance to them, which brings non-local interaction to the model. At the same time, it is considered that a group of sequentially moving connected automated vehicles can form an organized platoon. The influence of the ratio of types of vehicles in the system on the characteristics of the traffic flow during free movement on a circular one-lane and two-lane roads, as well as in the presence of a traffic light, is studied. The simulation results show that the effect of platoon formation is significant for a freeway traffic flow; the presence of a traffic light reduces the positive effect by about half. The movement of platoons of connected automated vehicles on two-lane roads with the possibility of lane changing was also studied. It is shown that considering the types of neighboring vehicles (automated or human-driven) when changing lanes for automated vehicles has a positive effect on the characteristics of the traffic flow.

The paper presents agent-based model for city formation named Technoscape which is both local and nonlocal. Technoscape can, to a certain degree, be also assumed as a model for emergence of global economy. The current version of the model implements very simple way of agents’ behavior and interaction, still the model provides rather interesting spatio-temporal patterns.

Locality and non-locality mean here the spatial features of the way the agents interact with each other and with geographical space upon which the evolution takes place. Technoscape agent is some conventional artisan, family, or а producing and trading firm, while there is no difference between production and trade. Agents are located upon and move through bounded two-dimensional space divided into square cells. The model demonstrates processes of agents’ concentration in a small set of cells, which is interpreted as «city» formation. Agents are immortal, they don’t mutate and evolve, though this is interesting perspective for the evolution of the model itself.

Technoscape provides some distinctively new type of self-organization. Partially, this type of selforganization resembles the behavior of segregation model by Thomas Shelling, still that model has evolution rules substantially different from Technoscape. In Shelling model there exist avalanches still simple equilibria exist if no new agents are added to the game board, while in Technoscape no such equilibria exist. At best, we can observe quasi-equilibrium, slowly changing global states.

One non-trivial phenomenon Technoscape exhibits, which also contrasts to Shelling segregation model, is the ability of agents to concentrate in local cells (interpreted as cities) even explicitly and totally ignoring local interactions, using non-local interactions only.

At the same time, while the agents tend to concentrate in large one-cell cities, large scale of such cities does not guarantee them from decay: there always exists a process of «enticement» of agents and their flow to new cities.

This work provides a new approach for constructing high-precision routes based on data from transport detectors inside the SUMO traffic modeling package. Existing tools such as flowrouter and routeSampler have a number of disadvantages, such as the lack of interaction with the network in the process of building routes. Our rlRouter uses multi-agent reinforcement learning (MARL), where the agents are incoming lanes and the environment is the road network. By performing actions to launch vehicles, agents receive a reward for matching data from transport detectors. Parameter Sharing DQN with the LSTM backbone of the Q-function was used as an algorithm for multi-agent reinforcement learning.

Since the rlRouter is trained inside the SUMO simulation, it can restore routes better by taking into account the interaction of vehicles within the network with each other and with the network infrastructure. We have modeled diverse traffic situations on three different junctions in order to compare the performance of SUMO’s routers with the rlRouter. We used Mean Absoluter Error (MAE) as the measure of the deviation from both cumulative detectors and routes data. The rlRouter achieved the highest compliance with the data from the detectors. We also found that by maximizing the reward for matching detectors, the resulting routes also get closer to the real ones. Despite the fact that the routes recovered using rlRouter are superior to the routes obtained using SUMO tools, they do not fully correspond to the real ones, due to the natural limitations of induction-loop detectors. To achieve more plausible routes, it is necessary to equip junctions with other types of transport counters, for example, camera detectors.

The research is devoted to the problem of the use of social networks as a tool of the illegal activity and as a source of information that could be dangerous to society. The article presents the structure of the multiagent system with which a social network groups could be clustered according to the criteria uniquely defines a group as a destructive. The agents’ of the system clustering algorithm is described.

In the presented work, a hybrid optimal simulation model of an assembly shop in the AnyLogic environment has been developed, which allows you to select the parameters of production systems. To build a hybrid model of the investigative approach, discrete-event modeling and aggressive modeling are combined into a single model with an integrating interaction. Within the framework of this work, a mechanism for the development of a production system consisting of several participants-agents is described. An obvious agent corresponds to a class in which a set of agent parameters is specified. In the simulation model, three main groups of operations performed sequentially were taken into account, and the logic for working with rejected sets was determined. The product assembly process is a process that occurs in a multi-phase open-loop system of redundant service with waiting. There are also signs of a closed system — scrap flows for reprocessing. When creating a distribution system in the segment, it is mandatory to use control over the execution of requests in a FIFO queue. For the functional assessment of the production system, the simulation model includes several functional functions that describe the number of finished products, the average time of preparation of products, the number and percentage of rejects, the simulation result for the study, as well as functional variables in which the calculated utilization factors will be used. A series of modeling experiments were carried out in order to study the behavior of the agents of the system in terms of the overall performance indicators of the production system. During the experiment, it was found that the indicator of the average preparation time of the product is greatly influenced by such parameters as: the average speed of the set of products, the average time to complete operations. At a given limitation interval, we managed to select a set of parameters that managed to achieve the largest possible operation of the assembly line. This experiment implements the basic principle of agent-based modeling — decentralized agents make a personal contribution and affect the operation of the entire simulated system as a whole. As a result of the experiments, thanks to the selection of a large set of parameters, it was possible to achieve high performance indicators of the assembly shop, namely: to increase the productivity indicator by 60%; reduce the average assembly time of products by 38%.