CS & Cybernetics › Computer Science & Cybernetics ×

Showing 50 of 482 papers in Computer Science & Cybernetics

Stability of Nonlinear Impulsive Systems

A. Kh. GELIG
1968 SovietRxiv: ru-196801.42198

This paper studies stability and dissipativity of nonlinear impulsive control systems with pulse-width, frequency-pulse, amplitude, time, and phase modulation, including systems whose linear parts may contain distributed-parameter elements. It formulates sufficient frequency-domain conditions, expre…

NORMAL SEQUENCES AND FINITE AUTOMATA

V. N. Agafonov
1968 SovietRxiv: ru-196801.34465

This note examines the relationship between normal binary sequences and von Mises, Wald collectives defined by admissible selection strategies. After recalling normality in terms of limiting block frequencies with parameter p, it observes that strategies depending only on a fixed finite suffix are c…

ON THE ORDER OF THE NEIGHBORHOOD OF MAXIMAL INTERVALS FOR ALMOST ALL FUNCTIONS OF THE ALGEBRA OF LOGIC

A. A. Sapozhenko
1968 SovietRxiv: ru-196801.30368

This note studies the complexity parameter given by the largest order of the principal neighborhood of a maximal interval in the minimization of Boolean functions. Maximal intervals of a Boolean function are represented by a graph whose edges correspond to intersecting faces of the Boolean cube, and…

ON COMPARING THE COMPLEXITY OF REALIZATIONS OF BOOLEAN FUNCTIONS BY AUTOMATA AND TURING MACHINES

Yu. Ya. Breitbart
1968 SovietRxiv: ru-196801.22137

This note compares the complexity of realizing Boolean functions by finite automata without external memory and by Turing machines, where complexity is measured as the product of the number of internal states and worst case computation time. It defines several classes of allowed input variable order…

THE NUMBER, DEGREE OF DISTINGUISHABILITY, AND DIAMETER OF PERMUTATION AUTOMATA AND OF THE OPERATORS REALIZED BY THEM

A. D. Korshunov
1968 SovietRxiv: ru-196801.21873

The paper studies permutation Mealy automata and the operators realized by them, focusing on enumeration, connectedness, degree of distinguishability, and diameter in asymptotic regimes. It derives asymptotic formulas for the number of such automata and nonisomorphic operators, and shows that when t…

Regularization of the problem of rendezvous of motions

Corresponding Member of the Academy of Sciences of the USSR N. N. KRASOVSKII
1968 SovietRxiv: ru-196801.13836

The paper studies a pursuit or meeting problem for two controlled linear motions with bounded controls, where one control must be formed from the observed states rather than from the opponent’s realized control. It proposes a regularization based on replacing exact terminal coincidence in selected c…

ON THE GAME ENCOUNTER OF MOTIONS

N. N. Krasovskii
1968 SovietRxiv: ru-196801.08455

The paper studies a linear differential game of pursuit and evasion in which two motions have identical dynamics, bounded controls with the pursuer’s bound larger than the evader’s, and encounter is defined by equality of prescribed coordinates. It formulates an extremal aiming control for the pursu…

MINIMIZATION OF OXIDATION

A. Ya. Lerner, S. A. Malyi
1968 SovietRxiv: ru-196801.04050

This paper considers the optimal control problem of minimizing oxidation or decarburization of a metal surface during heating while satisfying prescribed initial and final mass-average temperatures. It represents several empirical oxidation laws in a general differential form and applies Pontryagin’…

ON THE THEORY OF ADAPTIVE SYSTEMS

V. A. YAKUBOVICH
1968 SovietRxiv: ru-196801.01573

This paper formalizes a simple class of adaptive systems, called “simplest robots,” whose control law changes on the basis of sensory experience until a prescribed target condition is consistently satisfied. The framework specifies external coordinates, environment, sensors, controls, tactics, and u…

ON THE SYNTHESIS OF OPTIMAL-ON-AVERAGE AUTOMATIC SYSTEMS

