2017 American Control Conference (ACC) 2017
DOI: 10.23919/acc.2017.7963766
|View full text |Cite
|
Sign up to set email alerts
|

Distributed and decentralized Kalman filtering for Cascaded Fractional order systems

Abstract: This paper presents a distributed Kalman filter algorithm for cascaded systems of fractional order. Certain conditions are introduced under which a division of a fractional system into cascaded subsystems is possible. A functional distribution of a large scale system and of the state estimation algorithm leads to smaller and scalable nodes with reduced memory and computational effort. Since each subsystem performs its calculations locally, a central processing node is not needed. All data which are required by… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
3
1
1

Relationship

2
3

Authors

Journals

citations
Cited by 7 publications
(11 citation statements)
references
References 15 publications
0
11
0
Order By: Relevance
“…Because the binomial coefficient in (2) converges to zero for j → ∞, one can neglect very old values of x. Therefore, we consider a maximum number l of past values of x which is called short memory principle (SMP) [25,27]. The fractional, time-variant, and discrete-time state-space representation can be obtained from (2) following [23,28] whereby index k denotes the current time step t k in…”
Section: Fractional Calculusmentioning
confidence: 99%
See 4 more Smart Citations
“…Because the binomial coefficient in (2) converges to zero for j → ∞, one can neglect very old values of x. Therefore, we consider a maximum number l of past values of x which is called short memory principle (SMP) [25,27]. The fractional, time-variant, and discrete-time state-space representation can be obtained from (2) following [23,28] whereby index k denotes the current time step t k in…”
Section: Fractional Calculusmentioning
confidence: 99%
“…. , α N,k ∈ R + denote the orders of the fractional derivative at time k [25,27]. The upper limit of the sum is denoted by the buffer length z = min(k + 1, l) due to the SMP.…”
Section: Fractional Calculusmentioning
confidence: 99%
See 3 more Smart Citations