2022
DOI: 10.1109/lcsys.2021.3087609
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive Multi-Agent Coverage Control With Obstacle Avoidance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 18 publications
(8 citation statements)
references
References 23 publications
0
8
0
Order By: Relevance
“…The FAT is an effective tool to deal with control systems with time-varying nonlinear uncertainties [23]. For instance, if d(t) is an unknown time-varying function in a control system, one can utilize weighted basis functions to represent d(t), at each time instant, as [10], [23]- [28]…”
Section: B Fatmentioning
confidence: 99%
See 2 more Smart Citations
“…The FAT is an effective tool to deal with control systems with time-varying nonlinear uncertainties [23]. For instance, if d(t) is an unknown time-varying function in a control system, one can utilize weighted basis functions to represent d(t), at each time instant, as [10], [23]- [28]…”
Section: B Fatmentioning
confidence: 99%
“…4(d)) is conducted. The nominal controller is selected as the non-switched controller designed in [10]. The blue polygons in Fig.…”
Section: Proof Define Hi Asmentioning
confidence: 99%
See 1 more Smart Citation
“…Waydo [28,29] proposed vehicle motion planning using the steam function only on two dimensional plane; its biggest advantage is to avoid the cumbersome online optimization in each time slot based on MPC algorithm when a vehicle is avoiding a round obstacle. However, they also do not consider the problem of multi-agent with fixed formation avoiding obstacles [30]. In addition, the discrete multi-agent system combing various MPC algorithms could calculated out the predicted trajectory of obstacle avoidance.…”
Section: Introductionmentioning
confidence: 99%
“…It needs more sophisticated technique to construct efficient penalty functions and constraint conditions in various improved MPC methods [16,[22][23][24]26] for realizing obstacle avoidance, and spends a huge amount of computation for online rolling optimization. The amount of calculation is relatively reduced by using APF method to design obstacle avoidance algorithms for multi-agent, but including its various improved APF methods [15][16][17][18][19][20][21] cannot completely avoid the local minimum problem; It is efficient to avoid the local minimum problem by using sink flow [28][29][30], however, the target position of multi-agent motion needs to be given in advance. According to our proposed methods, multi-UAV formation can avoid complex obstacle group and another moving multi-UAV formation on any path without specifying the navigation destination.…”
Section: Introductionmentioning
confidence: 99%