论文标题
连接子图的动作，代表工作站图内的机器人群
Motions of a connected subgraph representing a swarm of robots inside a graph of work stations
论文作者
论文摘要
想象一下，给出了一群机器人，这些机器人必须相互通信，如果满足某些条件，它们可以这样做。我们说，如果至少有一种在每对机器人之间发送消息的方法，则群体连接。仅当保留群体的连接以执行某些任务时，机器人才能从工作站移动到另一个工作站。我们通过图理论对问题进行建模，我们研究了连接的子图以及如何在保留连接性的连接图内进行它们。我们完全确定运动群。
Imagine that a swarm of robots is given, these robots must communicate with each other, and they can do so if certain conditions are met. We say that the swarm is connected if there is at least one way to send a message between each pair of robots. A robot can move from a work station to another only if the connectivity of the swarm is preserved in order to perform some tasks. We model the problem via graph theory, we study connected subgraphs and how to motion them inside a connected graph preserving the connectivity. We determine completely the group of movements.
