Resumen: This letter presents a novel solution for the discrete time dynamic average consensus problem. Given a set of time-varying input signals over the nodes of an undirected graph, the proposed algorithm tracks, at each node, the input signals’ average. The algorithm is based on a sequence of consensus stages combined with a second order diffusive protocol. The former overcomes the need of k-th order differences of the inputs and conservation of the network state average, while the latter overcomes the trade-off between speed and accuracy of the consensus stages by just storing the previous estimate at each node. The result is a protocol that is fast, arbitrarily accurate, and robust against input noises and initializations. The protocol is extended to an asynchronous and randomized version that follows a gossiping scheme that is robust against potential delays and packet losses. We study the convergence properties of the algorithms and validate them via simulations. Idioma: Inglés DOI: 10.1109/LCSYS.2023.3289483 Año: 2023 Publicado en: IEEE Control Systems Letters 7 (2023), 2731-2736 ISSN: 2475-1456 Factor impacto CITESCORE: 4.4 - Control and Optimization (Q1) - Control and Systems Engineering (Q2)