Unknown
1967 SovietRxiv: ru-196701.96354

This note addresses the synthesis of automatic control systems when practical design constraints make an unrestricted optimal feedback law difficult to find or implement. Instead of seeking an arbitrary control function of the state, it assumes a prescribed control-law structure containing finitely …

RELAXATION THEORY OF JACOBI METHODS

Unknown
1967 SovietRxiv: ru-196701.96007

This note develops a relaxation-theoretic treatment of Jacobi methods for diagonalizing symmetric matrices by successive plane rotations. It formulates the decrease of the off-diagonal quadratic functional in terms of relaxation multipliers and angles, giving necessary and sufficient conditions for …

Regularization of problems in the statistical dynamics of automatic control systems

V. V. Solodovnikov, V. L. Lenskii
1967 SovietRxiv: ru-196701.91736

This paper examines ill-posed problems arising in the statistical dynamics of optimal automatic control systems, especially the determination of polynomial filter functionals minimizing mean-square error. The authors formulate the optimality conditions as a first-kind integral equation in a Hilbert …

Some problems on the quieting of a linear system

V. I. Bondarenko, Yu. M. Filimonov
1967 SovietRxiv: ru-196701.88424

The problems of choosing controls $u_1(t)$ and $u_2(t)$ that bring linear systems $$\frac{dx}{dt}=Ax+bu_1,\quad\frac{dx}{dt}=Ax+bu_2$$ to the equilibrium state $x=0$ in a given time $a\le t\le T$ are considered, subject to the minimization of the following control intensity estimates: $$J(u_1^0)=\ma…

OPTIMAL STRATEGY IN CORRECTION

Corresponding Member of the USSR Academy of Sciences D. E. OKHOTSIMSKII,
1967 SovietRxiv: ru-196701.87908

The paper studies optimal correction strategies for a vehicle moving near a nominal trajectory under a linearized stochastic model with Gaussian insertion and measurement errors. Unlike fixed-time correction schemes, it treats flexible one- and two-impulse strategies in which correction times and im…

Regularization of certain pursuit problem

V. E. Tret'yakov
1967 SovietRxiv: ru-196701.87226

