We consider the consensus problem on undirected and connected graphs of anticipatory agents in the presence of information transmission delays. The agents anticipate the states of their neighbors using past information, thereby introducing an additional delay into the dynamics. We find a sufficient condition in terms of delays and the network topology for the system to reach consensus from arbitrary initial conditions. We show by numerical simulations that employing anticipation increases the speed of convergence to consensus.