Name
Abstract | ||
|---|---|---|
Flocking behavior of multiple agents can be widely observed in nature such as schooling fish and flocking birds. Recent literature has proposed the possibility that flocking can be achieved even with only a small fraction of informed agents with the desired position and velocity. However, it is still a challenging problem to determine which agents should be informed or have the ability to detect the desired information. This paper aims to address this problem. By combining the ideas of virtual force and pseudo-leader mechanism, where a pseudo-leader represents an informed agent who can detect the desired information, we propose a scheme for choosing pseudo-leaders in a multi-agent group, which can be applied to an unconnected or switching neighbor graph. Numerical examples are given to show the effectiveness of the methods presented in this paper. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.sysconle.2011.10.006 | Systems & Control Letters |
Keywords | Field | DocType |
Flocking,Multi-agent,Virtual leader,Pseudo-leader | Flocking (texture),Graph,Flocking (behavior),Dynamical systems theory,Artificial intelligence,Virtual leader,Mathematics | Journal |
Volume | Issue | ISSN |
61 | 1 | 0167-6911 |
Citations | PageRank | References |
17 | 0.94 | 10 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jin Zhou | 1 | 444 | 32.75 |
| Wenwu Yu | 2 | 17 | 1.95 |
| XiaoQun Wu | 3 | 264 | 33.25 |
| Michael Small | 4 | 17 | 1.95 |
| Junan Lu | 5 | 651 | 55.81 |