Filtering for discrete-time Markov jump systems with network transmitted mode

Detalhes bibliográficos
Autor(a) principal: Gonçalves, Alim P. C. [UNESP]
Data de Publicação: 2010
Outros Autores: Fioravanti, André R., Geromel, José C.
Tipo de documento: Artigo de conferência
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://dx.doi.org/10.1109/CDC.2010.5717802
http://hdl.handle.net/11449/72032
Resumo: This paper is concerned with ℋ 2 and ℋ ∞ filter design for discrete-time Markov jump systems. The usual assumption of mode-dependent design, where the current Markov mode is available to the filter at every instant of time is substituted by the case where that availability is subject to another Markov chain. In other words, the mode is transmitted to the filter through a network with given transmission failure probabilities. The problem is solved by modeling a system with N modes as another with 2N modes and cluster availability. We also treat the case where the transition probabilities are not exactly known and demonstrate our conditions for calculating an ℋ ∞ norm bound are less conservative than the available results in the current literature. Numerical examples show the applicability of the proposed results. ©2010 IEEE.
id UNSP_fd8f9d67eb2ab59336e1860e02378384
oai_identifier_str oai:repositorio.unesp.br:11449/72032
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Filtering for discrete-time Markov jump systems with network transmitted modeDiscrete-timeFilter designsMarkov ChainMarkov jump systemNumerical exampleTransition probabilitiesTransmission failuresMarkov processesThis paper is concerned with ℋ 2 and ℋ ∞ filter design for discrete-time Markov jump systems. The usual assumption of mode-dependent design, where the current Markov mode is available to the filter at every instant of time is substituted by the case where that availability is subject to another Markov chain. In other words, the mode is transmitted to the filter through a network with given transmission failure probabilities. The problem is solved by modeling a system with N modes as another with 2N modes and cluster availability. We also treat the case where the transition probabilities are not exactly known and demonstrate our conditions for calculating an ℋ ∞ norm bound are less conservative than the available results in the current literature. Numerical examples show the applicability of the proposed results. ©2010 IEEE.Univ. Estadual Paulista-UNESP, Avenida Três de Março, 511, 18087-180, Sorocaba, SPFrench National Institute for Research in Computer Science and Control Parc Orsay Université, 4 rue J. Monod, 91893 Orsay CedexDSCE/School of Electrical and Computer Engineering UNICAMP, Avenida Albert Einstein, 400, 13081-970, Campinas, SPUniv. Estadual Paulista-UNESP, Avenida Três de Março, 511, 18087-180, Sorocaba, SPUniversidade Estadual Paulista (Unesp)Parc Orsay UniversitéUniversidade Estadual de Campinas (UNICAMP)Gonçalves, Alim P. C. [UNESP]Fioravanti, André R.Geromel, José C.2014-05-27T11:25:19Z2014-05-27T11:25:19Z2010-12-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject924-929http://dx.doi.org/10.1109/CDC.2010.5717802Proceedings of the IEEE Conference on Decision and Control, p. 924-929.0191-2216http://hdl.handle.net/11449/7203210.1109/CDC.2010.5717802WOS:0002950491010292-s2.0-79953136199Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengProceedings of the IEEE Conference on Decision and Control0,591info:eu-repo/semantics/openAccess2021-10-23T21:41:43Zoai:repositorio.unesp.br:11449/72032Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-05-23T19:56:51.213594Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Filtering for discrete-time Markov jump systems with network transmitted mode
title Filtering for discrete-time Markov jump systems with network transmitted mode
spellingShingle Filtering for discrete-time Markov jump systems with network transmitted mode
Gonçalves, Alim P. C. [UNESP]
Discrete-time
Filter designs
Markov Chain
Markov jump system
Numerical example
Transition probabilities
Transmission failures
Markov processes
title_short Filtering for discrete-time Markov jump systems with network transmitted mode
title_full Filtering for discrete-time Markov jump systems with network transmitted mode
title_fullStr Filtering for discrete-time Markov jump systems with network transmitted mode
title_full_unstemmed Filtering for discrete-time Markov jump systems with network transmitted mode
title_sort Filtering for discrete-time Markov jump systems with network transmitted mode
author Gonçalves, Alim P. C. [UNESP]
author_facet Gonçalves, Alim P. C. [UNESP]
Fioravanti, André R.
Geromel, José C.
author_role author
author2 Fioravanti, André R.
Geromel, José C.
author2_role author
author
dc.contributor.none.fl_str_mv Universidade Estadual Paulista (Unesp)
Parc Orsay Université
Universidade Estadual de Campinas (UNICAMP)
dc.contributor.author.fl_str_mv Gonçalves, Alim P. C. [UNESP]
Fioravanti, André R.
Geromel, José C.
dc.subject.por.fl_str_mv Discrete-time
Filter designs
Markov Chain
Markov jump system
Numerical example
Transition probabilities
Transmission failures
Markov processes
topic Discrete-time
Filter designs
Markov Chain
Markov jump system
Numerical example
Transition probabilities
Transmission failures
Markov processes
description This paper is concerned with ℋ 2 and ℋ ∞ filter design for discrete-time Markov jump systems. The usual assumption of mode-dependent design, where the current Markov mode is available to the filter at every instant of time is substituted by the case where that availability is subject to another Markov chain. In other words, the mode is transmitted to the filter through a network with given transmission failure probabilities. The problem is solved by modeling a system with N modes as another with 2N modes and cluster availability. We also treat the case where the transition probabilities are not exactly known and demonstrate our conditions for calculating an ℋ ∞ norm bound are less conservative than the available results in the current literature. Numerical examples show the applicability of the proposed results. ©2010 IEEE.
publishDate 2010
dc.date.none.fl_str_mv 2010-12-01
2014-05-27T11:25:19Z
2014-05-27T11:25:19Z
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://dx.doi.org/10.1109/CDC.2010.5717802
Proceedings of the IEEE Conference on Decision and Control, p. 924-929.
0191-2216
http://hdl.handle.net/11449/72032
10.1109/CDC.2010.5717802
WOS:000295049101029
2-s2.0-79953136199
url http://dx.doi.org/10.1109/CDC.2010.5717802
http://hdl.handle.net/11449/72032
identifier_str_mv Proceedings of the IEEE Conference on Decision and Control, p. 924-929.
0191-2216
10.1109/CDC.2010.5717802
WOS:000295049101029
2-s2.0-79953136199
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Proceedings of the IEEE Conference on Decision and Control
0,591
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 924-929
dc.source.none.fl_str_mv Scopus
reponame:Repositório Institucional da UNESP
instname:Universidade Estadual Paulista (UNESP)
instacron:UNESP
instname_str Universidade Estadual Paulista (UNESP)
instacron_str UNESP
institution UNESP
reponame_str Repositório Institucional da UNESP
collection Repositório Institucional da UNESP
repository.name.fl_str_mv Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)
repository.mail.fl_str_mv
_version_ 1803045639027687424