首页> 外文期刊>Simulation >Development and analysis of a novel obstacle avoidance strategy for a multi-robot system inspired by the Bug-I algorithm
【24h】

Development and analysis of a novel obstacle avoidance strategy for a multi-robot system inspired by the Bug-I algorithm

机译:由Bug-I算法启发的多机器人系统新型障碍避免策略的开发与分析

获取原文
获取原文并翻译 | 示例
       

摘要

This paper addresses the development and implementation of an obstacle avoidance strategy for a multi-robot system operating in an unknown environment. This novel strategy is based on the conventional Bug-1 obstacle avoidance algorithm, which is a non-heuristic method for obstacle avoidance in an unknown environment. In the Bug-1 algorithm, a robot circumnavigates the obstacle to find the coordinates of the point, having minimum distance to the goal. In the case of the new strategy, two robots will circumnavigate the obstacle in such a manner that it will reduce both the total travel time and the distance traveled. Information acquired by the individual robots during the circumnavigation is shared across other robots to accomplish the obstacle avoidance efficiently. A theoretical analysis is carried out to show the improvement in travel time and energy expenditure of the robots in implementing the new strategy. Different test scenarios for comparing the performance of the obstacle avoidance strategies using simulations is also identified. The simulation studies using these scenarios suggest that the new algorithm is a better algorithm with respect to multi-robot obstacle avoidance. The experimental study conducted also shows that robots using this new algorithm have a better travel time and less energy expenditure than the conventional Bug-1 algorithm.
机译:本文介绍了在未知环境中运行的多机器人系统的避免避免策略的开发和实施。这种新颖的策略基于传统的Bug-1障碍避免算法,这是一种非启发式方法,用于在未知环境中避免避免。在BUG-1算法中,机器人环绕障碍物以找到点的坐标,具有与目标的最小距离。在新策略的情况下,两个机器人将以这样的方式环绕障碍,即它将减少总行程时间和行驶的距离。在Circumnavigation期间由各个机器人获得的信息在其他机器人中共享,以有效地完成障碍物。进行了理论分析,以展示机器人在实施新策略方面的旅行时间和能源支出的改善。还识别了使用模拟进行比较避免避免策略性能的不同测试场景。使用这些场景的仿真研究表明,新算法是关于多机器人避免的更好的算法。进行的实验研究还表明,使用这种新算法的机器人比传统的Bug-1算法具有更好的旅行时间和更少的能源消耗。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号