Showing 50 of 482 papers

The existence of a domain of accessibility

I. P. Karasev
1967 SovietRxiv: ru-196701.47391

For a system of two nonlinear differential equations $$\frac{dx}{dt}=f(x)+\nu u$$, the question of the reachability of the origin is considered. Here $$x=(\xi,\eta),\quad\frac{dx}{dt}=\biggl(\frac{d\xi}{dt},\frac{d\eta}{dt}\biggr),\quad f(x)=(f_1(\xi,\eta),f_2(\xi,\eta))$$ are variable vectors of th…

ON OPTIMAL PROCESSES IN TWO-PARAMETER DISCRETE SYSTEMS

O. V. Vasiliev, F. M. Kirillova
1967 SovietRxiv: ru-196701.36109

This paper studies optimal control problems for two-parameter discrete systems defined on a rectangular grid, with dynamics involving mixed and one-direction finite differences and a terminal linear cost. Using a discrete adjoint system and summation-by-parts identities, it derives variation formula…

On the Theory of Iterative Processes

The solution of many applied problems leads to the solution of the transcendental equation
1967 SovietRxiv: ru-196701.35373

This paper studies iterative methods for solving the transcendental equation f(x)=0 under minimal regularity assumptions. It introduces auxiliary functions based on a strictly increasing comparison function g and derives bounds and monotonicity conditions used to locate zeros on intervals to the rig…

ON ONE CLASS OF LEARNING RECOGNITION ALGORITHMS

G. M. ADELSON-VELSKII, P. E. KUNIN, A. A. LEMAN
1967 SovietRxiv: ru-196701.31388

This paper describes a class of learning recognition algorithms for separating two disjoint subsets of the vertices of an n-dimensional unit cube, using finite training samples from each set. The method constructs systems of “tubes,” defined by selected essential binary features, centers, and radii,…

On the Construction of Difference Analogues of Some Boundary Value Problems

A differential equation is given
1967 SovietRxiv: ru-196701.30255

The paper addresses the construction of finite difference analogues for multidimensional boundary value problems involving derivatives of arbitrary order, with the aim of achieving prescribed polynomial accuracy using the smallest possible number of grid unknowns. It derives an error representation …

On the problem of the analytic construction of regulators

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

The paper considers the well-known problem of the analytical design of a controller for a linear controlled system. However, in contrast to existing developments, this study examines a more complex nonlinear case rather than a quadratic optimality criterion. For the aforementioned criterion, the pro…

SYNTHESIS OF ALGORITHMS FOR CHANGING ADJUSTABLE COEFFICIENTS IN A SELF-TUNING CONTROL SYSTEM WITH A REFERENCE MODEL

Unknown
1967 SovietRxiv: ru-196701.27671

This paper addresses the synthesis of adjustment algorithms for a model reference self-tuning control system with time-varying plant coefficients. The system is reduced to an error equation between the controlled object and a reference model, and integral laws for the adjustable regulator coefficien…

On a Method for Organizing Sliding in a Dynamic System

N. G. Yarovoi
1967 SovietRxiv: ru-196701.18121

The paper considers a third-order dynamical system with a variable structure. The switching surface is defined by a pair of intersecting planes. Necessary and sufficient conditions for the existence of a sliding mode, stability conditions for motion along the switching surface, and necessary and suf…

CRITERIA FOR DISSIPATIVITY AND THE EXISTENCE OF PERIODIC SOLUTIONS OF PULSED AUTOMATIC SYSTEMS WITH ONE NONLINEAR BLOCK

Yu. A. Dmitriev
1967 SovietRxiv: ru-196701.10331

This paper studies forced processes in discrete pulsed automatic control systems with finitely many degrees of freedom and a single nonlinear block, represented by nonlinear difference equations with a stable linear part and sector-type restrictions on the nonlinearity. It formulates frequency-domai…

OPTIMAL LEARNING ALGORITHMS FOR AUTOMATIC SYSTEMS IN THE CASE OF A NONIDEAL TEACHER

Corresponding Member of the Academy of Sciences of the USSR V. S. PUGACHEV
1967 SovietRxiv: ru-196701.04288

This paper develops Bayesian optimal learning algorithms for automatic systems trained by a nonideal teacher, whose output may be only a statistical estimate or evaluation rather than the exact required response. It models the system, teacher, and required behavior by conditional decision functions …

AUTONOMY IN MULTIVARIABLE AUTOMATIC CONTROL SYSTEMS WITH VARIABLE STRUCTURE

Academician B. N. PETROV, S. V. EMEL’YANOV, M. B. GRITZENKO
1966 SovietRxiv: ru-196601.92509

This paper addresses the synthesis of autonomous control for multivariable automatic control systems whose controlled coordinates are coupled and whose plant parameters vary over wide ranges. It proposes using variable-structure control, with discontinuous regulator coefficients and sliding modes on…

CONDITIONING IN GENERAL COMPUTATIONAL PROBLEMS

Yu. I. Lyubich
1966 SovietRxiv: ru-196601.89529

The paper formulates a general notion of conditioning for computational problems involving a continuous operator between normed linear spaces, where input data are known only within a prescribed error ball. It defines a condition measure as the maximal ratio of relative output error to relative inpu…

ON AN ALGORITHM FOR THE RAPID FINDING OF PSEUDOMAXIMA OF A FUNCTION DEFINED ON AN INTEGER LATTICE, WITH LIMITED MEMORY

G. M. ADEL’SON-VEL’SKII, A. A. LEMAN
1966 SovietRxiv: ru-196601.80935

