arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1707.06391cs.DCcs.DS
收藏

移动机器人在动力环中的确定性离散

Deterministic Dispersion of Mobile Robots in Dynamic Rings

Ankush Agarwalla, John Augustine, William K. Moses, Madhav Sankar K., Arvind Krishna Sridhar

摘要:

在这项工作中,我们研究了动态环上的移动机器人分散的问题。研究了由Augustine和Moses Jr.提出的$n$机器人在$n$节点图上的分散性问题。[1]要求机器人相互协调,并达到每个节点上只有一个机器人的配置。这个问题有现实世界的应用程序,并适用于每当我们想要最小化的总成本的$n$代理共享$n$资源,位于不同的地方,受到的约束,代理移动到不同的资源的成本是比较远小于多个代理共享一个资源(例如,智能电动汽车共享充电站)的成本。该问题的研究也为图上的散布问题、移动机器人的探索问题以及图上的负载均衡问题的研究提供了间接的帮助。我们解决的问题,分散存在两种类型的动力学的基础图:(i)顶点置换和(ii)1-区间连通性。我们引入了顶点置换动态性的概念,并使其意味着对于给定的节点集,在每一轮中,对手确保保持环结构,但节点之间的连接可能会改变。我们使用Di Luna等人的1-区间连通性的思想。[10],其中对于给定的环,在每一轮中,对手最多选择一条边来删除。我们假设机器人有充分的可见性,并提出渐近时间最优算法,以实现分散在存在的两种类型的动力学时,机器人手征。当机器人不具有手征,我们提出了渐近时间最优算法,以实现分散受到一定的约束。最后,我们提供了不可能的结果分散时,机器人没有可见性。

英文摘要:

In this work, we study the problem of dispersion of mobile robots on dynamic rings. The problem of dispersion of $n$ robots on an $n$ node graph, introduced by Augustine and Moses Jr. [1], requires robots to coordinate with each other and reach a configuration where exactly one robot is present on each node. This problem has real world applications and applies whenever we want to minimize the total cost of $n$ agents sharing $n$ resources, located at various places, subject to the constraint that the cost of an agent moving to a different resource is comparatively much smaller than the cost of multiple agents sharing a resource (e.g. smart electric cars sharing recharge stations). The study of this problem also provides indirect benefits to the study of scattering on graphs, the study of exploration by mobile robots, and the study of load balancing on graphs. We solve the problem of dispersion in the presence of two types of dynamism in the underlying graph: (i) vertex permutation and (ii) 1-interval connectivity. We introduce the notion of vertex permutation dynamism and have it mean that for a given set of nodes, in every round, the adversary ensures a ring structure is maintained, but the connections between the nodes may change. We use the idea of 1-interval connectivity from Di Luna et al. [10], where for a given ring, in each round, the adversary chooses at most one edge to remove. We assume robots have full visibility and present asymptotically time optimal algorithms to achieve dispersion in the presence of both types of dynamism when robots have chirality. When robots do not have chirality, we present asymptotically time optimal algorithms to achieve dispersion subject to certain constraints. Finally, we provide impossibility results for dispersion when robots have no visibility.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