Yulia A. Litvinenko

dblp:326/1089 · also Yuliya A. Litvinenko · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0001-5438-2911ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021
YearPublicationVenuePosition
2025 Comparison of recursive and nonrecursive processing schemes in the federated filtering
abstract
A linear estimation problem of decentralized processing of measurements is considered, which involves the estimate of the state vector of a dynamic system by fusion of the estimates generated in local filters using the data from distributed (separate) sensors. The conditions are discussed that ensure the coincidence of the estimates and calculated covariance matrices of estimation errors generated in this way with the results obtained in the optimal centralized Kalman filter. The features of these conditions for recursive and nonrecursive schemes are analyzed. The comparison of two schemes is illustrated using an example of random walk estimation.
Oleg A. Stepanov, Yulia A. Litvinenko
CoDIT2
2024 Comparison of recursive and nonrecursive linearization-based algorithms for one class of nonlinear estimation problems*
abstract
Two schemes of suboptimal estimation algorithms synthesized using the Bayesian approach and based on the linearization of functions describing the behavior of the estimated state vector and measurement model are compared for one class of nonlinear estimation problems. One of them is traditional, in which the estimate is found recursively with respect to measurements, and the other one, nonrecursive, involves the simultaneous use of the full set of all available measurements. The advantages and disadvantages of the analyzed algorithms are discussed and illustrated by an example.
Oleg A. Stepanov, Yulia A. Litvinenko, Alexey Isaev
CoDIT2