Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider stationary consensus protocols for networks of dynamic agents with fixed topologies. At each time instant, each agent knows only its and its neighbors’ state, but must reach consensus on a group decision value that is function of all the agents’ initial state.  show that the agents can reach consensus if the value of such a function is time-invariant when computed over the agents’ state trajectories.  use this basic result to introduce a non-linear protocol design rule allowing consensus on a quite general set of values. Such a set includes, e.g., any generalized mean of order p of the agents’ initial states. As a second contribution  show that our protocol design is the solution of individual optimizations performed by the agents. This notion suggests a game theoretic interpretation of consensus problems as mechanism design problems. Under this perspective a supervisor entails the agents to reach a consensus by imposing individual objectives.  prove that such objectives can be chosen so that rational agents have a unique optimal protocol, and asymptotically reach consensus on a desired group decision value.  use a Lyapunov approach to prove that the asymptotical consensus can be reached when the communication links beten nearby agents define a time-invariant undirected network. Finally  perform a simulation study concerning the vertical alignment maneuver of a team of unmanned air vehicles.
['Dario Bauso', 'L. Giarre', 'Raffaele Pesenti']
I am writing a research paper on a idea Non-linear protocols for optimal distributed consensus in networks of dynamic agents
[{"from": "human", "value": "I am writing a research paper on a idea Non-linear protocols for optimal distributed consensus in networks of dynamic agents"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider stationary consensus protocols for networks of dynamic agents with fixed topologies. At each time instant, each agent knows only its and its neighbors\u2019 state, but must reach consensus on a group decision value that is function of all the agents\u2019 initial state.  show that the agents can reach consensus if the value of such a function is time-invariant when computed over the agents\u2019 state trajectories.  use this basic result to introduce a non-linear protocol design rule allowing consensus on a quite general set of values. Such a set includes, e.g., any generalized mean of order p of the agents\u2019 initial states. As a second contribution  show that our protocol design is the solution of individual optimizations performed by the agents. This notion suggests a game theoretic interpretation of consensus problems as mechanism design problems. Under this perspective a supervisor entails the agents to reach a consensus by imposing individual objectives.  prove that such objectives can be chosen so that rational agents have a unique optimal protocol, and asymptotically reach consensus on a desired group decision value.  use a Lyapunov approach to prove that the asymptotical consensus can be reached when the communication links beten nearby agents define a time-invariant undirected network. Finally  perform a simulation study concerning the vertical alignment maneuver of a team of unmanned air vehicles."}]