Proceedings of the 2005, American Control Conference, 2005.
DOI: 10.1109/acc.2005.1470106
|View full text |Cite
|
Sign up to set email alerts
|

Experimental validation of multi-vehicle coordination strategies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(9 citation statements)
references
References 4 publications
0
9
0
Order By: Relevance
“…Although each car is only aware of two others, the swarm operates as a whole because of the iterative coupling utilized by the daisy-chain system. The performance of the swarm is somewhat dependent on initial placement of the micro-cars, however, a behavior noted in similar systems [6]. If the cars are ordered by ID, the daisy chain swarm performs excellently; the cars rarely collide and find a common heading quickly.…”
Section: A Cooperative Motion Algorithmsmentioning
confidence: 95%
“…Although each car is only aware of two others, the swarm operates as a whole because of the iterative coupling utilized by the daisy-chain system. The performance of the swarm is somewhat dependent on initial placement of the micro-cars, however, a behavior noted in similar systems [6]. If the cars are ordered by ID, the daisy chain swarm performs excellently; the cars rarely collide and find a common heading quickly.…”
Section: A Cooperative Motion Algorithmsmentioning
confidence: 95%
“…and hence from Lemma 2, the following BMI thus to the inequality (20) Therefore, according to the BMI solution subject to (16) and by considering Lemma 1, the effects of the external disturbance $ i on the regulated output´i are attenuated. By substituting K into (4) and by considering x .n/ i D u i , one can get…”
Section: Proofmentioning
confidence: 99%
“…Depending on the local information, agents gradually update their headings to the same direction. Another experiment achievement introduced in [12] demonstrates a distributed multi-agent cyclic pursuit algorithm which uses the relative angles between neighbours. Both of the [11] and [12] concern the agent headings, and agents forward velocities are defined as constant.…”
Section: Introductionmentioning
confidence: 99%
“…Another experiment achievement introduced in [12] demonstrates a distributed multi-agent cyclic pursuit algorithm which uses the relative angles between neighbours. Both of the [11] and [12] concern the agent headings, and agents forward velocities are defined as constant. Multi-agent system introduced in [13] is capable of controlling both the distances and angles between neighbours by using the local information.…”
Section: Introductionmentioning
confidence: 99%