Search

The time-optimal control problem for an arbitrary number of nonsynchronous oscillators with a limited scalar control is considered. An analytical investigation of the problem is performed. The property of strong accessibility and global controllability is proved, and a program control is found that brings the system from the origin to a fixed point in the shortest time. Trajectories satisfying both the motion equations of the system and the additional conditions based on the matrix nondegeneracy conditions of the relay control have been found for bringing a group of oscillators to the origin. Two classification methods of trajectories according to the number of control switchings are compared: the one based on the necessary extremum conditions and the Neustadt–Eaton numerical algorithm. [ABSTRACT FROM AUTHOR]

The article considers the problem of combinatorial optimization of interception of rectilinearly moving targets as a modification of the traveling salesman problem. New macro characteristics and definitions for this problem are introduced and used to classify the obtained solutions. Vector criteria composed of several important for applications functionals are described. The principles of no-waiting and maximum velocity are proved for two types of criteria. An intelligent brute-force algorithm with dynamic programming elements for finding optimal plans according to the introduced intercept criteria is proposed and implemented. Statistics of solutions of the developed algorithm is collected for a set of different initial parameters and the proposed macro characteristics are investigated. The conclusions about their applicability as local rules for the greedy algorithm for finding a suboptimal intercept plan are drawn. [ABSTRACT FROM AUTHOR]

Three variants of the statistical complexity function, which is used as a criterion in the problem of detection of a useful signal in the signal-noise mixture, are considered. The probability distributions maximizing the considered variants of statistical complexity are obtained analytically and conclusions about the efficiency of using one or another variant for detection problem are made. The comparison of considered information characteristics is shown and analytical results are illustrated on an example of synthesized signals. A method is proposed for selecting the threshold of the information criterion, which can be used in decision rule for useful signal detection in the signal-noise mixture. The choice of the threshold depends a priori on the analytically obtained maximum values. As a result, the complexity based on the total variation demonstrates the best ability of useful signal detection. [ABSTRACT FROM AUTHOR]