Distributed consensus filter on directed switching graphs

We consider distributed estimation on a directed graph with switching topologies. Motivated by a recent PI consensus filter, we modify the protocol and remove the requirement of bidirectional exchange of neighboring gains for fixed topologies. We then extend the protocol to switching topologies and propose a new hybrid consensus filter design. Convergence results under both balanced directed, and general directed graphs are given for switching graphs. Consensus error bounds are analytically derived in the case of time‐varying inputs. Satisfactory simulation results are shown. Copyright © 2014 John Wiley & Sons, Ltd.