Multi-robot motion planning amidst dynamic obstacle

D. Banerjee, C. G. Majumder, Suparna Roy, Arpita Chakraborty, A. Konar, R. Janarthanan
{"title":"Multi-robot motion planning amidst dynamic obstacle","authors":"D. Banerjee, C. G. Majumder, Suparna Roy, Arpita Chakraborty, A. Konar, R. Janarthanan","doi":"10.1109/ReTIS.2011.6146866","DOIUrl":null,"url":null,"abstract":"This paper provides a modern approach to multi-robot motion planning in a given world map amidst both static and dynamic obstacles. The distributed method for multi-robot motion planning has been realized with particle swarm optimization algorithm. The experimental results show that the variation in the path deviation from optimal trajectory of the mobile robots increases with the increase in the number of dynamic obstacles. But here we have presented an approach which minimizes the probability of collision of the robots with the obstacles.","PeriodicalId":137916,"journal":{"name":"2011 International Conference on Recent Trends in Information Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Recent Trends in Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ReTIS.2011.6146866","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper provides a modern approach to multi-robot motion planning in a given world map amidst both static and dynamic obstacles. The distributed method for multi-robot motion planning has been realized with particle swarm optimization algorithm. The experimental results show that the variation in the path deviation from optimal trajectory of the mobile robots increases with the increase in the number of dynamic obstacles. But here we have presented an approach which minimizes the probability of collision of the robots with the obstacles.
动态障碍物下多机器人运动规划
本文提供了一种基于静态和动态障碍物的多机器人在给定世界地图上的运动规划方法。采用粒子群算法实现了多机器人运动规划的分布式方法。实验结果表明,移动机器人的路径偏离最优轨迹的变化随着动态障碍物数量的增加而增大。但在这里,我们提出了一种最小化机器人与障碍物碰撞概率的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信