Atay, Fatihcan M.Irofti, D.2018-04-122018-04-122016http://hdl.handle.net/11693/37750Date of Conference: 29 June-1 July 2016Conference Name: 2016 European Control Conference, ECC 2016We introduce and analyze a delayed consensus algorithm as a model for interacting agents using anticipation of their neighbors' states to improve convergence to consensus. We derive a necessary and sufficient condition for the system to reach consensus. Furthermore, we explicitly calculate the dominant characteristic root of the consensus problem as a measure of the speed of convergence. The results show that the anticipatory algorithm can improve the speed of consensus, especially in networks with poor connectivity. Hence, anticipation can improve performance in networks if the delay parameter is chosen judiciously, otherwise the system might diverge as agents try to anticipate too aggressively into the future.EnglishControlAnticipatory agentsCharacteristic rootsConsensus algorithmsConsensus problemsDelay parametersImprove performanceInteracting agentsSpeed of convergenceSoftware agentsConference Paper10.1109/ECC.2016.7810565