2014
DOI: 10.1002/asjc.1044
|View full text |Cite
|
Sign up to set email alerts
|

Formation Maneuvering and Target Interception for Multi‐Agent Systems via Rigid Graphs

Abstract: In this paper, we introduce control laws for multi‐agent formation maneuvering and target interception problems. In the target interception problem, we consider that the target velocity is unknown. Using a single‐integrator agent model, the proposed controls consist of a formation acquisition term, dependent on the graph rigidity matrix, and a formation maneuvering or target interception term. The control laws are only a function of the relative position of agents in an infinitesimally and minimally rigid grap… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
26
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 38 publications
(27 citation statements)
references
References 34 publications
1
26
0
Order By: Relevance
“…Remark 1. It should be noted that similar to the aforementioned results hold on ℜ 2 for a planar motion as well, e.g., a minimally and infinitesimally rigid framework with N + 1 vertices in ℜ 2 has exactly 2(N + 1) − 3 edges (Cai and De Queiroz, 2015). Figure 3 illustrates the aforementioned concepts on ℜ 2 .…”
Section: Coordination Of Multiple Auvssupporting
confidence: 61%
See 2 more Smart Citations
“…Remark 1. It should be noted that similar to the aforementioned results hold on ℜ 2 for a planar motion as well, e.g., a minimally and infinitesimally rigid framework with N + 1 vertices in ℜ 2 has exactly 2(N + 1) − 3 edges (Cai and De Queiroz, 2015). Figure 3 illustrates the aforementioned concepts on ℜ 2 .…”
Section: Coordination Of Multiple Auvssupporting
confidence: 61%
“…Lemma 1 . (Cai and De Queiroz, 2015 ) We consider two frameworks and which share the same graph If is infinitesimally rigid and where ϵ is a sufficient small positive constant, then is also infinitesimally rigid .…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…Simulation 1. In this simulation, we considered nine agents with the desired formation F d being the cube 4) , (1,5) , (1,9) , … , (7,9), (8,9)}. The desired inter-agent distances were given by d 14 The initial condition for the ith agent, q i (0), was selected by randomly perturbing the corresponding value of q * i in Fig.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Lemma 2: 2 [7] Consider the systeṁ 2 The proof of this lemma is omitted since it is directly based on the proof of Theorem 1 in [7].…”
Section: Flocking Controlmentioning
confidence: 99%