Fixed-time flocking and collision avoidance problem of a Cucker-Smale model (Q2193368)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7239168
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fixed-time flocking and collision avoidance problem of a Cucker-Smale model |
scientific article; zbMATH DE number 7239168 |
Statements
Fixed-time flocking and collision avoidance problem of a Cucker-Smale model (English)
0 references
25 August 2020
0 references
Summary: Multiagent systems are used in artificial intelligence, control theory, and social sciences. In this article, we studied a Cucker-Smale model with a continuous non-Lipschitz protocol. The methodology presented in the current paper is based on the explicit construction of a Lyapunov functional. By using the fixed-time control technology, we show that the flocking can occur in fixed-time and collision avoiding when a singular communication function with a weighted sum of sign functions of the relative velocities among agents, and we can obtain the estimation of the converging time which is independent of the initial states of agents. Theoretical results are supported by numerical simulations.
0 references
0 references
0 references
0 references
0 references
0 references
0.9704466
0 references
0.9583709
0 references
0.95339555
0 references
0.9514687
0 references
0.94141805
0 references
0.9387561
0 references
0.93051267
0 references
0.92555183
0 references
0.92553806
0 references
