Distributed estimation in periodically switching sensor networks (Q1721333)

From MaRDI portal
Revision as of 17:53, 11 November 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128884565, #quickstatements; #temporary_batch_1731343961144)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Distributed estimation in periodically switching sensor networks
scientific article

    Statements

    Distributed estimation in periodically switching sensor networks (English)
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    Summary: This paper studies the distributed estimation problem of sensor networks, in which each node is periodically sensing and broadcasting in order. A consensus estimation algorithm is applied, and a weight design approach is proposed. The weights are designed based on an adjusting parameter and the nodes' lengths of their shortest paths to the target node. By introducing a \((T + 2)\)-partite graph of the time-varying networks over a time period \([0, T]\) and studying the relationships between the product of the time-sequence estimation error system matrices and the sequences of edges in the \((T + 2)\)-partite graph, a sufficient condition in terms of the observer gain and the adjusting parameter for the stability of the estimation error system is proposed. A simulation example is given to illustrate the results.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references