All issues

The localization of a vehicle is an important task in the field of intelligent transportation systems. It is well known that sensor fusion helps to create more robust and accurate systems for autonomous vehicles. Standard approaches, like extended Kalman Filter or Particle Filter, are inefficient in case of highly non-linear data or have high computational cost, which complicates using them in embedded systems. Significant increase of precision, especially in case when GPS (Global Positioning System) is unavailable, may be achieved by using landmarks with known location — such as traffic signs, traffic lights, or SLAM (Simultaneous Localization and Mapping) features. However, this approach may be inapplicable if a priori locations are unknown or not accurate enough. We suggest a new approach for refining coordinates of a vehicle by using landmarks, such as traffic signs. Core part of the suggested system is the Bayesian framework, which refines vehicle location using external data about the previous traffic signs detections, collected with crowdsourcing. This paper presents an approach that combines trajectories built using global coordinates from GPS and relative coordinates from Inertial Measurement Unit (IMU) to produce a vehicle's trajectory in an unknown environment. In addition, we collected a new dataset, including from smartphone GPS and IMU sensors, video feed from windshield camera, which were recorded during 4 car rides on the same route. Also, we collected precise location data from Real Time Kinematic Global Navigation Satellite System (RTK-GNSS) device, which can be used for validation. This RTK-GNSS system was used to collect precise data about the traffic signs locations on the route as well. The results show that the Bayesian approach helps with the trajectory correction and gives better estimations with the increase of the amount of the prior information. The suggested method is efficient and requires, apart from the GPS/IMU measurements, only information about the vehicle locations during previous traffic signs detections.

A numerically stable direct multiplicative method for solving systems of linear equations that takes into account the sparseness of matrices presented in a packed form is considered. The advantage of the method is the calculation of the Cholesky factors for a positive definite matrix of the system of equations and its solution within the framework of one procedure. And also in the possibility of minimizing the filling of the main rows of multipliers without losing the accuracy of the results, and no changes are made to the position of the next processed row of the matrix, which allows using static data storage formats. The solution of the system of linear equations by a direct multiplicative algorithm is, like the solution with LU-decomposition, just another scheme for implementing the Gaussian elimination method.

The calculation of the Cholesky factors for a positive definite matrix of the system and its solution underlies the construction of a new mathematical formulation of the unconditional problem of quadratic programming and a new form of specifying necessary and sufficient conditions for optimality that are quite simple and are used in this paper to construct a new mathematical formulation for the problem of quadratic programming on a polyhedral set of constraints, which is the problem of finding the minimum distance between the origin ordinate and polyhedral boundary by means of a set of constraints and linear algebra dimensional geometry.

To determine the distance, it is proposed to apply the known exact method based on solving systems of linear equations whose dimension is not higher than the number of variables of the objective function. The distances are determined by the construction of perpendiculars to the faces of a polyhedron of different dimensions. To reduce the number of faces examined, the proposed method involves a special order of sorting the faces. Only the faces containing the vertex closest to the point of the unconditional extremum and visible from this point are subject to investigation. In the case of the presence of several nearest equidistant vertices, we investigate a face containing all these vertices and faces of smaller dimension that have at least two common nearest vertices with the first face.

Comets and asteroids are recognized by the scientists and the governments of all countries in the world to be one of the most significant threats to the development and even the existence of our civilization. Preventing this threat includes studying the motion of large meteors through the atmosphere that is accompanied by various physical and chemical phenomena. Of particular interest to such studies are the meteors whose trajectories have been recorded and whose fragments have been found on Earth. Here, we study one of such cases. We develop a model for the motion and destruction of natural bodies in the Earth’s atmosphere, focusing on the Benešov bolid (EN070591), a bright meteor registered in 1991 in the Czech Republic by the European Observation System. Unique data, that includes the radiation spectra, is available for this bolid. We simulate the aeroballistics of the Benešov meteoroid and of its fragments, taking into account destruction due to thermal and mechanical processes. We compute the velocity of the meteoroid and its mass ablation using the equations of the classical theory of meteor motion, taking into account the variability of the mass ablation along the trajectory. The fragmentation of the meteoroid is considered using the model of sequential splitting and the statistical stress theory, that takes into account the dependency of the mechanical strength on the length scale. We compute air flows around a system of bodies (shards of the meteoroid) in the regime where mutual interplay between them is essential. To that end, we develop a method of simulating air flows based on a set of grids that allows us to consider fragments of various shapes, sizes, and masses, as well as arbitrary positions of the fragments relative to each other. Due to inaccuracies in the early simulations of the motion of this bolid, its fragments could not be located for about 23 years. Later and more accurate simulations have allowed researchers to locate four of its fragments rather far from the location expected earlier. Our simulations of the motion and destruction of the Benešov bolid show that its interaction with the atmosphere is affected by multiple factors, such as the mass and the mechanical strength of the bolid, the parameters of its motion, the mechanisms of destruction, and the interplay between its fragments.

