.png){kind=icon}
返回
Active leading through obstacles using ant-colony algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2011.08.030.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In presence of obstacles, inter-agent pulling actions must be bounded. In this case, to remain connected to the group, the leader-agent (LA) must perform an active leading strategy. In this paper, an active leading algorithm is proposed which monitors the neighborhood of the LA and adjusts its velocity. The algorithm is based on the ant colony optimization (ACO) technique. As a real time optimization package, the ACO algorithm maximizes influence of the LA on the group, leading to fast flocking. Comparison with another optimization method is provided as well. Simulations show that the algorithm is successful and cost effective. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Multi-agents
Active leader
Fast flocking
Ant colony algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
A connection between formation infeasibility and velocity alignment in kinematic multi-agent systems.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏
分享收藏
查看更多内容