## SEARCH

#### Institution

##### ( see all 1064)

- Russian Academy of Sciences 1381 (%)
- St. Petersburg State University 102 (%)
- Moscow State University 59 (%)
- Moscow State Aviation Institute 48 (%)
- Trapeznikov Institute of Control Sciences 46 (%)

#### Author

##### ( see all 3006)

- Novikov, D. A. 37 (%)
- Kibzun, A. I. 34 (%)
- Sukhanov, V. M. 30 (%)
- Polyak, B. T. 29 (%)
- Gurman, V. I. 28 (%)

#### Subject

##### ( see all 10)

- Computer-Aided Engineering (CAD, CAE) and Design 3300 (%)
- Mathematics 3300 (%)
- Mechanical Engineering 3300 (%)
- Systems Theory, Control 3300 (%)
- Calculus of Variations and Optimal Control; Optimization 3285 (%)

## CURRENTLY DISPLAYING:

Most articles

Fewest articles

Showing 1 to 10 of 3300 matching Articles
Results per page:

## Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays

### Automation and Remote Control (2010-10-01) 71: 2093-2101 , October 01, 2010

We present hardness and approximation results for the problem of preemptive scheduling of *n* independent jobs on *m* identical parallel machines subject to a migration delay *d* with the objective to minimize the makespan. We give a sharp threshold on the value of *d* for which the complexity of the problem changes from polynomial time solvable to NP-hard. Next, we give initial results supporting a conjecture that there always exists an optimal schedule with at most *m* − 1 job migrations. Finally, we provide a *O*(*n*) time (1 + 1/log_{2}*n*)-approximation algorithm for *m* = 2.

## Optimization of interorbital three-dimensional transfer trajectories for stage spacecraft

### Automation and Remote Control (2007-08-01) 68: 1372-1390 , August 01, 2007

Problems of three-dimensional trajectory optimization of transfers for stage spacecraft and spacecraft with auxiliary fuel tank (AFT) from the low circuit orbit of the Earth’s artificial satellite (EAS) into the geostationary orbit and optimization problems of fuel distribution in stages or tanks are solved. Control of spacecraft motion is conducted by jet engines of bounded thrust; stage engines can have different characteristics, i.e., thrust-to-weight ratio and specific thrust. The used stage or auxiliary fuel tank is detached on the passive segment. Detachment is considered to be instantaneous, if the spacecraft position and velocity do not change at the detachment instant and the mass decreases in jumping mode. The mass of detached tanks is considered proportionate to the mass of consumed fuel; the mass of engine and auxiliary constructions, to thrust-to-weight ratio. The useful mass of the spacecraft with the limited time of transfer is maximized. The considered problems are intricate nonlinear optimal control problems with discontinuous phase variables. They are formalized as optimal control problems by a union of dynamic systems and are solved on the basis of the corresponding principle of the maximum. In this paper, boundary-value problems of the principle of the maximum are numerically solved by the shooting method. The choice of computing schemes of the shooting method and solution to systems of nonlinear equations is conducted by using a series of auxiliary problems.

## An Adaptive Dynamic Controller for Output Control of a System

### Automation and Remote Control (2005-06-01) 66: 988-994 , June 01, 2005

A dynamic controller for controlling linear systems under *a priori* uncertainty of their parameters when only scalar inputs-outputs are measurable is designed.

## III International Conference “System Identification and Control Problems”

### Automation and Remote Control (2003-11-01) 64: 1826-1828 , November 01, 2003

## Possibilities of the Application of Fractal Lines and Grouped Operations in Multiprocessor Systems with a Rearrangeable Structure for Evolutionary Computations

### Automation and Remote Control (2003-12-01) 64: 1975-1987 , December 01, 2003

Fractal lines and grouped operations are considered for the use in multiprocessor computers with a rearrangeable structure of lines, which execute evolutionary algorithms. The regularity of fractal lines facilitates the subdivision of the common structure into portions and the performance of grouped operations. Grouped operations enable many processors to interact within one operation for obtaining the common result, which simplifies and accelerates the elaboration of collective decisions.

## Analytical model of data transmission in the IEEE 802.16 network

### Automation and Remote Control (2009-11-18) 70: 1843-1855 , November 18, 2009

In the wireless networks controlled by the IEEE 802.16 protocol, the subscriber stations reserve the common channel using the mechanism of competitive access. Developed was an analytical model for studying the efficiency of transmission of the upward traffic in IEEE 802.16 network including the processes of channel reservation by the algorithm of multiple random access and packet transmission.

## A Linear Quadratic Control for Discrete Systems with Random Parameters and Multiplicative Noise and Its Application to Investment Portfolio Optimization

### Automation and Remote Control (2003-10-01) 64: 1558-1570 , October 01, 2003

A quadratic control for discrete stochastic systems with random parameters and additive and multiplicative noises dependent on state and controls is studied. Equations for the optimal linear static and dynamic output controllers are derived. The controllers are robust to the type of the distribution of the vector of random parameters. The results are applied to dynamic investment portfolio optimization.

## Constructing Pontryagin extremals for the optimal control problem of asteroid fly-by

### Automation and Remote Control (2009-09-01) 70: 1499-1513 , September 01, 2009

We consider the problem of constructing Pontryagin extremals for the optimal control task of asteroid fly-by. This problem is a part of a large optimization problem posed on the Third Global Trajectory Optimization Competition. Information about the competition and problem details can be found at http://www2.polito.it/eventi/gtoc3 .

## Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems

### Automation and Remote Control (2007-05-01) 68: 901-911 , May 01, 2007

Various schemes are considered of the parallel implementation of the branch and bound method, as applied to multiprocessor computing systems (clusters) with the distributed memory. In the language of informal automata, questions are set out of the organization of the exchange of data and signals within the cluster, which afford the asynchronous operation of its processors. Common ideas are illustrated by the example of the classical traveling salesman problem and data of numerical experiments performed on the multiprocessor computing system-100 (MCS-100) are given.

## Dynamic Programming in the Problem of Decomposition Optimization

### Automation and Remote Control (2002-05-01) 63: 815-828 , May 01, 2002

Consideration was given to the “operator” version of the dynamic programming method in the problem of decomposing a nonempty set in the presence of inexact calculations of the Bellman function.