000129861 001__ 129861
000129861 005__ 20240112163659.0
000129861 0247_ $$2doi$$a10.1109/TRO.2020.3014521
000129861 0248_ $$2sideral$$a121414
000129861 037__ $$aART-2020-121414
000129861 041__ $$aeng
000129861 100__ $$0(orcid)0000-0001-9458-6257$$aAragüés Muñoz, Rosario$$uUniversidad de Zaragoza
000129861 245__ $$aIntermittent connectivity maintenance with heterogeneous robots
000129861 260__ $$c2020
000129861 5060_ $$aAccess copy available to the general public$$fUnrestricted
000129861 5203_ $$aIn 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.
000129861 536__ $$9info:eu-repo/grantAgreement/ES/DGA/T45-17R$$9info:eu-repo/grantAgreement/ES/MCIU-AEI-FEDER/PGC2018-098719-B-I00$$9info:eu-repo/grantAgreement/ES/MICINN/CAS18-00082$$9info:eu-repo/grantAgreement/EUR/SUDOE/INTERREG/COMMANDIA-SOE2-P1-F0638
000129861 540__ $$9info:eu-repo/semantics/openAccess$$aAll rights reserved$$uhttp://www.europeana.eu/rights/rr-f/
000129861 590__ $$a5.567$$b2020
000129861 591__ $$aROBOTICS$$b4 / 28 = 0.143$$c2020$$dQ1$$eT1
000129861 592__ $$a2.027$$b2020
000129861 593__ $$aComputer Science Applications$$c2020$$dQ1
000129861 593__ $$aElectrical and Electronic Engineering$$c2020$$dQ1
000129861 593__ $$aControl and Systems Engineering$$c2020$$dQ1
000129861 655_4 $$ainfo:eu-repo/semantics/article$$vinfo:eu-repo/semantics/acceptedVersion
000129861 700__ $$aDimarogonas, Dimos V.
000129861 700__ $$aGuallar, Pablo
000129861 700__ $$0(orcid)0000-0002-3032-954X$$aSagüés Blázquiz, Carlos$$uUniversidad de Zaragoza
000129861 7102_ $$15007$$2520$$aUniversidad de Zaragoza$$bDpto. Informát.Ingenie.Sistms.$$cÁrea Ingen.Sistemas y Automát.
000129861 773__ $$g37, 1 (2020), 225-245$$pIEEE Trans. Robot.$$tIEEE Transactions on Robotics$$x1552-3098
000129861 8564_ $$s2045282$$uhttps://zaguan.unizar.es/record/129861/files/texto_completo.pdf$$yPostprint
000129861 8564_ $$s3793022$$uhttps://zaguan.unizar.es/record/129861/files/texto_completo.jpg?subformat=icon$$xicon$$yPostprint
000129861 909CO $$ooai:zaguan.unizar.es:129861$$particulos$$pdriver
000129861 951__ $$a2024-01-12-14:08:54
000129861 980__ $$aARTICLE