2013
DOI: 10.1017/s0263574713000271
|View full text |Cite
|
Sign up to set email alerts
|

Cyclic pursuit in a multi-agent robotic system with double-integrator dynamics under linear interactions

Abstract: SUMMARYWe investigate the controlled realization of a stable circular pursuit model in a multi-agent robotic system described by double-integrator dynamics with homogeneous controller gains. The dynamic convergence of the system starting from a randomly chosen, non-overlapping initial configuration to a sustained, stable pursuit configuration satisfying velocity matching and uniform inter-agent separation is demonstrated using the proposed control framework. The cyclic pursuit configuration emerges from local,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
9
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 26 publications
(35 reference statements)
0
9
0
Order By: Relevance
“…It can be verified that the equation for the intersection writes as x 2 + 2x − γ 2 x = 0, which implies that the absence of intersection (except for the one at the origin) holds true for γ > √ 2. This demonstrates that the consensus condition for second-order agents (1) in cyclic pursuit can be derived easier as compared to, e.g., [7]. The consensus condition for the case of undirected (or, in terms of digraph, two-directional) ring topology is even simpler.…”
Section: Definition 3 ([30]mentioning
confidence: 92%
See 2 more Smart Citations
“…It can be verified that the equation for the intersection writes as x 2 + 2x − γ 2 x = 0, which implies that the absence of intersection (except for the one at the origin) holds true for γ > √ 2. This demonstrates that the consensus condition for second-order agents (1) in cyclic pursuit can be derived easier as compared to, e.g., [7]. The consensus condition for the case of undirected (or, in terms of digraph, two-directional) ring topology is even simpler.…”
Section: Definition 3 ([30]mentioning
confidence: 92%
“…Although the consensus conditions (5), (7) can be verified in a straightforward way, this may be computationally expensive in the case of a large number of agents. The framework presented below allows to reduce the problem to a couple of simpler ones using the notion of consensus region.…”
Section: A Graph Theorymentioning
confidence: 99%
See 1 more Smart Citation
“…In this condition, when the formation radius was large, the agents linear speeds became large which might have not been applicable in the real world. A similar problem existed in the proposed approach in [29], since there was no control on the pursuit angular speed.…”
mentioning
confidence: 91%
“…The Lyapunov matrix equation of matrix root-clustering was generalized in [1,5]. The problem of root clustering is topical for the robust control systems [10][11][12][13][14][15] and control of the multiagent systems [16].…”
Section: Introductionmentioning
confidence: 99%