Survivability of bouncing robots

Author:

Czyzowicz J.1,Dobrev S.2,Kranakis E.3,Pacheco Eduardo4

Affiliation:

1. Université du Québec en Outaouais, Gatineau, Québec, J8X 3X7, Canada

2. Slovak Academy of Sciences, 840 00 Bratislava, Slovak Republic

3. Carleton University, Ottawa, Ontario K1S 5B6, Canada

4. Oracle, Zapopan, Jalisco, 45116, Mexico

Abstract

Bouncing robots are mobile agents with limited sensing capabilities adjusting their movements upon collisions either with other robots or obstacles in the environment. They behave like elastic particles sliding on a cycle or a segment. When two of them collide, they instantaneously update their velocities according to the laws of classical mechanics for elastic collisions. They have no control on their movements which are determined only by their masses, velocities, and upcoming sequence of collisions. We suppose that a robot arriving for the second time to its initial position dies instantaneously. We study the survivability of collections of swarms of bouncing robots. More exactly, we are looking for subsets of swarms such that after some initial bounces which may result in some robots dying, the surviving subset of the swarm continues its bouncing movement, with no robot reaching its initial position. For the case of robots of equal masses and speeds we prove that all robots bouncing in the segment must always die while there are configurations of robots on the cycle with surviving subsets. We show the smallest such configuration containing four robots with two survivors. We show that any collection of less than four robots must always die. On the other hand, we show that [Formula: see text] robots always die where [Formula: see text] (and [Formula: see text]) is the number of robots starting their movements in clockwise (respectively, counterclockwise) direction in swarm [Formula: see text]. When robots bouncing on a cycle or a segment have arbitrary masses we show that at least one robot must always die. Further, we show that in either environment it is possible to construct swarms with [Formula: see text] survivors. We prove, however, that the survivors in the segment must remain static indefinitely while in the case of the cycle it is possible to have surviving collections with strictly positive kinetic energy.

Publisher

World Scientific Pub Co Pte Lt

Subject

Discrete Mathematics and Combinatorics

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3