2016
DOI: 10.1080/00207179.2016.1257152
|View full text |Cite
|
Sign up to set email alerts
|

Detectability, observability and Lyapunov-type theorems of linear discrete time-varying stochastic systems with multiplicative noise

Abstract: The objective of this paper is to study detectability, observability and related Lyapunov-type theorems of linear discrete-time time-varying stochastic systems with multiplicative noise. Some new concepts such as uniform detectability, K ∞ -exact detectability (resp. K W F T -exact detectability, K F T -exact detectability, K N -exact detectability) and K ∞ -exact observability (resp. K W F T -exact observability, K F T -exact observability, K N -exact observability) are introduced, respectively, and nice prop… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 25 publications
(29 citation statements)
references
References 46 publications
0
29
0
Order By: Relevance
“…The Markovian process studied in this paper is a homogeneous irreducible stationary process, then how do we design the adaptive tracking controller for random nonlinear systems with more general Markovian switchings? Finally, it is also valuable to consider similar problems in discrete-time stochastic systems as done in the works of Lin and Zhang 45 and Zhang et al 46,47…”
Section: Discussionmentioning
confidence: 99%
“…The Markovian process studied in this paper is a homogeneous irreducible stationary process, then how do we design the adaptive tracking controller for random nonlinear systems with more general Markovian switchings? Finally, it is also valuable to consider similar problems in discrete-time stochastic systems as done in the works of Lin and Zhang 45 and Zhang et al 46,47…”
Section: Discussionmentioning
confidence: 99%
“…Below, we give a correct version for the iterative formula φ l,k , and the proof can be found in [2].…”
Section: Analysis and Correctionsmentioning
confidence: 98%
“…Assume (2) holds for l = m > k + 1, then we only need to show that (2) still holds for l = m + 1. According to the formula (1), we get …”
Section: Analysis and Correctionsmentioning
confidence: 98%
“…In this section, we mainly use the state transition matrix approach developed in [31,33] to study the finite-time stability and stabilization of the system (2).…”
Section: State Transition Matrix-based Approach For Finite-time Stabimentioning
confidence: 99%