The paper studies the problem of constructing a partition of a finite ordered integer lattice determined by successive maxima of a function, where after each maximum is found all lattice points lying in coordinate planes through it are excluded. It introduces the notion of a k-maximum and builds com…

A NUMERICAL METHOD FOR FINDING ASYMPTOTICALLY STABLE SOLUTIONS OF A SYSTEM OF ORDINARY DIFFERENTIAL EQUATIONS

A. I. Kononenko, V. D. Milman
1966 SovietRxiv: ru-196601.73789

This paper studies Euler-type numerical procedures for computing asymptotically stable solutions of systems of ordinary differential equations while exploiting stability to control accumulated error. Using Lyapunov functions, it proves convergence of variable-step iterative schemes for asymptoticall…

STATISTICAL MODELING OF A CERTAIN CLASS OF COMPLEX SYSTEMS

Kh. Sh. Margulis, G. Ya. Fridman
1966 SovietRxiv: ru-196601.69409

This paper develops a statistical modeling approach for complex cybernetic production systems in which the production process and its control hierarchy must be studied jointly. Using the example of a petroleum refinery with continuous processing units, the authors formalize the enterprise as a self-…

SOME NEW ESTIMATES IN THE THEORY OF FINITE AUTOMATA

CYBERNETICS
1966 SovietRxiv: ru-196601.67358

The paper studies bounds for the number of states arising in the optimal determinization of finite orthogonal systems of directed graphs, a construction motivated by automaton synthesis. Extending earlier one graph estimates of Lyubich and Ostrovskii, it proves an upper bound for systems with severa…

PNEUMATIC COMPUTING TECHNOLOGY OF INTERMITTENT ACTION

CYBERNETICS
1966 SovietRxiv: ru-196601.61083

The paper presents a method for intermittent pneumatic computation based on the gas equation of state, using pneumatic capacitances to perform basic operations without complex mechanical computing devices. It develops the principle of a pulsating pneumatic resistance, in which alternating contact wi…

ON THE QUESTION OF CONTROLLABILITY OF DYNAMIC SYSTEMS\

Yu. M.-L. KOSTYUKOVSKII
1966 SovietRxiv: ru-196601.59906

This paper studies output controllability for linear nonstationary dynamic systems described by time-varying matrix equations with piecewise-continuous controls. It establishes equivalences between controllability conditions expressed through the fundamental matrix of the homogeneous system and cond…

APPLICATION OF THE INVERSE METHOD FOR ESTABLISHING DERIVABILITY TO THE THEORY OF DECIDABLE FRAGMENTS OF THE CLASSICAL PREDICATE CALCULUS

S. Yu. Maslov
1966 SovietRxiv: ru-196601.58373

This paper applies Maslov’s inverse method for establishing derivability to decidable fragments of the classical predicate calculus. It introduces technical notions of decomposable and favorable sets, uses saturation and restricted inverse-method lists, and proves decidability for a class K defined …

ON AN ITERATIVE METHOD FOR SOLVING INTEGER PROGRAMMING PROBLEMS

I. I. Pyatetskii-Shapiro, V. A. Volkonskii, L. V. Levina,
1966 SovietRxiv: ru-196601.54715

This paper proposes a randomized iterative heuristic for large 0,1 integer linear programming problems arising in optimal control and economic planning, where exact methods may be computationally impractical. The method replaces maximization by successive feasibility tests with increasing objective …

ON SUFFICIENT CONDITIONS FOR OPTIMALITY

CYBERNETICS
1966 SovietRxiv: ru-196601.53792

This note studies time-optimal control problems in which the admissible control set depends on the phase coordinates and is described by inequality constraints that may change across lower-dimensional subsets of the phase space. Extending sufficiency results related to Boltyanskii’s work on the maxi…

Block Length Required to Achieve a Given Redundancy

R. E. Krichevskii
1966 SovietRxiv: ru-196601.52077

This note studies the block length required to achieve a prescribed absolute redundancy in optimal decodable binary coding of independent source letters with given probabilities. It relates the asymptotic behavior of the redundancy A(n) to arithmetic properties of the logarithmic probability ratios,…

COEFFICIENT-FREE EQUATIONS IN WORDS

Yu. I. Khmelevskii
1966 SovietRxiv: ru-196601.40187

This note studies coefficient-free equations in words over a finite alphabet, with emphasis on nontrivial solutions, defined as solutions not expressible as powers of a single word. It first shows that any finite system of such equations is equivalent, with respect to nontrivial solutions, to a sing…

ON THE THEORY OF NETWORK SYSTEMS OF PLANNING AND CONTROL

Yu. P. Krivenkov
1966 SovietRxiv: ru-196601.38426

This paper examines stochastic activity-duration estimates in network planning and control, arguing that standard PERT-style assumptions can give inconsistent distributional specifications and substantial errors in estimating project completion time. It proposes an activity model that yields a beta …

CYBERNETICS

AND CONTROL THEORY
1966 SovietRxiv: ru-196601.35106

This note studies optimal control problems for stationary linear parabolic systems with distributed parameters, where the control enters through a third boundary condition and the performance criterion depends on the terminal state, or on the terminal state and its gradient. It formulates existence …

TURING MACHINES WORKING ON A PLANE

N. V. Beljakin
1966 SovietRxiv: ru-196601.33993

This note studies generalized nonerasing Turing machines that write on a square grid rather than a one-dimensional tape, moving horizontally or vertically at each step. It defines computation of partial recursive operators whose input and output alphabets are constrained by fixed minimal and maximal…