2021
DOI: 10.1002/rnc.5493
|View full text |Cite
|
Sign up to set email alerts
|

Cooperative fencing control of multiple second‐order vehicles for a moving target with and without velocity measurements

Abstract: This article studies the moving-target-fencing problem of multiple second-order vehicles, where the target moves with an unknown constant velocity. Without a predefined stand-off distance or formation, two classes of local cooperative controllers are proposed with and without velocity measurements. Specifically, the first controller uses the relative position information from the target and vehicle's neighbors, as well as the vehicle's velocity measurement, while the second controller relaxes the common requir… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 26 publications
(16 citation statements)
references
References 42 publications
0
16
0
Order By: Relevance
“…Remark 3.2 From the controller (9), the position state x d , albeit available to each agent, is not the final convergent steady state, which is different from centralized controllers (like star topology). In other words, the steady states of agents in (9) are distributedly calculated by the attraction domain of the target and the local interactions of agents, which is well accepted in most label-free fencing papers [18][19][20][21][22]. Moreover, when the target position x d is only available to a small partial of the agents in real applications, the position x d could be transferred to each agent via communication network in finite time, see, e.g., [25].…”
Section: Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…Remark 3.2 From the controller (9), the position state x d , albeit available to each agent, is not the final convergent steady state, which is different from centralized controllers (like star topology). In other words, the steady states of agents in (9) are distributedly calculated by the attraction domain of the target and the local interactions of agents, which is well accepted in most label-free fencing papers [18][19][20][21][22]. Moreover, when the target position x d is only available to a small partial of the agents in real applications, the position x d could be transferred to each agent via communication network in finite time, see, e.g., [25].…”
Section: Resultsmentioning
confidence: 99%
“…are the position and velocity of the target, respectively. If s 1 = 0 in (4), the target in (3) moves with a constant velocity, see e.g., [22]. If s 1 < 0, the target moves periodically with a variational velocity.…”
Section: Problem Formulationmentioning
confidence: 99%
See 3 more Smart Citations