Near-Gathering of Energy-Constrained Mobile Agents.

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

SIROCCO（2019）

引用 0|浏览28

暂无评分

摘要

We study the task of gathering k energy-constrained mobile agents in an undirected edge-weighted graph. Each agent is initially placed on an arbitrary node and has a limited amount of energy, which constrains the distance it can move. Since this may render gathering at a single point impossible, we study three variants of near-gathering:

查看译文

关键词

Mobile agents, Power-aware robots, Limited battery, Gathering, Graph algorithms, Approximation, Computational complexity

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要