%0 Journal Article %T Near-gathering of energy-constrained mobile agents %+ Theoretical Division and Center for Nonlinear Studies %+ Laboratoire Interdisciplinaire des Sciences du Numérique (LISN) %+ Algorithmique Distribuée (DALGO) %+ Technische Universität Darmstadt - Technical University of Darmstadt (TU Darmstadt) %+ Department of data science and Knowledge Engineering [Maastricht] %A Bärtschi, Andreas %A Bampas, Evangelos %A Chalopin, Jérémie %A Das, Shantanu %A Karousatou, Christina %A Mihalák, Matúš %< avec comité de lecture %@ 1879-2294 %J Theoretical Computer Science %I Elsevier %V 849 %P 35-46 %8 2021-01 %D 2021 %R 10.1016/j.tcs.2020.10.008 %K mobile agents %K power-aware robots %K limited battery %K gathering %K graph algorithms %K approximation %K computational complexity %Z Computer Science [cs]/Data Structures and Algorithms [cs.DS]Journal articles %G English %2 https://hal.science/hal-03065725/document %2 https://hal.science/hal-03065725/file/neargathering-TCS-Rev1.pdf %L hal-03065725 %U https://hal.science/hal-03065725 %~ UNIV-TLN %~ CNRS %~ INRIA %~ UNIV-AMU %~ CENTRALESUPELEC %~ UNIV-PARIS-SACLAY %~ LIS-LAB %~ INRIA-AUT %~ TEST-HALCNRS %~ UNIVERSITE-PARIS-SACLAY %~ ANR %~ LISN %~ GS-ENGINEERING %~ GS-COMPUTER-SCIENCE %~ INCIAM