2012
DOI: 10.1080/00207721.2011.564675
|View full text |Cite
|
Sign up to set email alerts
|

Flocking of multi-agents with time delay

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
14
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 34 publications
(14 citation statements)
references
References 16 publications
0
14
0
Order By: Relevance
“…Moreover from (14), it follows that a ep T ip i ≤p T (a e l nN + b e ((L + c 2 H ) ⊗ l n ))p ≤ 2Q max (21) Thus p i ≤ √ 2Q max /a e . Therefore the set such that Q(t) ≤ Q max is closed and bounded then it is compact set.…”
Section: Collisions Between Agents Are Avoidedmentioning
confidence: 92%
“…Moreover from (14), it follows that a ep T ip i ≤p T (a e l nN + b e ((L + c 2 H ) ⊗ l n ))p ≤ 2Q max (21) Thus p i ≤ √ 2Q max /a e . Therefore the set such that Q(t) ≤ Q max is closed and bounded then it is compact set.…”
Section: Collisions Between Agents Are Avoidedmentioning
confidence: 92%
“…In this model, all agents determine their next velocity by calculating the weighted average of the speed difference of their neighbors, while the weight is determined by the distance between the agent and its neighbors. The study of the C-S model has received much attention, and the model has been generalized by considering more factors such as time lag [9,10] and noise [11,12]. Besides these factors, the connecting structure among the agents is yet another important factor affecting the dynamics of the C-S system.…”
Section: Introductionmentioning
confidence: 99%
“…Yu studied the leader–follower flocking control with time‐varying velocities. Yang considered flocking with time delay. However, these works concentrate on agents with holonomic kinematics, which are not adequate to model many practical systems.…”
Section: Introductionmentioning
confidence: 99%