![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
Some decentralized smoothing algorithms are derived by applying a Rauch-Tung-Striebel fixed-interval smoother formula in continuous-time systems supposing that an estimation structure is comprised of a global processor and of two local processors. Two cases are investigated for the problems of decentralized smoothing: when the local-filtered estimated are available and when the local-smoothed estimates are known. Some features of present algorithms are discussed from the point of view of data transmissions and communication bandwidth, etc.