Open Access
Subscription or Fee Access
Multi-Robot Task Allocation with Energetic, Spatial and Temporal Constraints
Abstract
The Multi-Robot Task Allocation problem is the situation where some tasks and robots are given, then assignments between them must be found in order to optimize a certain measure (e.g. allocate the maximum number of tasks, etc.). We propose a generic framework to address heavily constrained MRTA problems. Some objective functions are proposed and extensively tested on ten datasets, which is our main contribution. Also, two allocation
methods – exact and heuristic – are implemented, in order to compare values of adopted evaluation metrics. Performed simulations, obtained results, and comparative study show the effectiveness of the solution, even with a large number of robots and tasks.
Keywords
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information. Also: DOI is paid service which provided by a third party. We never mentioned that we go for this for our any journal. However, journal have no objection if author go directly for this paid DOI service.