A study of attainability of the continuous part of the hybrid system

• Дата: 2018
• Автори: Denysenko, T. A., Nesteryuk, A. G., Denysenko, A. V.
• Формат: Стаття
• Мова: rus
• Опубліковано: Інститут проблем реєстрації інформації НАН України 2018
• Теми: attainability; discrete-continuous network; reduction; system with controlled structure; hybrid system; достижимость; дискретно-непрерывная сеть; редукция; система с управляемой структурой; гибридная система; досяжність; дискретно-безперервна мережа; редукція; система з керованою структурою; гібридна система
• Онлайн доступ: http://drsp.ipri.kiev.ua/article/view/142908
• Назва журналу: Data Recording, Storage & Processing

The issues of conducting research on the availability of a continuous part of hybrid systems, which are represented by language means of discrete-continuous networks using methods for reducing the dimension of the studied graph, are dealt with. At the present time in our country and abroad research teams are working on the development and investigation of various complex automatic control systems with a multimodal character of functioning that are represented by both discrete and continuous parts interacting with each other. An example of use of systems of this kind can serve objects of surface, underwater and space applications, various industries from the chemical to the aerospace industry (the process of launching a rocket or helicopter).Systems of this type and systems with a controlled structure (SCS), are described using the language tools of discrete-continuous (DC) networks. One of the tasks being without the solution of which often fails to carry out the development of automatic control systems, is the attainability of the hybrid system. Approaches to the solution of this problem were proposed using DC-networks, which makes it possible to reduce the verification of the SCS attainability property to the problem of checking the attainability of the corresponding graph of a DC network. This approach requires a attainability analysis of the continue part of the DC network as one of the stages of the analysis. It should be noted that the implementation of this stage should be repeated for each new structure obtained during the verification of the algorithm of the system under analysis. Thus, a fairly large amount of computation is necessary to check the attainability of the continuous part. One of the features of DC-networks, when describing with the help of objects of SCS, is the increased dimensionality of the graph of the network, and, as a consequence, of its matrices described. To reduce computational costs, the method used to reduce the dimension of the network graph was proposed in the paper. One of these methods is the convolution of the continuous part of the system according to pre-established rules. The main requirement is to preserve the attainability of output vertices of the transformed graph of the continuous part of the DC network from the input vertices, which reduces the time of analysis in the DCNET software environment and facilitates its mathematical calculations, which also led to a decrease in the requirements for the amount of used memory.