Please use this identifier to cite or link to this item:
|Title:||Distributed consensus-based multitarget filtering and its application in formation-containment control||Authors:||Zhang, Y.
|Keywords:||Engineering::Electrical and electronic engineering||Issue Date:||2020||Source:||Zhang, Y., Sun, L. & Hu, G. (2020). Distributed consensus-based multitarget filtering and its application in formation-containment control. IEEE Transactions On Control of Network Systems, 7(1), 503-515. https://dx.doi.org/10.1109/TCNS.2019.2926281||Project:||RG180/17(2017-T1-002- 158)||Journal:||IEEE Transactions on Control of Network Systems||Abstract:||This paper studies a distributed multitarget filtering problem for a sensor network where each sensor can obtain the measurements and system information of some targets while having no knowledge of others. To estimate the states of all targets, a consensus Kalman information filtering algorithm with an adaptive and finite-time matrix-weighted consensus strategy is proposed. When the communication network is strongly connected and the sensing network is time-varying while being always collectively observable, it is proved that if the targets' system matrices are time invariant, the mean-square estimation errors of the sensors are bounded for any number of consensus iterations. If the targets' system matrices are time varying and the number of the consensus steps per information filtering is larger than the diameter of the communication topology, the mean-square estimation errors of the sensors are also bounded. When each sensor is intermittently activated to observe the targets and the network does not remain collectively observable, an allowable lower bound of detection probability is derived to guarantee the stochastic boundedness of the estimation errors. Then, the filtering algorithm is applied to design a distributed containment controller for multiple agents to encircle multiple planar heterogeneous dynamic targets. Finally, simulation examples are given to illustrate the effectiveness of the algorithms.||URI:||https://hdl.handle.net/10356/154201||ISSN:||2325-5870||DOI:||10.1109/TCNS.2019.2926281||Rights:||© 2019 IEEE. All rights reserved.||Fulltext Permission:||none||Fulltext Availability:||No Fulltext|
|Appears in Collections:||EEE Journal Articles|
Updated on Dec 23, 2021
Updated on Dec 25, 2021
Updated on Jul 2, 2022
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.