2023
DOI: 10.3390/s23115103
|View full text |Cite
|
Sign up to set email alerts
|

A Convex Optimization Approach to Multi-Robot Task Allocation and Path Planning

Abstract: In real-world applications, multiple robots need to be dynamically deployed to their appropriate locations as teams while the distance cost between robots and goals is minimized, which is known to be an NP-hard problem. In this paper, a new framework of team-based multi-robot task allocation and path planning is developed for robot exploration missions through a convex optimization-based distance optimal model. A new distance optimal model is proposed to minimize the traveled distance between robots and their … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 15 publications
(4 citation statements)
references
References 49 publications
0
1
0
Order By: Relevance
“…Liu et al [28] aimed to solve the slow convergence properties of fuzzy-base neural network algorithms by utilising a particle swarm optimisation training scheme to reduce computational effort. Through the use of neural networks, Yu et al [29] proposed a hybrid hierarchical reinforcement learning algorithm to solve the slow convergence rate of autonomous vehicle planned path and path planning algorithms [30]. Sampling-based methodologies often require a significant amount of computational resources and time to converge to an optimal solution, making them less suitable for real-time or time-critical applications.…”
Section: Related Workmentioning
confidence: 99%
“…Liu et al [28] aimed to solve the slow convergence properties of fuzzy-base neural network algorithms by utilising a particle swarm optimisation training scheme to reduce computational effort. Through the use of neural networks, Yu et al [29] proposed a hybrid hierarchical reinforcement learning algorithm to solve the slow convergence rate of autonomous vehicle planned path and path planning algorithms [30]. Sampling-based methodologies often require a significant amount of computational resources and time to converge to an optimal solution, making them less suitable for real-time or time-critical applications.…”
Section: Related Workmentioning
confidence: 99%
“…In this approach, the area is partitioned into 'n' clusters through AP, with each cluster subsequently assigned to a robot. A new framework of team-based multi-robot task allocation and path planning is developed for robot exploration missions through a convex optimization-based distance optimal model by Lei [37].…”
Section: Introductionmentioning
confidence: 99%
“…This not only reduces risks for operators but also significantly enhances task execution efficiency and precision. Autonomous robots offer a low-cost, non-contact disinfection method, minimizing human exposure risks [ 10 , 12 ]. The research community has explored integrating ultraviolet light with autonomous robots [ 13 , 14 , 15 , 16 ].…”
Section: Introductionmentioning
confidence: 99%