当前位置: X-MOL 学术IEEE Trans. Autom. Sci. Eng. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Swarm Foraging Under Communication and Vision Uncertainties
IEEE Transactions on Automation Science and Engineering ( IF 5.9 ) Pub Date : 4-15-2022 , DOI: 10.1109/tase.2022.3164044
Simon O. Obute 1 , Philip Kilby 2 , Mehmet R. Dogar 1 , Jordan H. Boyle 3
Affiliation  

Swarm foraging is a common test case application for multi-robot systems. In this paper RepAtt algorithm is used for improving coordination of a robot swarm by selectively broadcasting repulsion and attraction signals. This is a chemotaxis-inspired search behaviour where robots use the temporal gradients of these signals to navigate towards more advantageous areas. Hardware experiments were used to model and validate realistic, noisy sound communication and vision system. We then show through extensive simulation studies that RepAtt significantly improves swarm foraging time and robot efficiency under realistic communication and vision models. Note to Practitioners—This research developed a swarm foraging algorithm that takes into consideration the vision and communication sensing noise levels faced by robots in real world applications. The algorithm, known as RepAtt, was developed with the aim of emphasizing algorithmic simplicity and limiting the hardware requirements for the robots in the swarm. In this paper, we have focused on the problem of deploying swarm robots to forage litter in an environment such as a park. The communication model of the robots was based on the physics of sound, while their vision system was modelled using experiments with deep neural networks based object detectors. The results show that the RepAtt algorithm is robust to different distributions of targets (or litter) in the search space, exhibits good swarm efficiency with changes in swarm population and is robust to noise in its communication and vision systems. Apart from the RepAtt algorithm, other contributions made by this research include modelling of robot vision system to aid extensive study of the impact of communication and vision noise on swarm coordination. This will be relevant for extensive testing and validation before deployment to swarm robots hardware. The sound communication used in this research limits the kinds of environment the robots can be deployed in. Echoes within an enclosed environment and bandwidth limitation for communication frequency and public disturbance due to sound emitted by the robots can all contribute to this limitation. Thus, this research can be improved by investing in the development of a communication technology with similar physics. Other areas of improvement include adopting better obstacle avoidance algorithms and implementing suitable manipulators for handling litter objects. The algorithm can be extended to make it applicable for solving other problems such as search and rescue operations where foraging targets could be disaster survivors; demining and hazardous waste cleanup, where targets are the mines or waste material; and planetary exploration, where targets could be interesting features of the planets are the targets searched for by the robots.

中文翻译:


通信和视觉不确定性下的群体觅食



群体觅食是多机器人系统的常见测试用例应用。在本文中,RepAtt 算法通过选择性地广播排斥和吸引信号来改善机器人群的协调性。这是一种受趋化性启发的搜索行为,机器人利用这些信号的时间梯度导航到更有利的区域。硬件实验用于建模和验证真实的、嘈杂的声音通信和视觉系统。然后,我们通过广泛的模拟研究表明,在真实的通信和视觉模型下,RepAtt 显着提高了群体觅食时间和机器人效率。从业者须知——这项研究开发了一种群体觅食算法,该算法考虑了机器人在现实应用中面临的视觉和通信传感噪声水平。该算法被称为 RepAtt,开发的目的是强调算法的简单性并限制群体中机器人的硬件要求。在本文中,我们重点研究了部署群体机器人在公园等环境中寻找垃圾的问题。机器人的通信模型基于声音物理学,而它们的视觉系统是通过基于深度神经网络的物体检测器的实验进行建模的。结果表明,RepAtt 算法对搜索空间中目标(或垃圾)的不同分布具有鲁棒性,随着群体种群的变化表现出良好的群体效率,并且对其通信和视觉系统中的噪声具有鲁棒性。除了 RepAtt 算法之外,这项研究的其他贡献包括机器人视觉系统的建模,以帮助广泛研究通信和视觉噪声对群体协调的影响。 这将与部署到群体机器人硬件之前的广泛测试和验证相关。本研究中使用的声音通信限制了机器人可以部署的环境类型。封闭环境中的回声、通信频率的带宽限制以及机器人发出的声音引起的公共干扰都可能导致这种限制。因此,可以通过投资开发具有类似物理特性的通信技术来改进这项研究。其他改进领域包括采用更好的避障算法和实施合适的机械手来处理垃圾物体。该算法可以扩展,使其适用于解决其他问题,例如搜寻和救援行动,其中觅食目标可能是灾难幸存者;排雷和危险废物清理,目标是地雷或废料;行星探索,其中目标可能是有趣的特征,行星是机器人搜索的目标。
更新日期:2024-08-28
down
wechat
bug