2021
DOI: 10.3390/electronics10161970
|View full text |Cite
|
Sign up to set email alerts
|

Robust Formation Maintenance Methods under General Topology Pursuit of Multi-Agents Systems

Abstract: In this article, methods of formation maintenance for a group of autonomous agents under ageneral topology scheme are discussed. Unlike rendezvous or geometric formation, general topology pursuit allows the group of agents to autonomously form trochoid patterns, which are useful in civilian and military applications. However, this type of topology is established by designing a marginally stable system that may be sensitive to parameter variations. To account for this drawback of stability, linear fixed-gains a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
0
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 40 publications
0
0
0
Order By: Relevance
“…Step 2: Construct difference form Hamilton function The Nash equilibrium function term (19) is constructed in the Hamiltonian function, and the differential Hamiltonian function ( 20) is obtained to facilitate the comparison of the properties of Nash equilibrium policies and other policies.…”
Section: Remarkmentioning
confidence: 99%
See 1 more Smart Citation
“…Step 2: Construct difference form Hamilton function The Nash equilibrium function term (19) is constructed in the Hamiltonian function, and the differential Hamiltonian function ( 20) is obtained to facilitate the comparison of the properties of Nash equilibrium policies and other policies.…”
Section: Remarkmentioning
confidence: 99%
“…[17], the reinforcement learning method was used in the Nash equilibrium game for solving the decisions of agents, and the numerical solution equivalent to the analytical solution was obtained. In addition, recently there have been many off-line algorithms that were able to simplify the solution of multi-agent pursuit and evasion games [18][19][20]. The off-line algorithm for the pursuit-evasion problem in the differential game is becoming more and more mature.…”
Section: Introductionmentioning
confidence: 99%