2022
DOI: 10.1007/978-3-031-21090-7_4
|View full text |Cite
|
Sign up to set email alerts
|

Large-Scale Heterogeneous Multi-robot Coverage via Domain Decomposition and Generative Allocation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 27 publications
0
1
0
Order By: Relevance
“…In methods based on centralized approach [19], [20], there is a central unity that is responsible to allocate tasks to the group of robots, where it assigns the tasks to the available robots with a defined criterion [21], [22]. Using this approach, the allocation is more efficient and optimum than the decentralized approaches, where the centralized computing unit has an overall overview about the robot properties and tasks [23], [24].…”
Section: Introductionmentioning
confidence: 99%
“…In methods based on centralized approach [19], [20], there is a central unity that is responsible to allocate tasks to the group of robots, where it assigns the tasks to the available robots with a defined criterion [21], [22]. Using this approach, the allocation is more efficient and optimum than the decentralized approaches, where the centralized computing unit has an overall overview about the robot properties and tasks [23], [24].…”
Section: Introductionmentioning
confidence: 99%