2018
DOI: 10.1016/j.ins.2017.12.010
|View full text |Cite
|
Sign up to set email alerts
|

Distributed networked set-membership filtering with ellipsoidal state estimations

Abstract: This paper addresses the problem of distributed networked set-membership filtering with ellipsoidal state estimations for a class of discrete time-varying systems in the presence of unknown-but-bounded process and measurement noises. Both global and local ellipsoidal state estimations are provided to locate the true state (target) via a distributed filtering network. A new geometric method based on Minkowski sum is proposed to produce the global ellipsoidal estimation. A novel convex optimization approach is d… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8
1

Relationship

3
6

Authors

Journals

citations
Cited by 60 publications
(15 citation statements)
references
References 45 publications
0
15
0
Order By: Relevance
“…2) the set-membership state estimation problem for linear timevarying systems subject to IMOs [39], [42]; 3) state estimation for time-delayed systems with gain variations subject to IMOs [12]; 4) state estimation for neural networks subject to IMOs [27]- [29]; and 5) the improvement of the state estimation performance by using some latest optimization algorithms [25], [26].…”
Section: An Illustrative Examplementioning
confidence: 99%
“…2) the set-membership state estimation problem for linear timevarying systems subject to IMOs [39], [42]; 3) state estimation for time-delayed systems with gain variations subject to IMOs [12]; 4) state estimation for neural networks subject to IMOs [27]- [29]; and 5) the improvement of the state estimation performance by using some latest optimization algorithms [25], [26].…”
Section: An Illustrative Examplementioning
confidence: 99%
“…Since all the system constraints are transformed into LMIs, the optimisation problems can be solved by the semi‐definite programming via an interior‐point algorithm [34]. The interior‐point algorithm has a polynomial‐time complexity Ofalse(scriptM3false), where is the total row size of the main LMIs and M is the total number of scalar decision variables of the main LMIs [25, 26]. In our case, for the state estimation LMI constraint (8), we have 1=2nx+r+p+1 and scriptM1=false(nx2/2false)+false(12+nyfalse)nx+3.…”
Section: Model Predictive Control With Set‐membership State Estimationmentioning
confidence: 99%
“…Compared with the traditional point estimation method, the SMF does not have high requirements for the description of the disturbances and for sensor precision. Due to these advantages, the SMF has a wide range of applications in state estimation and trajectory tracking (see, e.g., Ge et al, 2019;Xia et al, 2018;Zhang et al, 2019Zhang et al, , 2020cMeslem and Hably, 2020;Zhou et al, 2013). However, to the best of the authors' knowledge, SMF is rarely used to solve the problem of AGV trajectory estimation and tracking.…”
Section: Introductionmentioning
confidence: 99%