Distributed Fault Detection Using Relative Information in Linear Multi-Agent Networks

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/3441
Resumo: This paper addresses the problem of fault detection in the context of a collection of agents performing a shared task and exchanging relative information over a communication network. We resort to techniques in the literature to construct a meaningful observable system and overcome the issue that the system of systems is not observable. A solution involving Set-Valued Observers (SVOs) is proposed to estimate the state in a distributed fashion and a proof of convergence of the estimates is given under mild assumptions. The performance of the proposed algorithm is assessed through simulations.
id RCAP_3a310479f0d021fcad55c322f71f57ee
oai_identifier_str oai:repositorio.ual.pt:11144/3441
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 Distributed Fault Detection Using Relative Information in Linear Multi-Agent NetworksThis paper addresses the problem of fault detection in the context of a collection of agents performing a shared task and exchanging relative information over a communication network. We resort to techniques in the literature to construct a meaningful observable system and overcome the issue that the system of systems is not observable. A solution involving Set-Valued Observers (SVOs) is proposed to estimate the state in a distributed fashion and a proof of convergence of the estimates is given under mild assumptions. The performance of the proposed algorithm is assessed through simulations.2018-02-07T21:27:03Z2015-09-01T00:00:00Z2015-09info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObjectapplication/pdfhttp://hdl.handle.net/11144/3441engSilvestre, 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-08-01T02:11:00Zoai:repositorio.ual.pt:11144/3441Portal AgregadorONGhttps://www.rcaap.pt/oai/openairemluisa.alvim@gmail.comopendoar:71602024-08-01T02:11Repositó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 Distributed Fault Detection Using Relative Information in Linear Multi-Agent Networks
title Distributed Fault Detection Using Relative Information in Linear Multi-Agent Networks
spellingShingle Distributed Fault Detection Using Relative Information in Linear Multi-Agent Networks
Silvestre, Daniel
title_short Distributed Fault Detection Using Relative Information in Linear Multi-Agent Networks
title_full Distributed Fault Detection Using Relative Information in Linear Multi-Agent Networks
title_fullStr Distributed Fault Detection Using Relative Information in Linear Multi-Agent Networks
title_full_unstemmed Distributed Fault Detection Using Relative Information in Linear Multi-Agent Networks
title_sort Distributed Fault Detection Using Relative Information in Linear Multi-Agent Networks
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 fault detection in the context of a collection of agents performing a shared task and exchanging relative information over a communication network. We resort to techniques in the literature to construct a meaningful observable system and overcome the issue that the system of systems is not observable. A solution involving Set-Valued Observers (SVOs) is proposed to estimate the state in a distributed fashion and a proof of convergence of the estimates is given under mild assumptions. The performance of the proposed algorithm is assessed through simulations.
publishDate 2015
dc.date.none.fl_str_mv 2015-09-01T00:00:00Z
2015-09
2018-02-07T21:27:03Z
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/3441
url http://hdl.handle.net/11144/3441
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 mluisa.alvim@gmail.com
_version_ 1817546670008696832

Registros relacionados