Self-Triggered Set-Valued Observers

Detalhes bibliográficos
Autor(a) principal: Silvestre, Daniel
Data de Publicação: 2015
Tipo de documento: Artigo de conferência
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/11144/3435
Resumo: This paper addresses the problem of high computational requirements in the implementation of Set-Valued Observers (SVOs), which places stringent constraints in terms of their use in applications where low computational power is available or the plant is sensitive to delay. It is firstly shown how to determine an overbound for the set-valued estimates, which reduces the overhead by limiting the number of inequalities defining those set-valued state estimates. In the particular setting of distributed gossip problems, the proposed algorithm is shown to have constant complexity. This algorithm is of prime importance to reduce the computational load and enable the use of such estimates for real-time applications. Results are also provided regarding the frequency of the triggers in the worst-case scenario. The performance of the proposed method is evaluated through simulation.
id RCAP_c867c7302fd35dd36aba4c80c065b081
oai_identifier_str oai:repositorio.ual.pt:11144/3435
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Self-Triggered Set-Valued ObserversThis paper addresses the problem of high computational requirements in the implementation of Set-Valued Observers (SVOs), which places stringent constraints in terms of their use in applications where low computational power is available or the plant is sensitive to delay. It is firstly shown how to determine an overbound for the set-valued estimates, which reduces the overhead by limiting the number of inequalities defining those set-valued state estimates. In the particular setting of distributed gossip problems, the proposed algorithm is shown to have constant complexity. This algorithm is of prime importance to reduce the computational load and enable the use of such estimates for real-time applications. Results are also provided regarding the frequency of the triggers in the worst-case scenario. The performance of the proposed method is evaluated through simulation.2018-02-07T21:10:41Z2015-09-01T00:00:00Z2015-09info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObjectapplication/pdfhttp://hdl.handle.net/11144/3435engSilvestre, Danielinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-01-11T02:21:46Zoai:repositorio.ual.pt:11144/3435Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T01:34:20.883026Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Self-Triggered Set-Valued Observers
title Self-Triggered Set-Valued Observers
spellingShingle Self-Triggered Set-Valued Observers
Silvestre, Daniel
title_short Self-Triggered Set-Valued Observers
title_full Self-Triggered Set-Valued Observers
title_fullStr Self-Triggered Set-Valued Observers
title_full_unstemmed Self-Triggered Set-Valued Observers
title_sort Self-Triggered Set-Valued Observers
author Silvestre, Daniel
author_facet Silvestre, Daniel
author_role author
dc.contributor.author.fl_str_mv Silvestre, Daniel
description This paper addresses the problem of high computational requirements in the implementation of Set-Valued Observers (SVOs), which places stringent constraints in terms of their use in applications where low computational power is available or the plant is sensitive to delay. It is firstly shown how to determine an overbound for the set-valued estimates, which reduces the overhead by limiting the number of inequalities defining those set-valued state estimates. In the particular setting of distributed gossip problems, the proposed algorithm is shown to have constant complexity. This algorithm is of prime importance to reduce the computational load and enable the use of such estimates for real-time applications. Results are also provided regarding the frequency of the triggers in the worst-case scenario. The performance of the proposed method is evaluated through simulation.
publishDate 2015
dc.date.none.fl_str_mv 2015-09-01T00:00:00Z
2015-09
2018-02-07T21:10:41Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/conferenceObject
format conferenceObject
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/11144/3435
url http://hdl.handle.net/11144/3435
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799136820844298240