2009
DOI: 10.1007/s11071-009-9593-x
|View full text |Cite
|
Sign up to set email alerts
|

Flocking of multi-agents with nonlinear inner-coupling functions

Abstract: In this paper, we consider flocking of multiagents with nonlinear inner-coupling functions. First, we propose a set of control laws when multi-agents without leader, and the control law acting on each agent relies on functions of the state information. We prove all agent velocities become asymptotically the same and avoidance of collisions between the agents is ensured. Then we present a set of control laws when multi-agents with a virtual leader, and the control law acting on each agent relies on functions of… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
21
0

Year Published

2009
2009
2013
2013

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 35 publications
(21 citation statements)
references
References 15 publications
0
21
0
Order By: Relevance
“…Remark Note that both the protocols proposed in and become inapplicable when there exist intermittent speed sensor failures during the evolution of the system. To guarantee such a multi‐agent system to achieve flocking, the protocol is introduced here.…”
Section: Problems Formulation and Main Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Remark Note that both the protocols proposed in and become inapplicable when there exist intermittent speed sensor failures during the evolution of the system. To guarantee such a multi‐agent system to achieve flocking, the protocol is introduced here.…”
Section: Problems Formulation and Main Resultsmentioning
confidence: 99%
“…To guarantee such a multi‐agent system to achieve flocking, the protocol is introduced here. It is also worth mentioning that the protocol reduces to the protocols investigated in when T = [0,+ ∞ ) and ϕ 1 ( z ) satisfies Assumption 1. Also, the protocol reduces to the protocol proposed in when T = [0,+ ∞ ) and ϕ 1 ( z ) = z , zMathClass-rel∈double-struckRn.…”
Section: Problems Formulation and Main Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…These dynamical network systems cover a very broad spectrum of applications including cooperative control of unmanned air vehicles (UAVs) [3], autonomous underwater vehicles (AUVs) [4], distributed sensor networks [5], air and ground transportation systems [6], swarms of air and space vehicle formations [7,8], and congestion control in communication networks [9], to cite but a few examples. Hence, it is not surprising that a considerable research effort has been devoted to control of networks and control over networks in recent years [8,[10][11][12][13][14][15][16]. However, with the notable exception [17,18], finite-time coordination has been addressed in the literature.…”
Section: Introductionmentioning
confidence: 99%
“…tions in different fields such as unmanned air vehicles (UAVs), biology, robotics, and flocking [1][2][3][4]. Via different approaches, a great number of results for the consensus problem have been derived in [5][6][7][8][9][10][11].…”
mentioning
confidence: 99%