An algorithm for solving the conjugation of aerodynamic and ballistic problems, which is based on the method of modeling with the help of a grid system, has been complemented by a numerical mechanism that allows to take into account the relative movement and rotation of bodies relative to their centers of mass. For a given configuration of the bodies a problem of flow is solved by relaxation method. After that the state of the system is recalculated after a short amount of time. With the use of iteration it is possible to trace the dynamics of the system over a large period of time. The algorithm is implemented for research of flight of systems of bodies taking into account their relative position and rotation. The algorithm was tested on the problem of flow around a body with segmental-conical form. A good correlation of the results with experimental studies was shown. The algorithm is used to calculate the problem of the supersonic fight of a rotating body. For bodies of rectangular shape, imitating elongated fragments of a meteoroid, it is shown that for elongated bodies the aerodynamically more stable position is flight with a larger area across the direction of flight. This de facto leads to flight of bodies with the greatest possible aerodynamic resistance due to the maximum midship area. The algorithm is used to calculate the flight apart of two identical bodies of a rectangular shape, taking into account their rotation. Rotation leads to the fact that the bodies fly apart not only under the action of the pushing aerodynamic force but also the additional lateral force due to the acquisition of the angle of attack. The velocity of flight apart of two fragments with elongated shape of a meteoric body increases to three times with the account of rotation in comparison with the case, when it is assumed that the bodies do not rotate. The study was carried out in order to evaluate the influence of various factors on the velocity of fragmentation of the meteoric body after destruction in order to construct possible trajectories of fallen on earth meteorites. A developed algorithm for solving the conjugation of aerodynamic and ballistic problems, taking into account the relative movement and rotation of the bodies, can be used to solve technical problems, for example, to study the dynamics of separation of aircraft stages.

The study completes a series of the author’s works devoted to the spread of particles population in supercritical catalytic branching random walk (CBRW) on a multidimensional lattice. The CBRW model describes the evolution of a system of particles combining their random movement with branching (reproduction and death) which only occurs at fixed points of the lattice. The set of such catalytic points is assumed to be finite and arbitrary. In the supercritical regime the size of population, initiated by a parent particle, increases exponentially with positive probability. The rate of the spread depends essentially on the distribution tails of the random walk jump. If the jump distribution has “light tails”, the “population front”, formed by the particles most distant from the origin, moves linearly in time and the limiting shape of the front is a convex surface. When the random walk jump has independent coordinates with a semiexponential distribution, the population spreads with a power rate in time and the limiting shape of the front is a star-shape nonconvex surface. So far, for regularly varying tails (“heavy” tails), we have considered the problem of scaled front propagation assuming independence of components of the random walk jump. Now, without this hypothesis, we examine an “isotropic” case, when the rate of decay of the jumps distribution in different directions is given by the same regularly varying function. We specify the probability that, for time going to infinity, the limiting random set formed by appropriately scaled positions of population particles belongs to a set $B$ containing the origin with its neighborhood, in $\mathbb{R}^d$. In contrast to the previous results, the random cloud of particles with normalized positions in the time limit will not concentrate on coordinate axes with probability one.

This article discusses the features of the numerical solutions of some problems for cnoidal waves, which are periodic solutions of the classical Korteweg – de Vries equation of the traveling wave type. Exact solutions describing these waves were obtained by communicating the autowave approximation of the Korteweg – de Vries equation to ordinary functions of the third, second, and finally, first orders. Referring to a numerical example shows that in this way ordinary differential equations are not equivalent. The theorem formulated and proved in this article and the remark to it include the set of solutions of the first and second order, which, in their ordinal, are not equivalent. The ordinary differential equation of the first order obtained by the autowave approximation for the description of a cnoidal wave (a periodic solution) and a soliton (a solitary wave). Despite this, from a computational point of view, this equation is the most inconvenient. For this equation, the Lipschitz condition for the sought-for function is not satisfied in the neighborhood of constant solutions. Hence, the existence theorem and the unique solutions of the Cauchy problem for an ordinary differential equation of the first order are not valid. In particular, the uniqueness of the solution to the Cauchy problem is violated at stationary points. Therefore, for an ordinary differential equation of the first order, obtained from the Korteweg – de Vries equation, both in the case of a cnoidal wave and in the case of a soliton, the Cauchy problem cannot be posed at the extremum points. The first condition can be a set position between adjacent extremum points. But for the second, third and third orders, the initial conditions can be set at the growth points and at the extremum points. In this case, the segment for the numerical solution greatly expands and periodicity is observed. For the solutions of these ordinary solutions, the statements of the Cauchy problems are studied, and the results are compared with exact solutions and with each other. A numerical realization of the transformation of a cnoidal wave into a soliton is shown. The results of the article have a hemodynamic interpretation of the pulsating blood flow in a cylindrical blood vessel consisting of elastic rings.

