2021
DOI: 10.1016/j.conengprac.2021.104753
|View full text |Cite
|
Sign up to set email alerts
|

Centralized collision-free polynomial trajectories and goal assignment for aerial swarms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 25 publications
0
2
0
Order By: Relevance
“…generating multi-robot trajectories with collision-free goal assignment. Numerical experiments showed that the proposed method significantly reduced the total time [13]. Based on virtual motion camouflage and particle swarm optimization, Kwak et al investigated a decentralized method of trajectory optimization to solve non-linear problems constrained by the multi-robot terminal time and angle.…”
Section: Introductionmentioning
confidence: 99%
“…generating multi-robot trajectories with collision-free goal assignment. Numerical experiments showed that the proposed method significantly reduced the total time [13]. Based on virtual motion camouflage and particle swarm optimization, Kwak et al investigated a decentralized method of trajectory optimization to solve non-linear problems constrained by the multi-robot terminal time and angle.…”
Section: Introductionmentioning
confidence: 99%
“…Many different tailored strategies exist for avoiding collisions among multiple mobile agents that are assigned to interchangeable target destinations. In [11], [12] collisions are avoided by introducing delayed starting times for pre-computed trajectories to assigned destinations. In [13], [14] tasks are assigned based on optimisation problems that incentivise agents to avoid situations that lead to collisions.…”
Section: Introductionmentioning
confidence: 99%