Near-gathering of energy-constrained mobile agents

DOI10.1007/978-3-030-24922-9_4zbMath1440.68018MaRDI QIDQ5919483

Shantanu Das, Christina Karousatou, Andreas Bärtschi, Matúš Mihalák, Evangelos Bampas, Jérémie Chalopin

Publication date: 3 March 2020

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://www.osti.gov/biblio/1605111

zbMATH Keywords

computational complexityapproximationgraph algorithmsmobile agentsgatheringlimited batterypower-aware robots

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Approximation algorithms (68W25)

This page was built for publication: Near-gathering of energy-constrained mobile agents