A Method for Solving the Problem of Map Connectivity Analysis when Mapping an Area by a Roboswarm with Communication
- 作者: Pavlovsky V.E.1, Pavlovsky V.V.2
-
隶属关系:
- Keldysh Institute of Applied Mathematics, Russian Academy of Sciences
- Plekhanov Russian University of Economics
- 期: 卷 46, 编号 6 (2019)
- 页面: 416-421
- 栏目: Article
- URL: https://journals.rcsi.science/0147-6882/article/view/175555
- DOI: https://doi.org/10.3103/S0147688219060078
- ID: 175555
如何引用文章
详细
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.
关键词
作者简介
V. Pavlovsky
Keldysh Institute of Applied Mathematics, Russian Academy of Sciences
编辑信件的主要联系方式.
Email: vlpavl@mail.ru
俄罗斯联邦, Moscow, 125047
V. Pavlovsky
Plekhanov Russian University of Economics
编辑信件的主要联系方式.
Email: vlpavl2000@mail.ru
俄罗斯联邦, Moscow, 115093
补充文件
