Irofti D.Atay, F. M.2018-04-122018-04-12201624058963http://hdl.handle.net/11693/36828We consider a linear consensus problem involving a time delay that arises from predicting the future states of agents based on their past history. In case the agents are coupled in a connected and undirected network, the exact condition for consensus is that the delay be less than a constant threshold that is independent of the network topology or size. In directed networks, however, the situation is quite different. We show that the allowable maximum delay for consensus depends on the network topology in a nontrivial way. We study this delay margin in several network constellations, including various circulant networks with directed links. We show that the delay margin depends not only on the number of neighbors, but also on the directionality of connections with those neighbors. Furthermore, the delay margin improves as the circulant networks are rewired en route to a small-world configuration. © 2016EnglishanticipationConsensusdelaygraph theorynetworkpredictionstability analysisForecastingGraph theoryNetworks (circuits)Time delayanticipationAnticipatory agentsConsensusConsensus problemsConstant thresholddelayStability analysisUndirected networkTopologyArticle10.1016/j.ifacol.2016.07.530