A Method for Solving the Problem of Map Connectivity Analysis when Mapping an Area by a Roboswarm with Communication
- Autores: Pavlovsky V.1, Pavlovsky V.2
-
Afiliações:
- Keldysh Institute of Applied Mathematics, Russian Academy of Sciences
- Plekhanov Russian University of Economics
- Edição: Volume 46, Nº 6 (2019)
- Páginas: 416-421
- Seção: Article
- URL: https://journals.rcsi.science/0147-6882/article/view/175555
- DOI: https://doi.org/10.3103/S0147688219060078
- ID: 175555
Citar
Resumo
An algorithm for solving the problem of analysis of connectivity of a map compiled by the distributed information robot system is described. This task can be implemented by a flock (or a swarm, which is a flock without a leader) of flying reconnaissance robots, e.g., to assess if a group of ground robots provided with the obtained information can pass between obstacles. The map connectivity is analyzed based on a special renumbering of connectivity areas, which is used in data exchange between reconnaissance robots.
Palavras-chave
Sobre autores
V. Pavlovsky
Keldysh Institute of Applied Mathematics, Russian Academy of Sciences
Autor responsável pela correspondência
Email: vlpavl@mail.ru
Rússia, Moscow, 125047
V. Pavlovsky
Plekhanov Russian University of Economics
Autor responsável pela correspondência
Email: vlpavl2000@mail.ru
Rússia, Moscow, 115093