The article describes an improved paired comparison method, which systematizes in tables the rules of logical conclusions and formulas of checking indices for comparison of technical systems. To achieve this goal, the authors formulate rational rules of logical conclusions in making a paired comparison of the systems. In addition, for the purpose of consistency check of the results of the assessment, the authors introduce parameters such as «the number of scores gained by one system» and «systems’ quality index»; moreover, they design corresponding calculation formulas. For the purposes of practical application of this method to design computer programs, the authors propose to use formalized variants of interconnected tables: a table for processing and systematization of expert information, a table of possible logical conclusions based on the results of comparison of a set number of technical systems and a table of check values in the paired comparison method used in quality assessment of a definite number of technical systems. These tables allow one to organize procedures of the information processing in a more rational way and to predominantly exclude the influence of mistakes on the results of quality assessment of technical systems at the stage of data input. The main positive effect from the implementation of the paired comparison method is observed in a considerable reduction of time and resources needed to organize experts work, process expert information, and to prepare and conduct distant interviews with experts (on the Internet or a local computer network of an organization). This effect is achieved by a rational use of input data of the quality of the systems to be assessed. The proposed method is applied to computer programs used in assessing the effectiveness and stability of large technical systems.

We consider a mechanical system consisting of a rigid body and two masses that move inside the body along mutually perpendicular guides. The body has a flat face, which rests on a horizontal rough plane. The masses move inside the body in a vertical plane according to a harmonic law with the same period. It is assumed that the friction forces arising in the area of contact between the body and the supporting plane are described by the classical model of dry Coulomb friction, and the parameters of the problem are chosen so that the body can perform translationally rectilinearly motion. This mechanical system can serve as the simplest model of a capsule robot moving on a solid surface by moving internal elements.

We study the modes of motion of a body in which its velocity is periodic with a period equal to the period of motion of the internal masses. It is shown that if the body can starts to move from a state of rest by means of displacements of the masses, then for any permissible values of the problem parameters there is a periodic mode of motion. Depending on the parameter values, the nature of the periodic motion can be essentially different. In particular, both reversible and nonreversible driving modes are possible. In the non-reversion mode, the body moves in the same direction, and intervals of movement alternate with intervals of rest (body sticking). In the reversal mode, the body moves in both positive and negative directions over a time interval equal to one period. In this case, the body makes two stops during the period of movement. After stopping, the body either immediately continues moving in the opposite direction, or enters a sticking zone and rests for a finite period of time, and then stats moving in the opposite direction. It was also found that, at certain parameter values, a periodic reversal mode is possible, in which the body moves without sticking. A detailed classification of all possible types of periodic motion modes was carried out. Their complete qualitative description is given and the regions of their existence in the three-dimensional space of the parameters are constructed.

Fault-tolerance of a finite computing net with arbitrary graph, containing elements with certain probability of fault and restore, is analyzed. Algorithm for net growth at each work cycle is suggested. It is shown that if the rate of net increase is sufficiently big then the probability of infinity faultless work is positive. Estimated critical net increase rate is logarithmic over the number of work cycles.

Nowadays the random search became a widespread and effective tool for solving different complex optimization and adaptation problems. In this work, the problem of an average duration of a random search for one object by another is regarded, depending on various factors on a square field. The problem solution was carried out by holding total experiment with 4 factors and orthogonal plan with 54 lines. Within each line, the initial conditions and the cellular automaton transition rules were simulated and the duration of the search for one object by another was measured. As a result, the regression model of average duration of a random search for an object depending on the four factors considered, specifying the initial positions of two objects, the conditions of their movement and detection is constructed. The most significant factors among the factors considered in the work that determine the average search time are determined. An interpretation is carried out in the problem of random search for an object from the constructed model. The important result of the work is that the qualitative and quantitative influence of initial positions of objects, the size of the lattice and the transition rules on the average duration of search is revealed by means of model obtained. It is shown that the initial neighborhood of objects on the lattice does not guarantee a quick search, if each of them moves. In addition, it is quantitatively estimated how many times the average time of searching for an object can increase or decrease with increasing the speed of the searching object by 1 unit, and also with increasing the field size by 1 unit, with different initial positions of the two objects. The exponential nature of the growth in the number of steps for searching for an object with an increase in the lattice size for other fixed factors is revealed. The conditions for the greatest increase in the average search duration are found: the maximum distance of objects in combination with the immobility of one of them when the field size is changed by 1 unit. (that is, for example, with $4 \times 4$ at $5 \times 5$) can increase the average search duration in $e^{1.69} \approx 5.42$. The task presented in the work may be relevant from the point of view of application both in the landmark for ensuring the security of the state, and, for example, in the theory of mass service.