A study of attainability of the continuous part of the hybrid system
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...
Збережено в:
| Дата: | 2018 |
|---|---|
| Автори: | , , |
| Формат: | Стаття |
| Мова: | Russian |
| Опубліковано: |
Інститут проблем реєстрації інформації НАН України
2018
|
| Теми: | |
| Онлайн доступ: | http://drsp.ipri.kiev.ua/article/view/142908 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Data Recording, Storage & Processing |
Репозитарії
Data Recording, Storage & Processing| id |
drspiprikievua-article-142908 |
|---|---|
| record_format |
ojs |
| spelling |
drspiprikievua-article-1429082019-12-27T06:23:35Z A study of attainability of the continuous part of the hybrid system Исследование достижимости непрерывной части гибридной системы Дослідження досяжності безперервної частини гібридної системи Denysenko, T. A. Nesteryuk, A. G. Denysenko, A. V. attainability discrete-continuous network reduction system with controlled structure hybrid system достижимость дискретно-непрерывная сеть редукция система с управляемой структурой гибридная система досяжність дискретно-безперервна мережа редукція система з керованою структурою гібридна система 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. Рассмотрены вопросы проведения исследования непрерывной части гибридных систем, представленных языковыми средствами дискретно-непрерывных сетей с использованием подхода уменьшения размерности исследуемой сети. Розглянуто питання проведення дослідження безперервної частини гібридних систем, що представлені мовними засобами дискретно-безперервних мереж з використанням підходу зменшення розмірності досліджуваної мережі. Інститут проблем реєстрації інформації НАН України 2018-06-19 Article Article Рецензована Стаття application/pdf http://drsp.ipri.kiev.ua/article/view/142908 10.35681/1560-9189.2018.20.2.142908 Data Recording, Storage & Processing; Vol. 20 No. 2 (2018); 23–29 Регистрация, хранение и обработка данных; Том 20 № 2 (2018); 23–29 Реєстрація, зберігання і обробка даних; Том 20 № 2 (2018); 23–29 1560-9189 ru http://drsp.ipri.kiev.ua/article/view/142908/140355 Авторське право (c) 2021 Реєстрація, зберігання і обробка даних |
| institution |
Data Recording, Storage & Processing |
| baseUrl_str |
|
| datestamp_date |
2019-12-27T06:23:35Z |
| collection |
OJS |
| language |
Russian |
| topic |
attainability discrete-continuous network reduction system with controlled structure hybrid system |
| spellingShingle |
attainability discrete-continuous network reduction system with controlled structure hybrid system Denysenko, T. A. Nesteryuk, A. G. Denysenko, A. V. A study of attainability of the continuous part of the hybrid system |
| topic_facet |
attainability discrete-continuous network reduction system with controlled structure hybrid system достижимость дискретно-непрерывная сеть редукция система с управляемой структурой гибридная система досяжність дискретно-безперервна мережа редукція система з керованою структурою гібридна система |
| format |
Article |
| author |
Denysenko, T. A. Nesteryuk, A. G. Denysenko, A. V. |
| author_facet |
Denysenko, T. A. Nesteryuk, A. G. Denysenko, A. V. |
| author_sort |
Denysenko, T. A. |
| title |
A study of attainability of the continuous part of the hybrid system |
| title_short |
A study of attainability of the continuous part of the hybrid system |
| title_full |
A study of attainability of the continuous part of the hybrid system |
| title_fullStr |
A study of attainability of the continuous part of the hybrid system |
| title_full_unstemmed |
A study of attainability of the continuous part of the hybrid system |
| title_sort |
study of attainability of the continuous part of the hybrid system |
| title_alt |
Исследование достижимости непрерывной части гибридной системы Дослідження досяжності безперервної частини гібридної системи |
| description |
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. |
| publisher |
Інститут проблем реєстрації інформації НАН України |
| publishDate |
2018 |
| url |
http://drsp.ipri.kiev.ua/article/view/142908 |
| work_keys_str_mv |
AT denysenkota astudyofattainabilityofthecontinuouspartofthehybridsystem AT nesteryukag astudyofattainabilityofthecontinuouspartofthehybridsystem AT denysenkoav astudyofattainabilityofthecontinuouspartofthehybridsystem AT denysenkota issledovaniedostižimostinepreryvnojčastigibridnojsistemy AT nesteryukag issledovaniedostižimostinepreryvnojčastigibridnojsistemy AT denysenkoav issledovaniedostižimostinepreryvnojčastigibridnojsistemy AT denysenkota doslídžennâdosâžnostíbezperervnoíčastinigíbridnoísistemi AT nesteryukag doslídžennâdosâžnostíbezperervnoíčastinigíbridnoísistemi AT denysenkoav doslídžennâdosâžnostíbezperervnoíčastinigíbridnoísistemi AT denysenkota studyofattainabilityofthecontinuouspartofthehybridsystem AT nesteryukag studyofattainabilityofthecontinuouspartofthehybridsystem AT denysenkoav studyofattainabilityofthecontinuouspartofthehybridsystem |
| first_indexed |
2025-07-17T10:57:02Z |
| last_indexed |
2025-07-17T10:57:02Z |
| _version_ |
1850411236121903104 |