The problem of the minimax time $T$ until encounter with respect to a subset of selected coordinates is considered for two linear controllable objects described by identical equations: \begin{gather}\dot{y}=Ay+Bu\quad\dot{z}=Az+Bv,\notag\\y_{i_k}(\tau+T^0)=z_{i_k}(\tau+T^0),\quad T^0=\min_u\max_vT_{…

APPLICATION OF ADJUSTABLE FEEDBACK FOR IDENTIFICATION AND ESTIMATION OF THE STABILITY MARGIN OF STOCHASTIC OBJECTS

V. V. BELYI, M. F. DIMENTBERG
1967 SovietRxiv: ru-196701.86549

The paper considers identification and stability margin estimation for stochastic single-input, single-output objects subject to random disturbances and random parameter variations. It proposes using an adjustable feedback circuit to bring the closed system to a controlled self-oscillatory regime, s…

Comparison of the accuracy of numerical integration of second-order differential equations and the corresponding system of first-order differential equations

L. Ya. Andrianova
1967 SovietRxiv: ru-196701.84880

The paper presents a comparison of the errors of Störmer's method in the case of a single differential equation and Adams' method in the case of the corresponding system of first-order differential equations. The arguments are conducted within the framework of linearized error theory. The considerat…

Relative controllability of linear dynamical systems with delay

F. M. Kirillova, S. V. Churakova
1967 SovietRxiv: ru-196701.84507

This paper studies relative controllability and time-optimal control for linear dynamical systems with delayed state terms under bounded scalar controls. It introduces a determining equation whose rank conditions characterize relative controllability for stationary systems, gives criteria for the ex…

DIFFERENCE SCHEMES WITH A SPLITTING OPERATOR FOR SYSTEMS OF EQUATIONS OF THE FORM \(L_0 \dfrac{\partial u}{\partial t} + L_1u = f\)

E. G. D'yakonov
1967 SovietRxiv: ru-196701.83007

The paper studies finite difference schemes with operator splitting for initial boundary value problems involving systems of the form L0 partial u over partial t plus L1u equals f, where L0 and L1 are strongly elliptic spatial operators. It formulates a multi-dimensional factorized difference scheme…

The convergence of the method of collocation by lines

Yu. P. Jarcev
1967 SovietRxiv: ru-196701.80351

We consider the Dirichlet and Neumann boundary value problems for the equations \begin{align}L_u&\equiv\Delta u=v(x,y)\tag{1}\label{1},\\L_u&\equiv\Delta u-\lambda u=v(x,y)\tag{2}\label{2}\end{align} in the square $R[0 \le x, y \le \pi]$. Approximate solutions are sought in the form \begin{equation}…

APPLICATION OF CHAIN SEARCH IN ONE ALGORITHM FOR SOLVING ON A COMPUTER A CERTAIN CLASS OF PLANNING-ECONOMIC PROBLEMS

L. A. Lyusternik, I. E. Maizlin
1967 SovietRxiv: ru-196701.68278

The paper presents a computer algorithm for a class of planning and economic problems representable on acyclic directed graphs with arbitrarily numbered vertices and unordered arc data. It formulates a general recurrence over graph vertices that covers specification compilation, determination of pro…

On Optimal Control of Systems with Distributed Parameters

V. I. PLOTNIKOV
1967 SovietRxiv: ru-196701.66281

This note studies optimal control problems for distributed-parameter systems governed by parabolic equations with third-kind boundary conditions, extending earlier results from terminal-cost functionals to integral functionals over time and space. It treats measurable controls with values in a bound…

Analysis of a certain class of systems of differential-difference equations by the method of separation of motions

E. I. Gerashchenko
1967 SovietRxiv: ru-196701.65551

An approximate method for analyzing systems of equations describing controllers with digital computers is presented. The method consists of the artificial introduction of a “small” parameter for a subset of derivatives or differences, which allows for reducing the order of the equations under consid…

AUTOMATA WITH VARIABLE STRUCTURE

Unknown
1967 SovietRxiv: ru-196701.56436

This note generalizes finite automata by allowing transition functions and sets of marked states to vary with time, a modification motivated by limitations of time-invariant automata in representing certain events. It defines representability for events over a finite alphabet and gives a Myhill-type…

OPTIMAL LEARNING SYSTEMS

CYBERNETICS
1967 SovietRxiv: ru-196701.55551

This paper generalizes the statistical theory of optimal learning algorithms for automatic systems to cases in which unknown parameters of the joint distribution of input and required output signals vary randomly during learning and subsequent operation. It formulates the learning problem in Bayesia…

OPTIMAL CONTROL OF COMPOSITE SYSTEMS

V. V. Velichenko
1967 SovietRxiv: ru-196701.55277

The paper formulates an optimal control problem for composite dynamical systems whose motion is governed by one differential system up to a switching time determined by a surface crossing, and by another system thereafter, with matching conditions at the transition. By reducing the problem to one wi…

ON THE PROBLEM OF THE ENCOUNTER OF MOTIONS

N. N. Krasovskii, V. E. Tret'yakov
1967 SovietRxiv: ru-196701.54219

This note studies a differential game of pursuit and evasion for linear controlled motions with integral constraints on the remaining control resources, focusing on encounter in only a prescribed subset of phase coordinates. It shows that the extremal aiming rule, which solves the full-coordinate en…

ON THE THEORY OF THE METHOD OF FINITE DIFFERENCES FOR SOLVING NONLINEAR BOUNDARY-VALUE PROBLEMS

M. N. Yakovlev
1967 SovietRxiv: ru-196701.53490

The paper studies finite difference methods for nonlinear second order boundary value problems in two variables, under monotonicity and sign conditions on the differential operator that ensure uniqueness of the continuous problem. It analyzes square mesh approximations using central and one sided di…