异构多智能体云机器人网络的危害控制算法

Siddharth Srivastava, Aritra Sarkar, B. S. Manoj
{"title":"异构多智能体云机器人网络的危害控制算法","authors":"Siddharth Srivastava, Aritra Sarkar, B. S. Manoj","doi":"10.1109/ANTS.2013.6802882","DOIUrl":null,"url":null,"abstract":"Robots exploring unknown terrains autonomously always face the threat of getting isolated or lost from the rest. Geo-coordination technologies such as GPS cannot be used in extra terrestrial situations. Therefore, an inbuilt mechanism is needed in the robot that helps to track the robot's position and prevents it from getting off the network's coverage. We define hazard-control as the task of executing a series of decisions for recovering lost robots and bringing them back to the robotic swarm network. For a swarm of robots, this task involves communicating with other robots in the system to make sure that all the robots are within the range of the multi-hop network formed by the robots. If one robot goes away of the robotic network, hazard-control algorithms help the robots to recover the lost robot back in the network. We propose three robot-centric hazard control algorithms that help to get the lost robot in a robotic swarm back in the network: (i) Random Motion algorithm, (ii) Variable Spiral algorithm, and (iii) Motion Reversal algorithm. We study the performance of the proposed algorithms, compared their efficiency and identify the scenarios where each algorithm is most suited.","PeriodicalId":286834,"journal":{"name":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Hazard control algorithms for heterogenous multi-agent cloud-enabled robotic network\",\"authors\":\"Siddharth Srivastava, Aritra Sarkar, B. S. Manoj\",\"doi\":\"10.1109/ANTS.2013.6802882\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Robots exploring unknown terrains autonomously always face the threat of getting isolated or lost from the rest. Geo-coordination technologies such as GPS cannot be used in extra terrestrial situations. Therefore, an inbuilt mechanism is needed in the robot that helps to track the robot's position and prevents it from getting off the network's coverage. We define hazard-control as the task of executing a series of decisions for recovering lost robots and bringing them back to the robotic swarm network. For a swarm of robots, this task involves communicating with other robots in the system to make sure that all the robots are within the range of the multi-hop network formed by the robots. If one robot goes away of the robotic network, hazard-control algorithms help the robots to recover the lost robot back in the network. We propose three robot-centric hazard control algorithms that help to get the lost robot in a robotic swarm back in the network: (i) Random Motion algorithm, (ii) Variable Spiral algorithm, and (iii) Motion Reversal algorithm. We study the performance of the proposed algorithms, compared their efficiency and identify the scenarios where each algorithm is most suited.\",\"PeriodicalId\":286834,\"journal\":{\"name\":\"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ANTS.2013.6802882\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANTS.2013.6802882","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

自主探索未知地形的机器人总是面临着被孤立或与其他机器人失散的威胁。GPS等地理协调技术不能用于地外环境。因此,机器人需要一个内置的机制来帮助跟踪机器人的位置,并防止它脱离网络的覆盖范围。我们将危险控制定义为为找回丢失的机器人并将其带回机器人群网络而执行一系列决策的任务。对于一群机器人来说,该任务涉及到与系统中的其他机器人进行通信,以确保所有机器人都在机器人形成的多跳网络范围内。如果一个机器人离开了机器人网络,危险控制算法会帮助机器人在网络中找回丢失的机器人。我们提出了三种以机器人为中心的危险控制算法,以帮助在机器人群中丢失的机器人回到网络中:(i)随机运动算法,(ii)可变螺旋算法和(iii)运动反转算法。我们研究了所提出算法的性能,比较了它们的效率,并确定了每种算法最适合的场景。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hazard control algorithms for heterogenous multi-agent cloud-enabled robotic network
Robots exploring unknown terrains autonomously always face the threat of getting isolated or lost from the rest. Geo-coordination technologies such as GPS cannot be used in extra terrestrial situations. Therefore, an inbuilt mechanism is needed in the robot that helps to track the robot's position and prevents it from getting off the network's coverage. We define hazard-control as the task of executing a series of decisions for recovering lost robots and bringing them back to the robotic swarm network. For a swarm of robots, this task involves communicating with other robots in the system to make sure that all the robots are within the range of the multi-hop network formed by the robots. If one robot goes away of the robotic network, hazard-control algorithms help the robots to recover the lost robot back in the network. We propose three robot-centric hazard control algorithms that help to get the lost robot in a robotic swarm back in the network: (i) Random Motion algorithm, (ii) Variable Spiral algorithm, and (iii) Motion Reversal algorithm. We study the performance of the proposed algorithms, compared their efficiency and identify the scenarios where each algorithm is most suited.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信