Spherical gearing with intermediate ball elements: parameter ranges with a high contact ratio

The paper presents analytical research of the geometry and kinematical parameters of spherical gearing with ball intermediate elements. The main attention is paid to the influence of the offset coefficient on the tooth geometry generation, the contact ratio and the motion transmission angle. Intermediate ball element racetracks on the gear are trochoidal curves on a spherical surface. Two areas for the offset coefficient values providing a high value of the contact ratio – basic trochoid (without offset) and prolate trochoid with abutting racetracks of adjacent ball elements ― were revealed. Analysis of the investigated parameters showed that for power transmission, it is preferable to use spherical gearing without an offset, and for kinematic transmission, it is possible to use profiles with a large offset. The present study allows making a rational choice of geometrical parameters depending on the transmission predestination

The shortest common parameterized supersequence problem

In this paper, we consider the problem of the shortest common parameterized supersequence. In particular, we consider an explicit reduction from the problem to the satisfiability problem. © 2013 Anna Gorbenko and Vladimir Popov

The swap common superstring problem

In this paper we consider an approach to solve the swap common superstring problem. this approach is based on an explicit reduction from the problem to the satisfiability problem

Computational experiments for the problem of footstep planning for humanoid robots

It is well known that motion planning problems for humanoid robots are of particular interest. Footstep planning is one of such problems. We describe an approach to solve the footstep planning problem in a free unbounded environment. This approach is based on an explicit reduction from the problem to the satisfiability problem. © 2013 Anna Gorbenko and Vladimir Popov

The force law design of artificial physics optimization for starting population selection for GSAT

GSAT is a well-known satisfiability search algorithm which uses some random functions. In this paper, we consider an artificial physics optimization for computing a function of starting population

A genetic algorithm with expansion and exploration operators for the maximum satisfiability problem

There are many problems that standard genetic algorithms fail to solve. Refinements of standard genetic algorithms that can be used to solve hard problems has caused considerable interest. In this paper, we consider genetic algorithms withexpansion and exploration operators for the maximum satisfiability problem

On Hamilton paths in grid graphs

In this paper we consider an approach to solve the Hamilton path problem for grid graphs. This approach is based on an explicit reduction from the problem to the satisfiability problem

Coevolving solutions of the 3-satisfiability problem

Coevolutionary genetic algorithms are genetic algorithms that evolve simultaneously two or more populations with coupled fitness. In this paper we consider coevolutionary genetic algorithms for the 3-satisfiability problem