Motions of a connected subgraph representing a swarm of robots inside a graph of work stations
| Main Authors: | Atilano, Aarón; Division de Matematicas e Ingenieria, Facultad de Estudios Superiores Acatlan, Universidad Nacional Autonoma de Mexico, State of México, Mexico, Bejos, Sebastian; Division de Matematicas e Ingenieria, Facultad de Estudios Superiores Acatlan, Universidad Nacional Autonoma de Mexico, State of México, Mexico Coordinacion de Ciencias Computacionales, Instituto Nacional de Astrofisica, Optica y Electronica, Puebla, Mexico, Rubio-Montiel, Christian; Division de Matematicas e Ingenieria, Facultad de Estudios Superiores Acatlan, Universidad Nacional Autonoma de Mexico, State of México, Mexico |
|---|---|
| Other Authors: | Rubio-Montiel was partially supported by PAIDI grant 007/21 |
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2022
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/1497 https://www.ejgta.org/index.php/ejgta/article/view/1497/pdf_236 |
Daftar Isi:
- 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.