Autonomous Distributed Systems of Myopic Mobile Robots with Lights

S. Kamei
{"title":"Autonomous Distributed Systems of Myopic Mobile Robots with Lights","authors":"S. Kamei","doi":"10.1145/3427796.3432715","DOIUrl":null,"url":null,"abstract":"The cooperation of swarming autonomous mobile robots has received significant interests in recent years. The common goal of research on it is to clarify the minimum capabilities for robots to achieve a given task. Thus, algorithms for mobile robots have been considered on a theoretical model with negative assumptions about each robot capabilities[4, 6]. Concerning the assumptions, each robot is identical (i.e., all robots run the same algorithm), anonymous (i.e., each robot has no IDs to distinguish two robots), oblivious (i.e., each robot has no memory to record past situation) and silent (i.e., each robot has no direct means of communication). In the initial model described above, because of fundamentally weak capabilities, it is known that most tasks cannot be solved without some additional assumptions even if the model considers the unlimited visibility. However, we may not need to assume completely oblivious robots considering their implementations on real devices because persistent memory is widely available. Thus, recently, luminous robots have attracted attention in order to improve robot capability [1, 7]. A luminous robot maintains a non-volatile visible light, and emits the chosen light color among a set of colors to other robots. That is, a luminous robot uses the light to memorize its state and communicate with other robots. On the other hand, for the assumption of unlimited visibility of the initial model, each robot has a too strong observation device. Therefore, several recent studies focus on myopic robots to consider the implementation of the robot system [2, 3, 5]. A myopic robot has limited visibility, i.e., it can take a snapshot only within a certain fixed distance. In this talk, we consider myopic robots with lights as a more realistic model and briefly show some recent results on the model.","PeriodicalId":335477,"journal":{"name":"Proceedings of the 22nd International Conference on Distributed Computing and Networking","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 22nd International Conference on Distributed Computing and Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3427796.3432715","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The cooperation of swarming autonomous mobile robots has received significant interests in recent years. The common goal of research on it is to clarify the minimum capabilities for robots to achieve a given task. Thus, algorithms for mobile robots have been considered on a theoretical model with negative assumptions about each robot capabilities[4, 6]. Concerning the assumptions, each robot is identical (i.e., all robots run the same algorithm), anonymous (i.e., each robot has no IDs to distinguish two robots), oblivious (i.e., each robot has no memory to record past situation) and silent (i.e., each robot has no direct means of communication). In the initial model described above, because of fundamentally weak capabilities, it is known that most tasks cannot be solved without some additional assumptions even if the model considers the unlimited visibility. However, we may not need to assume completely oblivious robots considering their implementations on real devices because persistent memory is widely available. Thus, recently, luminous robots have attracted attention in order to improve robot capability [1, 7]. A luminous robot maintains a non-volatile visible light, and emits the chosen light color among a set of colors to other robots. That is, a luminous robot uses the light to memorize its state and communicate with other robots. On the other hand, for the assumption of unlimited visibility of the initial model, each robot has a too strong observation device. Therefore, several recent studies focus on myopic robots to consider the implementation of the robot system [2, 3, 5]. A myopic robot has limited visibility, i.e., it can take a snapshot only within a certain fixed distance. In this talk, we consider myopic robots with lights as a more realistic model and briefly show some recent results on the model.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
带灯的近视移动机器人自主分布式系统
近年来,蜂群自主移动机器人的协同研究受到了广泛关注。研究它的共同目标是明确机器人完成给定任务的最小能力。因此,移动机器人的算法在一个对每个机器人的能力都有负面假设的理论模型上被考虑[4,6]。关于假设,每个机器人是相同的(即所有机器人运行相同的算法),匿名的(即每个机器人没有id来区分两个机器人),遗忘的(即每个机器人没有记忆来记录过去的情况)和沉默的(即每个机器人没有直接的通信手段)。在上面描述的初始模型中,由于基本能力较弱,即使模型考虑了无限可见性,也知道如果没有一些额外的假设,大多数任务是无法解决的。然而,考虑到它们在真实设备上的实现,我们可能不需要假设完全遗忘的机器人,因为持久内存是广泛可用的。因此,近年来,为了提高机器人的能力,发光机器人引起了人们的关注[1,7]。发光机器人保持一种不挥发的可见光,并从一组颜色中选择一种颜色发射给其他机器人。也就是说,发光机器人利用光来记忆自己的状态,并与其他机器人进行交流。另一方面,对于初始模型的无限可见性假设,每个机器人的观测装置都过于强大。因此,最近的一些研究关注于近视机器人来考虑机器人系统的实现[2,3,5]。近视机器人的能见度有限,即只能在一定的固定距离内拍摄快照。在这次演讲中,我们考虑了一个更现实的带灯的近视机器人模型,并简要地展示了该模型的一些最新成果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Certification of an Exact Worst-Case Self-Stabilization Time Early Classification Approaches for Sensors Generated Multivariate Time Series with Different Challenges Proceedings of the 22nd International Conference on Distributed Computing and Networking Node Classification and Geographical Analysis of the Lightning Cryptocurrency Network Secure Conflict-free Replicated Data Types
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1