2020
DOI: 10.1080/00207721.2020.1820098
|View full text |Cite
|
Sign up to set email alerts
|

Zonotopic fault detection observer for discrete-time descriptor systems considering fault sensitivity

Abstract: This paper addresses a zonotopic fault detection (FD) observer for discrete-time descriptor systems subject to additive actuator faults. The considered descriptor systems are also perturbed by unknown-but-bounded uncertainties including state disturbances and measurement noise. Under a set-based framework, the effects of uncertainties and faults are separated into two state zonotopes. Based on this decomposition, the FD observer gain is designed to be robust against uncertainties and meanwhile sensitive to fau… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 29 publications
0
3
0
Order By: Relevance
“…This chapter presents set-based FDI strategies for discrete-time descriptor systems. The contributions of this chapter have been submitted in [149] and [151]. In this chapter, we apply the set-based framework proposed in Chapter 2 into FDI for discrete-time descriptor systems.…”
Section: Discussionmentioning
confidence: 99%
“…This chapter presents set-based FDI strategies for discrete-time descriptor systems. The contributions of this chapter have been submitted in [149] and [151]. In this chapter, we apply the set-based framework proposed in Chapter 2 into FDI for discrete-time descriptor systems.…”
Section: Discussionmentioning
confidence: 99%
“…needs to be found. An optimization of this solution is possible by a minimization of trace P I k+1 , (replacing the optimization task involving the logarithm of the shape matrix determinant according to [45] Appendix C), where for a polytopic representation of the domain [N k+1 ] according to (21) the entry-wise defined vertices of the matrix inverse…”
Section: Remarkmentioning
confidence: 99%
“…Computations of ellipsoidal enclosures inherently have the property of a constant complexity if they are applied recursively. In addition, their enclosure quality enhances automatically for reducing domain sizes which is in contrast to the propagation of polytopic and zonotopic domains [21,22]. There, the number of vertices of the solution setsespecially after intersecting the results of measurement-based innovation steps with the outcome of state prediction stages-tends to increase in each time step.…”
Section: Introductionmentioning
confidence: 99%