Discrete linear polytopic systems affected by random correlated stationary disturbances are considered. New numerical methods for estimating of the anisotropic norm of a polytopic system using linear matrix inequalities are proposed.
Discrete linear polytopic systems affected by random correlated stationary disturbances are considered. New numerical methods for estimating of the anisotropic norm of a polytopic system using linear matrix inequalities are proposed.
This paper conceptualizes the main principles of comprehensive software verification for an onboard spacecraft control system. An optimal comprehensive verification strategy for onboard software is selected by rigorously stating and solving the corresponding optimization problem. Software verification methods with functional correctness indicators are proposed.
The problem of obtaining three-dimensional radio images of objects with increased resolution based on the use of ultra-wide-band pulse signals and new methods of their digital processing is considered. The inverse problem of reconstructing the image of a signal source with a resolution exceeding the Rayleigh criterion has been solved numerically. Mathematically, the problem is reduced to solving the Fredholm integral equation of the first kind by numerical methods based on the representation of the solution in the form of decomposition into systems of orthogonal functions. The method of selecting the systems of functions used, which increases the stability of solutions, is substantiated. Variational problems of optimizing the shape and duration of ultra-wide-band pulses have been solved, ensuring the maximum possible signal-to-noise ratio during location studies of objects with fully or partially known signal reflection characteristics. The proposed procedures make it possible to increase the range of measuring systems, and also make it possible to increase the stability of solutions to inverse problems. It is shown that the use of the developed methods for achieving super-resolution to process ultra-wideband signals dramatically improves the quality of 3D images of objects in the radio range.
The problem of cargoes transportation scheduling in the transport network represented by an undirected multigraph is considered. Transportations between vertices are provided at predefined time intervals. The iterative algorithm to search for a solution approximate to the optimal one by criterion value is proposed in the problem under consideration. The algorithm is constructed on the base of solutions of mixed integer linear programming problems. The applicability of the algorithm is tested by the example with more than 90 million binary variables.
A system is studied such that this system belongs to the class of dynamical systems called the Buslaev nets. This class has been developed for the purpose of creating traffic models on network structures such that, for these models, analytical results can be obtained. There may be other network applications of Buslaev nets. The considered system is called an open chain of contours. Segments called clusters move along circumferences (contours) according to prescribed rules. For each contour (except the leftmost and rightmost contours) there are two adjacent contours. Each of the leftmost and rightmost contours has one adjacent contour. There is a common point (node) for any two adjacent contours. Results have been obtained on the average velocity of cluster movement, taking into account delays during the passage through nodes. These results generalize the results obtained previously for a particular case of the system under consideration.
This paper considers the problem of identifying (estimating) faults in systems described by linear models under exogenous disturbances. It is solved using optimal control methods; in comparison with sliding mode observers, they avoid high-frequency switching. The solution method proposed below involves a reduced model of the original system that is sensitive to faults and insensitive to disturbances. The corresponding theory is illustrated by an example.
The problem of indirect single-position coordinate determination based on the smoothed measurements of bearing and the radial velocity of an object is solved considering motion invariants and singular measurement errors. Such errors are represented as an appropriate linear combination with unknown spectral coefficients in a given finite-dimensional functional space. Possible application of the developed method to different models of motion and observation is considered. Analytical relations are derived for estimating accuracy characteristics and methodological errors. A comparative evaluation of computational cost is presented.
A single machine scheduling problem with a given partial order of jobs is considered. There are subsets of jobs called courses. It is necessary to schedule jobs in such a way that the total weighted duration of all courses is minimal. We consider the case when the initial job and the final one of each course are uniquely determined. The NP-hardness of the problem under consideration is proved. We propose an algorithm for solving the problem, the complexity of which depends polynomially on the total number of jobs, but exponentially on the number of courses, which makes it possible to use it efficiently with a fixed small number of courses and an arbitrary number of jobs.
The speed-in-action problem for a linear discrete-time system with bounded control is considered. In the case of superellipsoidal constraints on the control, the optimal control process is constructed explicitly on the basis of the discrete maximum principle. The problem of calculating the initial conditions for an adjoint system is reduced to solving a system of algebraic equations. The algorithm for generating a guaranteeing solution based on the superellipsoidal approximation method is proposed for systems with general convex control constraints. The procedure of superellipsoidal approximation is reduced to solving a number of convex programming problems. Examples are given.
The milestones of the history of the scientific school on cybernetics (the School), established in 1959 by outstanding scientist V.A. Yakubovich at Leningrad State University (LSU), are presented. The connections of the School with other Russian and foreign scientific schools in related fields are outlined.