A centralized approach for resolving physical interference between robots using nearest first swarm method

Punit Mittal, C. Tripathi, Aditya Kumar
{"title":"A centralized approach for resolving physical interference between robots using nearest first swarm method","authors":"Punit Mittal, C. Tripathi, Aditya Kumar","doi":"10.1109/CSIT.2014.6805988","DOIUrl":null,"url":null,"abstract":"Task allocation, where tasks must be executed before deadline, is one of the major research area in multi-robot system. For efficient task allocation, physical interference between robots must be taken into account i.e. when two or more robots are assigned the same task at the same time. Nearest first swarm (NFS), one of the simplest Swarm robot task allocation strategy, is used to analyze the influence of interference in multi-robot system. This paper proposes a new approach for resolving interference in accordance with the assigned priority to robots in a multi-robot task allocation system(MRTA). Major factors that are considered for defining priority among the robots are remaining energy of the robot, task completed by individuals robot and distance to the object. A default priority is used to resolve interference when two or more homogeneous robots look for same the task. Results show that the proposed technique of interference resolution helps in improving system performance by 17 %. A foraging mission has been taken as a ground to verify the result of our method.","PeriodicalId":278806,"journal":{"name":"2014 6th International Conference on Computer Science and Information Technology (CSIT)","volume":"328 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 6th International Conference on Computer Science and Information Technology (CSIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSIT.2014.6805988","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Task allocation, where tasks must be executed before deadline, is one of the major research area in multi-robot system. For efficient task allocation, physical interference between robots must be taken into account i.e. when two or more robots are assigned the same task at the same time. Nearest first swarm (NFS), one of the simplest Swarm robot task allocation strategy, is used to analyze the influence of interference in multi-robot system. This paper proposes a new approach for resolving interference in accordance with the assigned priority to robots in a multi-robot task allocation system(MRTA). Major factors that are considered for defining priority among the robots are remaining energy of the robot, task completed by individuals robot and distance to the object. A default priority is used to resolve interference when two or more homogeneous robots look for same the task. Results show that the proposed technique of interference resolution helps in improving system performance by 17 %. A foraging mission has been taken as a ground to verify the result of our method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种用最邻近先群法集中解决机器人间物理干扰的方法
任务分配是多机器人系统中一个重要的研究领域,任务分配要求任务必须在截止日期前完成。为了有效地分配任务,必须考虑机器人之间的物理干扰,即两个或多个机器人同时分配相同的任务。利用最近邻第一群算法(NFS)分析了多机器人系统中干扰的影响,这是最简单的群机器人任务分配策略之一。在多机器人任务分配系统(MRTA)中,提出了一种根据分配给机器人的优先级解决干扰的新方法。确定机器人优先级的主要考虑因素是机器人的剩余能量、机器人个体完成的任务和机器人到目标的距离。当两个或多个同类机器人寻找相同的任务时,使用默认优先级来解决干扰。结果表明,所提出的干扰分辨技术使系统性能提高了17%。以一次觅食任务为例,验证了我们的方法的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Offline handwritten signature verification system using a supervised neural network approach Genetic vs. particle swarm optimization techniques for traffic light signals timing Comparison of weights connection strategies for spoken Malay speech recognition system An analytical model for estimating execution cost of 1D array expressions A survey on security in Cognitive Radio networks
×
引用
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