Resumen: In this article, we consider a scenario of cooperative task servicing, with a team of heterogeneous robots with different maximum speeds and communication radii, in charge of keeping the network intermittently connected. We abstract the task locations into a one-dimensional cycle graph that is traversed by the communicating robots, and we discuss intermittent communication strategies so that each task location is periodically visited, with a worst-case revisiting time. Robots move forward and backward along the cycle graph, exchanging data with their previous and next neighbors when they meet, and updating their region boundaries. Asymptotically, each robot is in charge of a region of the cycle graph, depending on its capabilities. The method is distributed, and robots only exchange data when they meet. Idioma: Inglés DOI: 10.1109/TRO.2020.3014521 Año: 2020 Publicado en: IEEE Transactions on Robotics 37, 1 (2020), 225-245 ISSN: 1552-3098 Factor impacto JCR: 5.567 (2020) Categ. JCR: ROBOTICS rank: 4 / 28 = 0.143 (2020) - Q1 - T1 Factor impacto SCIMAGO: 2.027 - Computer Science Applications (Q1) - Electrical and Electronic Engineering (Q1) - Control and Systems Engineering (Q1)