Simulation Research on the Complexity of Life Game

The relationship between complexity and various factors is explored through the simulation of the three neighbor ways of the game of life. It mainly discusses the state evolution process of cell populations under various evolutionary laws, various environmental scales and various initial states. Based on the discovery of a novel, long-lived and simple cell with an initial state, the periodic and stable cell morphology in Game of Life is introduced, thus reflecting the related complexity factors and changes. By simulating various environmental boundaries and comparing the steady-state graphs, it is concluded that a closed system will cause certain limitations in the final outcome. The limited environment will prevent the cell from expanding outward, but it can also create more periodic patterns. A limited environment is simultaneously an important factor in simplifying the system. In addition to the environment, the edge of chaos is also an important factor in the complexity of the system. An appropriate evolution rule can help the entire system find a balance in the chaos and present stable and interesting patterns. In addition, the correct neighbor method has a positive effect on the change of the cell. Finally, an infinite loop mode is set up to illustrate once again the wonder and complexity of Game of Life.

Estimation of the failure flow of a set of passenger car doors

An estimation of the failure flows is a prerequisite for the operation of industrial products. It is based on statistical data about failures that occur within technical items in the process of their operation. In the technical product documentation, this indicator shall be featured in the “Dependability parameter estimation” section. The dependability analysis of rolling stock is still affected by the difficulty of defining the methodology for evaluating this parameter at various system levels. For the purpose of analysing a multicomponent system, a reliability block diagram should be developed, and the possible replacement (redundant) elements should be taken into consideration. Multicomponent systems are often represented through various block diagrams, where, among others, the “m-out-of-n” structure may be used referring to a system with a parallel arrangement of elements that is operable when at least m elements operate. An example of such system is a set of passenger car doors. The manufacturers and customers may have different approaches to calculating technical system dependability. First, the required dependability indicator for the entire train is defined that, in turn, defines the dependability requirements for a car. At the same time, the dependability indicator for a car is determined by the respective values of its components (subsystems, units and parts). However, the nature of the relationship between a car and its components is not always taken into account. At the same time, car manufacturers can and should define in the regulatory documentation (and later supervise in operation) the dependability indicators for a set of doors (components of a car in our case) as a single system. However, the failure criteria of a set of doors are not always defined. This paper examines the method of calculating the failure flow for a set of passenger car doors based on operational data and the failure flow of a single door. Aim. To propose a method for calculating the failure flow of a set of 6 car doors by analysing the possible reliability block diagrams with subsequent transition to transition and state graphs.Conclusions. A number of block diagrams were developed for the purpose of dependability calculation of sets of passenger car doors based on the system failure criterion. The failure flow of a set of car doors was calculated according to the developed block diagrams. It is concluded that the Markovian method of calculating the failure flow is of higher priority than the logic-and-probability approach, since it takes into account the recovery factor. A Markovian method was proposed for calculating the failure flow and recovery time of a set of car doors for the “3-out-of-4” reliability block diagram.

Learning First-Order Representations for Planning from Black Box States: New Results

Recently Bonet and Geffner have shown that first-order representations for planning domains can be learned from the structure of the state space without any prior knowledge about the action schemas or domain predicates. For this, the learning problem is formulated as the search for a simplest first-order domain description D that along with information about instances I_i (number of objects and initial state) determine state space graphs G(P_i) that match the observed state graphs G_i where P_i = (D, I_i). The search is cast and solved approximately by means of a SAT solver that is called over a large family of propositional theories that differ just in the parameters encoding the possible number of action schemas and domain predicates, their arities, and the number of objects. In this work, we push the limits of these learners by moving to an answer set programming (ASP) encoding using the CLINGO system. The new encodings are more transparent and concise, extending the range of possible models while facilitating their exploration. We show that the domains introduced by Bonet and Geffner can be solved more efficiently in the new approach, often optimally, and furthermore, that the approach can be easily extended to handle partial information about the state graphs as well as noise that prevents some states from being distinguished.

Topological representation of cloth state for robot manipulation

Forty years ago the notion of configuration space (C-space) revolutionised robot motion planning for rigid and articulated objects. Despite great progress, handling deformable materials has remained elusive because of their infinite-dimensional shape-state space. Finding low-complexity representations has become a pressing research goal. This work tries to make a tiny step in this direction by proposing a state representation for textiles relying on the C-space of some distinctive points. A stratification of the configuration space for n points in the cloth is derived from that of the flag manifold, and topological techniques to determine adjacencies in manipulation-centred state graphs are developed. Their algorithmic implementation permits obtaining cloth state–space representations of different granularities and tailored to particular purposes. An example of their usage to distinguish between cloth states having different manipulation affordances is provided. Suggestions on how the proposed state graphs can serve as a common ground to link the perception, planning and manipulation of textiles are also made.

Finite automata with undirected state graphs

We investigate finite automata whose state graphs are undirected. This means that for any transition from state p to q consuming some letter a from the input there exists a symmetric transition from state q to p consuming a letter a as well. So, the corresponding language families are subregular, and in particular in the deterministic case, subreversible. In detail, we study the operational descriptional complexity of deterministic and nondeterministic undirected finite automata. To this end, the different types of automata on alphabets with few letters are characterized. Then, the operational state complexity of the Boolean operations as well as the operations concatenation and iteration is investigated, where tight upper and lower bounds are derived for unary as well as arbitrary alphabets under the condition that the corresponding language classes are closed under the operation considered.

Design and development of software industrial controllers based on status

Purpose. Propose a formal approach to the design and development of control system software. The methods. The bulk of the tasks solved by modern automation systems require the implementation of control algorithms based on finite state machines. When developing software for control systems, it is advisable to graphically represent control algorithms, as their design, analysis and operation are more understandable to consultants. Therefore, the proposed approach consists of three stages: drawing up a verbal description of the algorithm of the technological process, designing the control system software in the form of a state graph and software development. Findings. The paper analyzes the current state of design and software development of control systems based on industrial controllers. Based on this, it is established that there is currently no systematic approach to this issue, in the technical documentation and literature, as well as in training courses provided by companies producing hardware and software for industrial controllers, only general issues related to the use of their development environments are considered. and standard libraries. Based on this, the relevance of creating a formal approach to software development of industrial controllers. The originality. For the first time, a formal approach to the design and development of control system software based on programmable logic controllers in the Ladder Diagram language has been proposed. Practical implementation. The obtained approach allows to perform the transition from state graphs to their software implementation using only typical structural elements and requires only their adjustment according to the conditions and actions of the transition arcs. The development of this study involves solving complex issues of design and software development of industrial controllers based on state graphs in order to formalize them.