D. Banerjee, C. G. Majumder, Suparna Roy, Arpita Chakraborty, A. Konar, R. Janarthanan
{"title":"动态障碍物下多机器人运动规划","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":"{\"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}","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}
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
