Next Article in Journal
The Effect of Pesticides on the Tomato Bacterial Speck Disease Pathogen Pseudomonas Syringae pv. Tomato
Next Article in Special Issue
RADIO: Parameterized Generative Radar Data Augmentation for Small Datasets
Previous Article in Journal
Fatigue Evaluation of Steel Bridge Details Integrating Multi-Scale Dynamic Analysis of Coupled Train-Track-Bridge System and Fracture Mechanics

Dynamic Multi-Objective Auction-Based (DYMO-Auction) Task Allocation

Computer Engineering, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia
Computer Science, Prince Sultan University, Riyadh 12345, Saudi Arabia
CISTER, INESC-TEC, ISEP, Polytechnic Institute of Porto, 4249-015 Porto, Portugal
National School of Computer Science, University Campus of Manouba, Manouba 2010, Tunisia
Author to whom correspondence should be addressed.
Appl. Sci. 2020, 10(9), 3264;
Received: 15 April 2020 / Accepted: 28 April 2020 / Published: 8 May 2020
(This article belongs to the Special Issue Advances in Intelligent Internet of Things)
In this paper, we address the problem of online dynamic multi-robot task allocation (MRTA) problem. In the existing literature, several works investigated this problem as a multi-objective optimization (MOO) problem and proposed different approaches to solve it including heuristic methods. Existing works attempted to find Pareto-optimal solutions to the MOO problem. However, to the best of authors’ knowledge, none of the existing works used the task quality as an objective to optimize. In this paper, we address this gap, and we propose a new method, distributed multi-objective task allocation approach (DYMO-Auction), that considers tasks’ quality requirement, along with travel distance and load balancing. A robot is capable of performing the same task with different levels of perfection, and a task needs to be performed with a level of perfection. We call this level of perfection quality level. We designed a new utility function to consider four competing metrics, namely the cost, energy, distance, type of tasks. It assigns the tasks dynamically as they emerge without global information and selects the auctioneer randomly for each new task to avoid the single point of failure. Extensive simulation experiments using a 3D Webots simulator are conducted to evaluate the performance of the proposed DYMO-Auction. DYMO-Auction is compared with the sequential single-item approach (SSI), which requires global information and offline calculations, and with Fuzzy Logic Multiple Traveling Salesman Problem (FL-MTSP) approach. The results demonstrate a proper matching with SSI in terms of quality satisfaction and load balancing. However, DYMO-Auction demands 20% more travel distance. We experimented with DYMO-Auction using real Turtlebot2 robots. The results of simulation experiments and prototype experiments follow the same trend. This demonstrates the usefulness and practicality of the proposed method in real-world scenarios. View Full-Text
Keywords: multi-robot system (MRS); multi-robot task allocation (MRTA); auction-based task allocation; task quality; online decision making multi-robot system (MRS); multi-robot task allocation (MRTA); auction-based task allocation; task quality; online decision making
Show Figures

Figure 1

MDPI and ACS Style

Baroudi, U.; Alshaboti, M.; Koubaa, A.; Trigui, S. Dynamic Multi-Objective Auction-Based (DYMO-Auction) Task Allocation. Appl. Sci. 2020, 10, 3264.

AMA Style

Baroudi U, Alshaboti M, Koubaa A, Trigui S. Dynamic Multi-Objective Auction-Based (DYMO-Auction) Task Allocation. Applied Sciences. 2020; 10(9):3264.

Chicago/Turabian Style

Baroudi, Uthman, Mohammad Alshaboti, Anis Koubaa, and Sahar Trigui. 2020. "Dynamic Multi-Objective Auction-Based (DYMO-Auction) Task Allocation" Applied Sciences 10, no. 9: 3264.

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

Back to TopTop