A Method for Solving the Problem of Map Connectivity Analysis when Mapping an Area by a Roboswarm with Communication


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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

补充文件

附件文件
动作
1. JATS XML

版权所有 © Allerton Press, Inc., 2019