2014
DOI: 10.1007/s10514-014-9412-1
|View full text |Cite
|
Sign up to set email alerts
|

Goal assignment and trajectory planning for large teams of interchangeable robots

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
58
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
4
2

Relationship

3
7

Authors

Journals

citations
Cited by 89 publications
(58 citation statements)
references
References 23 publications
0
58
0
Order By: Relevance
“…Online sequential convex programming has been employed by Augugliaro et al (2012) and Chen et al (2015) to compute collision-free trajectories for multiple Micro Air Vehicles (MAVs), but without considering formations. The assignment of robots to the target positions in the formation is another optimization problem that was solved with a centralized algorithm by Turpin et al (2014) or with a distributed algorithm, albeit in environments without obstacles, by Montijano and Mosteo (2014) and Morgan et al (2016). Building upon the centralized, yet online, method by Alonso-Mora et al (2017), we propose an optimization and consensus based approach to reconfigure the formation in dynamic environments, which is distributed and online.…”
Section: Related Workmentioning
confidence: 99%
“…Online sequential convex programming has been employed by Augugliaro et al (2012) and Chen et al (2015) to compute collision-free trajectories for multiple Micro Air Vehicles (MAVs), but without considering formations. The assignment of robots to the target positions in the formation is another optimization problem that was solved with a centralized algorithm by Turpin et al (2014) or with a distributed algorithm, albeit in environments without obstacles, by Montijano and Mosteo (2014) and Morgan et al (2016). Building upon the centralized, yet online, method by Alonso-Mora et al (2017), we propose an optimization and consensus based approach to reconfigure the formation in dynamic environments, which is distributed and online.…”
Section: Related Workmentioning
confidence: 99%
“…Here, the task-allocation and trajectory-generation problems must be simultaneously solved. Paradoxically, the ability to assign goals reduces the problem's computational complexity, and a cleverly chosen cost function for goal assignment can directly guarantee trajectory safety (119,120). In labeled problems, by contrast, robots must visit predefined, noninterchangeable goal positions.…”
Section: Multirobot Systemsmentioning
confidence: 99%
“…Their solution, though scalable, does not use motion primitives for planning, thus is not suitable for robots that have complex dynamics. Recently, Turpin et al [25] proposed an algorithm for simultaneous planning and goal assignment for interchangeable robots and demonstrated their algorithm to work on a group of quadrotors. However, our objective is to solve the planning problem where the goals are pre-assigned to the robots.…”
Section: Related Workmentioning
confidence: 99%