2017
DOI: 10.1007/978-3-319-59394-4_10
|View full text |Cite
|
Sign up to set email alerts
|

An Algorithm for Allocating Structured Tasks in Multi-Robot Scenarios

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
2
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 11 publications
0
4
0
Order By: Relevance
“…The average execution time of these simulations was 4 seconds for each simulation with 5 agents up to 15 seconds with 35 agents. In [1], tests with up to 60 tasks were also performed with similar results.…”
Section: The Task Allocation Mechanismmentioning
confidence: 75%
See 1 more Smart Citation
“…The average execution time of these simulations was 4 seconds for each simulation with 5 agents up to 15 seconds with 35 agents. In [1], tests with up to 60 tasks were also performed with similar results.…”
Section: The Task Allocation Mechanismmentioning
confidence: 75%
“…A version of the task allocation mechanism without the use of blockchain technology has been implemented and runs in BDI agents developed in JaCaMo framework. The algorithms that constitute the mechanism are detailed in [1], where initial results, obtained from Monte-Carlo simulations, demonstrate that the proposed mechanism seems to scale well, as well as provides near-optimal allocations.…”
Section: The Task Allocation Mechanismmentioning
confidence: 99%
“…The proposed mechanism was initially inspired from the work of Luo et al, but it is significantly different since we are working with different types of tasks, considering the use of roles and verification of constraints related to the heterogeneity of robots. Some of the ideas in this paper first appeared in an earlier work of the authors . In this paper, we provide further details about the process and algorithms, we provide new results from the comparison with the optimal solution and we introduced a comparison with other decentralized approaches.…”
Section: Introductionmentioning
confidence: 99%
“…11 In this paper, we provide further details about the process and algorithms, we provide new results from the comparison with the optimal solution and we introduced a comparison with other decentralized approaches. We also changed the way we determine the end of the allocation process; as in our earlier work, 11 we used the same approach as the work of Luo et al 8 In this paper, we use a flooding disaster scenario to exemplify our approach. Flooding disasters are typically very dynamic and have complex tasks to be executed.…”
Section: Introductionmentioning
confidence: 99%