Distributed Task Allocation in Multi-Robot Systems Using Argumentation-Based Negotiation

2012 ◽  
Vol 463-464 ◽  
pp. 1238-1241 ◽  
Author(s):  
Irina Lolu ◽  
Aurelian Stanescu ◽  
Mihnea Moisescu ◽  
Ioan Stefan Sacala

The continuous growing of application’s complexity and increased interest in automated negotiation brought recently researcher’s attention to persuasive negotiation (PN) and argumentation-based negotiation (ABN). The Market-based approach has gained popularity in the last decade due to its flexibility, speed and robustness. Contract Net protocol inspired algorithms have been proved suitable for allocating weakly coupled tasks in robot teams, but there are still some challenges when addressing complex application in uncertain environments. In this context the purpose of the paper is to present a method to allocate tasks in multi-robot systems through the use of augmentation- based negotiation.

2012 ◽  
Vol 13 (1) ◽  
pp. 6-14 ◽  
Author(s):  
Aleksis Liekna ◽  
Egons Lavendelis ◽  
Arvids Grabovskis

Abstract - This paper focuses on the experimental analysts of Contract NET protocol for Multi-Robot task allocation. The problem domain consists of multiple vacuum cleaning robots that need to cooperate for cleaning an area that is beyond the capabilities of a single robot. A robot simulator has been used to experiment with various area and robot locations, and the summary of the effort required to process the tasks has been recorded. Experimental results show that using Contract NET protocol alone is not sufficient to achieve optimal results in task allocation. A more advanced strategy with or without involving the Contract NET protocol is required. Possible strategies are outlined and their analysis is the subject of the future work.


2021 ◽  
Vol 6 (2) ◽  
pp. 1327-1334
Author(s):  
Siddharth Mayya ◽  
Diego S. D'antonio ◽  
David Saldana ◽  
Vijay Kumar

2021 ◽  
Author(s):  
Ching-Wei Chuang ◽  
Harry H. Cheng

Abstract In the modern world, building an autonomous multi-robot system is essential to coordinate and control robots to help humans because using several low-cost robots becomes more robust and efficient than using one expensive, powerful robot to execute tasks to achieve the overall goal of a mission. One research area, multi-robot task allocation (MRTA), becomes substantial in a multi-robot system. Assigning suitable tasks to suitable robots is crucial in coordination, which may directly influence the result of a mission. In the past few decades, although numerous researchers have addressed various algorithms or approaches to solve MRTA problems in different multi-robot systems, it is still difficult to overcome certain challenges, such as dynamic environments, changeable task information, miscellaneous robot abilities, the dynamic condition of a robot, or uncertainties from sensors or actuators. In this paper, we propose a novel approach to handle MRTA problems with Bayesian Networks (BNs) under these challenging circumstances. Our experiments exhibit that the proposed approach may effectively solve real problems in a search-and-rescue mission in centralized, decentralized, and distributed multi-robot systems with real, low-cost robots in dynamic environments. In the future, we will demonstrate that our approach is trainable and can be utilized in a large-scale, complicated environment. Researchers might be able to apply our approach to other applications to explore its extensibility.


2006 ◽  
Author(s):  
Kristina Lerman ◽  
Chris Jones ◽  
Aram Galstyan ◽  
Maja J. Mataric

Sign in / Sign up

Export Citation Format

Share Document