Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The block diagram for a general average consensus estimator is developed and  show how this can be used to easily identify properties of the estimator. This structure is then used to design average consensus estimators which achieve exact average consensus for constant inputs, are robust to initial conditions and switching graph topologies, and are internally stable. Additionally, the estimators have the optimal worst-case asymptotic convergence rate over the set of connected undirected graphs whose ighted Laplacian matrices have nonzero eigenvalues in a known interval [λmin, λmax]. Two designs are presented. The first is a modification of the polynomial filter estimator proposed by Kokiopoulou and Frossard [1] which is the optimal estimator having only one state variable. The proposed design is robust to initial conditions, but not robust to switching graph topologies. The second design uses root locus techniques to obtain higher-dimensional estimators in closed-form which are robust to both initial conditions and switching graph topologies. Plots of the worst-case asymptotic convergence factor of each estimator are given as a function of the ratio λmin/λmax.
['Bryan Van Scoy', 'Randy A. Freeman', 'Kevin M. Lynch']
I am writing a research paper on a idea Design of robust dynamic average consensus estimators
[{"from": "human", "value": "I am writing a research paper on a idea Design of robust dynamic average consensus estimators"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The block diagram for a general average consensus estimator is developed and  show how this can be used to easily identify properties of the estimator. This structure is then used to design average consensus estimators which achieve exact average consensus for constant inputs, are robust to initial conditions and switching graph topologies, and are internally stable. Additionally, the estimators have the optimal worst-case asymptotic convergence rate over the set of connected undirected graphs whose ighted Laplacian matrices have nonzero eigenvalues in a known interval [\u03bbmin, \u03bbmax]. Two designs are presented. The first is a modification of the polynomial filter estimator proposed by Kokiopoulou and Frossard [1] which is the optimal estimator having only one state variable. The proposed design is robust to initial conditions, but not robust to switching graph topologies. The second design uses root locus techniques to obtain higher-dimensional estimators in closed-form which are robust to both initial conditions and switching graph topologies. Plots of the worst-case asymptotic convergence factor of each estimator are given as a function of the ratio \u03bbmin/\u03bbmax."}]