|
|
 Выпуск 58
- Algazin G., Matyunin E. Optimal strategies of players under asymmetric information
Optimal decisions of players under asymmetric information and probabilistic uncertainty are studied using the concept of the Bayesian Nash equilibrium. Calculation of the Bayesian Nash equilibrium for the class of games considered is reduced to solving a system of integral equations. We suggest numerical methods and provide the algorithm to find the solution in such games.
- Vykhovanets V., Kryzhanovskaya A. Combined networks of control and data
An approach is considered to dynamic process management based on the use of combined networks of control and data. Drawing a data flow and a control flow in a joint process diagram allows automatically generating the executable code for process control. A theory of types is developed to care for data types. The data are stored in the form of nested named lists. A combined network of control and data is shown to be a universal algorithmic model with strong data typing. Synthesis of a network for the given transfor-mation of data types is proved to be an algorithmically unsolvable problem. The use of combined networks of control and data can improve the quality of control in technological, manufacturing and organizational processes.
- Zhilyakova L. Resource network with limited capacity of attractor vertices
An asymmetric regular resource network with limited capacity of attractor vertices is considered. Provided attractors’ capacity is unlimited they accumulate all the resource of a network, except some small volumes left in the rest vertices. On the other hand, attractors of limited capacity are saturated, and then another set of vertices starts attracting the rest resource. We refer to this phenomenon as to secondary attractivity, and such vertices, respectively, are called secondary attractors. We study the flows in a network with different total amount resource and search the threshold values which lead to a new behavior of a network.
- Vedeshenkov V., Kurako E., Lebedev V. On diagnosability of components in digital systems with structure of minimal quasicomplete 7х7 graph with 2 paths connecting 2 terminals
An approach is suggested to estimate diagnosability of components (a terminal, a router, a communication line) of digital systems (DS) with the novel structure of minimal quasicomplete graph for 7 terminals and 7 routers with 2 paths between 2 terminals. The analysis of typical failures in the system allows proposing estimated component diagnosability metrics. It is shown that diagnosing techniques and methods used guarantee the correct diagnosis for no more than: two faulty terminals and two faulty routers, or one faulty terminal and three faulty routers, or two broken communication lines
- Melentiev V. On topological scalability of computing systems
Most results on parallel task and system scaling met in the literature are guided by the specific technological and topological implementation. Unique properties of a problem originated from the class of the task solved, from technical, technological and topological implementation of the system, firstly, prevent using these results directly in the analysis and synthesis of the other parallel systems and tasks, and, secondly, hide the general pattern of mutual conditionality of the given parameters of system with demanded performance metrics. On the basis of the model suggested in this paper we try to fill the existing gap with the main goal to assess the impact of the topology of a parallel system on scalability of a system or a task.
- Antonenko A., Loshkarev I., Pankov V., Ugolnitsky G. Solving problem of innovation funding incentive in electricity power industry. part 1.optimization models
We study optimization models of interest coordination in the electric power industry. Algorithms are implemented in applied software. Analysis of computer simulations provides motivation for deployment of the new generation of electricity meters.
- Vozhakov A., Gitman M., Stolbov Y. Models of collective decision-making in production
Four models of collective decision-making are considered. The models are based on the comparison of alternatives and on the expert group selection. A committee is considered to be an organizational form of expert work. The models are compared in an illustrative example of the best production plan selection in an industrial company.
- Geraskin M., Egorova V. Optimal planning mechanisms for assemble-to-order manufacturing: time and money criteria
The problem is studied of raw material inventory optimization in companies, which manufacture consumer goods for market of limited volume. We analyze factors leading to the use of the assemble-to-order planning policy in firms, which compete on oligopsony markets, and suggest optimization models of procurement order planning either to maximize profit or to minimize the operation/manufacturing cycle under the monotonic increase of costs, revenue, and cash flow. The model takes into account price and technology constraints. We design analytical mechanisms of optimal order planning for bearing industry and model the region of compromise for orders being extremal with respect to different criteria.
- Shumov V. Model of safety of the state
In this paper we consider the model of safety of the state that reflects the dichotomy between development and conservation values. The model takes into account the main factors affecting the historical processes: geography, demography and technology.
- Lazarev A., Tarasov I. Scheduling problem for two-station single track railway with sidings
The paper is concerned with the problem of scheduling trains traveling between two stations, which are connected by a single railway track with one siding. The presented algorithm constructs an optimal schedule
- Vatamaniuk I., Panina G., Ronzhin A. Reconfiguration of robot swarm formation
An algorithm of control and navigation for a swarm of autonomous homogeneous mobile robots involved in the formation of a convex space surface is discussed. Robot trajectories during reconfiguration minimize the cost of time and energy (computation time and the total length of robot paths), taking into account collision control. The developed algorithm has quadratic computational complexity. During the experiments reconfiguration of a swarm with various numbers of robots (from 10 to 10,000 robots) was modeled. The number of collisions was evaluated assuming massed start of all robots.
- Yakovlev K., Baskin E., Andreychuk A. Dynamics constraint-aware planning of multiple paths for unmanned vehicle
We study alternative paths’ planning problem for an unmanned vehicle. It constitutes a key part of a bigger problem – that of multi-agent path planning, i.e., finding a non-conflicting path set for a coalition of vehicles. We propose a new path-planning technique, which indirectly takes into account vehicle movement dynamics and guarantees feasibly of resulting paths. We also elaborate a number of extensions of the method proposed. We conduct an empirical study of all introduced algorithms by running the large number of experiments simulating nap-of-the-earth flight of a compact multirotor unmanned aerial vehicle in urban environment.
|
|
