Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/33114
Title: Moving-Horizon Estimation for Multi-Sensor Systems Under Probabilistic Caching Mechanism: A Co-Design Scheme
Authors: Song, W
Wang, Z
Li, Z
Dong, H
Keywords: moving-horizon estimation;multi-sensor systems;probabilistic caching mechanism;sensor resolution;exponential ultimate boundedness
Issue Date: 11-Mar-2026
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Citation: Song, W. et al. (2026) 'Moving-Horizon Estimation for Multi-Sensor Systems Under Probabilistic Caching Mechanism: A Co-Design Scheme', IEEE Transactions on Automatic Control, 0 (early access), pp. 1–8. doi: 10.1109/tac.2026.3673082.
Abstract: In practice, the cache, capable of storing frequently accessed data, is widely deployed in edge servers to guarantee quick retrieval and improve overall system performance. In this paper, the moving-horizon state estimation problem is investigated for a class of multi-sensor systems under the effects of limited caching capacity and sensor resolution. The measurement information collected by multiple sensors is first transmitted to an edge server for state estimation purposes and then stored in the cache for future use. To accommodate the limited caching capacity, the probabilistic caching mechanism (PCM) is harnessed to manage the cached content, under which only a portion of the measurement information is probabilistically selected and retained in the cache. By solving the least-squares optimization problem, a novel moving-horizon state estimator is proposed under the PCM. Sufficient conditions are derived to guarantee that the estimation error is exponentially ultimately bounded in the mean-square sense. To improve the estimation accuracy, the parameters of both the estimator and the PCM are jointly designed by addressing a constrained optimization problem with the assistance of the particle swarm optimization method. Finally, two examples are given to showcase the effectiveness of the proposed algorithm.
URI: https://bura.brunel.ac.uk/handle/2438/33114
DOI: https://doi.org/10.1109/tac.2026.3673082
ISSN: 0018-9286
Other Identifiers: ORCiD: Zidong Wang https://orcid.org/0000-0002-9576-7401
Appears in Collections:Department of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfFor the purpose of open access, the author has applied a Creative Commons Attribution (CC BY) licence to any Author Accepted Manuscript version arising.465.82 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons