编号 5 (2023)

The article is devoted to an asymptotic behavior of a multi-agent system with information links. We proved that the orthogonal projection method proposed for the regularization of the consensus protocol is characterized by a pseudoinverse matrix for the introduced auxiliary matrix for an arbitrary communication digraph of a multi-agent system. We cosidered the eigenprojection of the Laplacian matrix corresponding to the communication digraph, in which the influences on the fixed agent change proportionally. We obtained a number of results that are of independent importance and can be used in models of multi-agent systems with different protocols.

We consider a smooth autonomous system in general form that admits a non-degenerate periodic solution. A global family (with respect to the parameter h) of nondegenerate periodic solutions is constructed, the law of monotonic variation of the period on the family is derived, and the existence of a reduced second-order system is proved. For it, the problem of stabilizing the oscillation of the controlled system, distinguished by the value of the parameter h, is solved. A smooth autonomous control is found, and an attracting cycle is constructed.

This paper is devoted to a multifaceted analysis of person re-identification (ReID) in video surveillance systems and modern solution methods using deep learning. The general principles and application of convolutional neural networks for this problem are considered. A classification of person ReID systems is proposed. The existing datasets for training deep neural architectures are studied and approaches to increasing the number of images in databases are described. Approaches to forming human image features are considered. The backbone models of convolutional neural network architectures used for person ReID are analyzed and their modifications as well as training methods are presented. The effectiveness of person ReID is examined on different datasets. Finally, the effectiveness of the existing approaches is estimated in different metrics and the corresponding results are given

This paper considers an optimal movement routing problem with constraints. One such constraint is due to decomposing the original problem into a preliminary subproblem and a final subproblem; the tasks related to the preliminary problem must be executed before the tasks of the final subproblem begin. In particular, this condition may arise in the tool control problem for thermal cutting machines with computer numerical control (CNC): if there are long parts among workpieces, the cutting process near a narrow material boundary should start with these workpieces since such parts are subject to thermal deformations, which may potentially cause rejects. The problem statement under consideration involves two zones for part processing. The aggregate routing process in the original problem includes a starting point, a route (a permutation of indices), and a particular track consistent with the route and the starting point. Each of the subproblems has specific precedence conditions, and the travel cost functions forming the additive criterion may depend on the list of pending tasks. A special two-stage procedure is introduced to apply dynamic programming as a solution method. The structure of the optimal solution is established and an algorithm based on this structure is developed. The algorithm is implemented on a personal computer and a computational experiment is carried out.