Priority based multi robot task assignment

Authors:
Rahul Goyal;Tushar Sharma;Ritu Tiwari
Affiliations:
Department of IT, ABV-IIITM, Gwalior;Department of IT, ABV-IIITM, Gwalior;Department of IT, ABV-IIITM, Gwalior
Venue:
ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I
Year:
2012

Citing 9
Cited 0

Heuristic Algorithms for Task Assignment in Distributed Systems

IEEE Transactions on Computers
Scheduling parallel program tasks onto arbitrary target machines

Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
On the task assignment problem: two new efficient heuristic algorithms

Journal of Parallel and Distributed Computing
Reinforcement Learning in the Multi-Robot Domain

Autonomous Robots
Multi-Robot Task Allocation in Uncertain Environments

Autonomous Robots
Optimal Task Assignment in Heterogeneous Distributed Computing Systems

IEEE Concurrency
A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion

IEEE Transactions on Computers
Heuristic Models of Task Assignment Scheduling in Distributed Systems

Computer
Coordinated multi-robot exploration

IEEE Transactions on Robotics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we designed and developed three new model related to task assignment in robotics. The aim is to allocate all the robots to all the available tasks such that all tasks are finished with minimum total cost and minimum time taken. The first model is completely based on priority but waits for robots and allocates task only to the most suitable robots (highest bid robots). The second model completes the task in such a way that it allocates best robots that are currently available to the task without waiting for the most suitable robots to be free. The third and final model uses heuristics based approach with auction algorithm to identify the non-performing slow robots and eliminate them from the list of available robots. This helps in increasing the efficiency of the whole system and helps to reduce the total cost of performance for the system. The work aims at providing a best suitable algorithm for completing all the tasks with minimum overhead and maintaining a specific order for the completion of the tasks. Further it also rejects the slow working robots so that the total time taken for completion can be reduced.