首页> 外文会议>International Symposium on Programming and Systems >A distributed foraging algorithm based on artificial potential field
【24h】

A distributed foraging algorithm based on artificial potential field

机译:基于人工势场的分布式觅食算法

获取原文

摘要

Simple collections of agents that perform collectively and use distributed control algorithms constitute the interests of swarm robotics. A key issue to improve system performances is to effectively coordinate the team of agents. We present in this paper a multi-agent foraging algorithm called Cooperative-Color Marking Foraging Agents (C-CMFA). It uses the coordination rules of the S-MASA (Stigmergic Multi-Ant Search Area) algorithm to (i) speed up the search process and (ii) allow agents to build an optimal Artificial Potential Field (APF) simultaneously while exploring. To benefit from multiple robots, we add one cooperation rule in the algorithm to attract a large number of agents to the found food. This algorithm constitutes a distributed and synchronous version of the c-marking algorithm. Simulation results in comparison with the c-marking one show the superiority of C-CMFA in different environment configurations.
机译:集体执行并使用分布式控制算法的代理的简单集合构成了群体机器人技术的兴趣。改善系统性能的关键问题是有效地协调座席团队。我们在本文中提出了一种称为合作颜色标记觅食代理(C-CMFA)的多代理觅食算法。它使用S-MASA(Stigmergic多蚂蚁搜索区域)算法的协调规则来(i)加快搜索过程,并且(ii)允许代理在探索时同时建立最佳的人工势场(APF)。为了从多个机器人中受益,我们在算法中添加了一个合作规则,以吸引大量的代理商到发现的食物中。该算法构成了c标记算法的分布式和同步版本。与c-mark相比,仿真结果表明C-CMFA在不同环境配置下的优越性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号