Supervisory control of networked discrete event systems with timing structure
Autor(a) principal: | |
---|---|
Data de Publicação: | 2017 |
Tipo de documento: | Tese |
Idioma: | por |
Título da fonte: | Repositório Institucional da UFRJ |
Texto Completo: | http://hdl.handle.net/11422/6004 |
Resumo: | In this work, we study the supervisory control problem of Networked Discrete Event Systems with Timing Structure (NDESWTS), that is subject to bounded communication delays and intermittent loss of observations. We assume that the communication between the plant and the supervisor is carried out through a network that can have several channels, so that, communication delays may change the order of the observations. We will propose an untimed equivalent model for NDESWTS that represents all possible implications of delays and loss of observations. For this matter, we assume a priori knowledge of the minimal transition activation time and the maximal communication delays, and also take into account possible packet losses. Based on this model, we formulate a networked supervisory control problem and present a necessary and sufficient condition for the existence of a networked supervisor. We also present a systematic way to design networked supervisors, where we use the property of relative observability in order to increase the achieved language permissiveness. In addition, another research topic addressed in this work is the concept of relative observability. In this concern, we propose new algorithms for the verification of relative observability and computation of relatively observable sublanguages, shown to be more efficient than the previous ones proposed in the literature. |
id |
UFRJ_664cf9d7fc51dff1cea5eab7fef699a0 |
---|---|
oai_identifier_str |
oai:pantheon.ufrj.br:11422/6004 |
network_acronym_str |
UFRJ |
network_name_str |
Repositório Institucional da UFRJ |
repository_id_str |
|
spelling |
Supervisory control of networked discrete event systems with timing structureEngenharia elétricaSistemas de eventos discretosRede de comunicaçãoCNPQ::ENGENHARIAS::ENGENHARIA ELETRICAIn this work, we study the supervisory control problem of Networked Discrete Event Systems with Timing Structure (NDESWTS), that is subject to bounded communication delays and intermittent loss of observations. We assume that the communication between the plant and the supervisor is carried out through a network that can have several channels, so that, communication delays may change the order of the observations. We will propose an untimed equivalent model for NDESWTS that represents all possible implications of delays and loss of observations. For this matter, we assume a priori knowledge of the minimal transition activation time and the maximal communication delays, and also take into account possible packet losses. Based on this model, we formulate a networked supervisory control problem and present a necessary and sufficient condition for the existence of a networked supervisor. We also present a systematic way to design networked supervisors, where we use the property of relative observability in order to increase the achieved language permissiveness. In addition, another research topic addressed in this work is the concept of relative observability. In this concern, we propose new algorithms for the verification of relative observability and computation of relatively observable sublanguages, shown to be more efficient than the previous ones proposed in the literature.Neste trabalho, considera-se o problema de controle supervisório de Sistemas a Eventos Discretos em rede com Estrutura Temporizada (SEDRET) sujeitos a atrasos limitados e perdas intermitentes de observação. Supõe-se que a comunicação entre a planta e o supervisor seja feita utilizando-se uma rede formada por vários canais de comunicação de modo que atrasos de comunicação podem causar mudanças na ordem das observações. Será proposto um modelo não temporizado equivalente para SEDRET que caracteriza todas as consequências de atrasos e perdas de observação. Com esse objetivo, supõe-se o conhecimento prévio dos tempos mínimos de ativação das transições da planta e dos atrasos máximos na comunicação e consideram-se, também, possíveis perdas de pacote. Um problema de controle supervisório em rede é formulado com base no modelo proposto e, em seguida, é apresentada uma condição necessária e suficiente para a existência de um supervisor em rede. Um método para projetar esses supervisores utilizando a propriedade da observabilidade relativa para aumentar a permissividade da linguagem obtida será apresentado. Adicionalmente, outro tópico de pesquisa abordado nesse trabalho é o conceito de observabilidade relativa. Neste contexto, algoritmos para a verificação da observabilidade relativa e para o cálculo de sublinguagens relativamente observáveis são propostos. Esses algoritmos são mais eficientes do que aqueles existentes na literatura.Universidade Federal do Rio de JaneiroBrasilInstituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de EngenhariaPrograma de Pós-Graduação em Engenharia ElétricaUFRJBasilio, João Carlos dos Santoshttp://lattes.cnpq.br/4055777934879597Carvalho, Lilian KawakamiCury, José Eduardo RibeiroCunha, Antonio Eduardo Carrilho daMaia, Carlos AndreyAlves, Marcos Vinícius Silva2018-12-17T17:33:58Z2023-12-21T03:01:01Z2017-11info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesishttp://hdl.handle.net/11422/6004porinfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFRJinstname:Universidade Federal do Rio de Janeiro (UFRJ)instacron:UFRJ2023-12-21T03:01:01Zoai:pantheon.ufrj.br:11422/6004Repositório InstitucionalPUBhttp://www.pantheon.ufrj.br/oai/requestpantheon@sibi.ufrj.bropendoar:2023-12-21T03:01:01Repositório Institucional da UFRJ - Universidade Federal do Rio de Janeiro (UFRJ)false |
dc.title.none.fl_str_mv |
Supervisory control of networked discrete event systems with timing structure |
title |
Supervisory control of networked discrete event systems with timing structure |
spellingShingle |
Supervisory control of networked discrete event systems with timing structure Alves, Marcos Vinícius Silva Engenharia elétrica Sistemas de eventos discretos Rede de comunicação CNPQ::ENGENHARIAS::ENGENHARIA ELETRICA |
title_short |
Supervisory control of networked discrete event systems with timing structure |
title_full |
Supervisory control of networked discrete event systems with timing structure |
title_fullStr |
Supervisory control of networked discrete event systems with timing structure |
title_full_unstemmed |
Supervisory control of networked discrete event systems with timing structure |
title_sort |
Supervisory control of networked discrete event systems with timing structure |
author |
Alves, Marcos Vinícius Silva |
author_facet |
Alves, Marcos Vinícius Silva |
author_role |
author |
dc.contributor.none.fl_str_mv |
Basilio, João Carlos dos Santos http://lattes.cnpq.br/4055777934879597 Carvalho, Lilian Kawakami Cury, José Eduardo Ribeiro Cunha, Antonio Eduardo Carrilho da Maia, Carlos Andrey |
dc.contributor.author.fl_str_mv |
Alves, Marcos Vinícius Silva |
dc.subject.por.fl_str_mv |
Engenharia elétrica Sistemas de eventos discretos Rede de comunicação CNPQ::ENGENHARIAS::ENGENHARIA ELETRICA |
topic |
Engenharia elétrica Sistemas de eventos discretos Rede de comunicação CNPQ::ENGENHARIAS::ENGENHARIA ELETRICA |
description |
In this work, we study the supervisory control problem of Networked Discrete Event Systems with Timing Structure (NDESWTS), that is subject to bounded communication delays and intermittent loss of observations. We assume that the communication between the plant and the supervisor is carried out through a network that can have several channels, so that, communication delays may change the order of the observations. We will propose an untimed equivalent model for NDESWTS that represents all possible implications of delays and loss of observations. For this matter, we assume a priori knowledge of the minimal transition activation time and the maximal communication delays, and also take into account possible packet losses. Based on this model, we formulate a networked supervisory control problem and present a necessary and sufficient condition for the existence of a networked supervisor. We also present a systematic way to design networked supervisors, where we use the property of relative observability in order to increase the achieved language permissiveness. In addition, another research topic addressed in this work is the concept of relative observability. In this concern, we propose new algorithms for the verification of relative observability and computation of relatively observable sublanguages, shown to be more efficient than the previous ones proposed in the literature. |
publishDate |
2017 |
dc.date.none.fl_str_mv |
2017-11 2018-12-17T17:33:58Z 2023-12-21T03:01:01Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/doctoralThesis |
format |
doctoralThesis |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/11422/6004 |
url |
http://hdl.handle.net/11422/6004 |
dc.language.iso.fl_str_mv |
por |
language |
por |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.publisher.none.fl_str_mv |
Universidade Federal do Rio de Janeiro Brasil Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de Engenharia Programa de Pós-Graduação em Engenharia Elétrica UFRJ |
publisher.none.fl_str_mv |
Universidade Federal do Rio de Janeiro Brasil Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de Engenharia Programa de Pós-Graduação em Engenharia Elétrica UFRJ |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFRJ instname:Universidade Federal do Rio de Janeiro (UFRJ) instacron:UFRJ |
instname_str |
Universidade Federal do Rio de Janeiro (UFRJ) |
instacron_str |
UFRJ |
institution |
UFRJ |
reponame_str |
Repositório Institucional da UFRJ |
collection |
Repositório Institucional da UFRJ |
repository.name.fl_str_mv |
Repositório Institucional da UFRJ - Universidade Federal do Rio de Janeiro (UFRJ) |
repository.mail.fl_str_mv |
pantheon@sibi.ufrj.br |
_version_ |
1815455980104712192 |