Dispersion of Mobile Robots
Dispersion of Mobile Robots
复制标题
移动机器人的分散
DOI：
10.1145/3491003.3493373
复制
发表时间：
2022
期刊：
影响因子：
--
通讯作者：
W. Moses
中科院分区：
文献类型：
--
作者：
A. R. Molla;W. Moses
在本教程中，我们对Augustine和Mosse Jr.介绍的移动机器人的分散性工作进行了广泛的综述。[ICDCN 2018]。最初任意放置在n节点图的节点上的k个机器人的分散问题要求机器人自主地四处移动以达到这样的配置，即每个节点上最多有⌈个k/n个⌉机器人。通常，用于衡量此问题的解决方案的指标是实现分散的时间和每个机器人的内存要求。虽然这个问题是最近才引入的，但在最初引入它的设置中已经做了很多工作，以及对新设置的扩展。我们将提供到目前为止的技术和结果的概述，以及未来可能的工作。我们的演讲将分为两部分。在第一部分中，我们将介绍色散问题的基础和一些基本结果。在第二部分中，我们讨论了对不同背景的各种扩展和最近的发展。
In this tutorial, we provide an extensive survey of the work on dispersion of mobile robots, introduced by Augustine and Moses Jr. [ICDCN 2018]. The problem of dispersion of k robots, initially arbitrarily placed on the nodes of an n node graph, requires the robots to autonomously move around to reach a configuration such that there are at most ⌈k/n⌉ robots on each node. Typically, the metrics used to gauge solutions to this problem are the time until dispersion is achieved and the memory requirement per robot. Although this problem was introduced recently, much work has been done on it in the setting it was originally introduced in, as well as extensions to new settings. We will provide an overview of the techniques and results until now as well as possible future work. Our presentation will be in two parts. In the first part, we will present the foundations of the dispersion problem and some fundamental results. In the second part, we discuss various extensions to different settings and recent developments.
有限图上随机游走的分散时间
DOI：
10.1145/3323165.3323204
发表时间：
2019
期刊：
The 31st ACM Symposium on Parallelism in Algorithms and Architectures
影响因子：
--
作者：
Rivera;Sauerwald;Stauffer;Sylvester
通讯作者：
Sylvester