A task allocation algorithm based on market mechanism for multiple robot systems

Author(s):  
Zhongya Wang ◽  
Min Li ◽  
Jie Li ◽  
Jinge Cao ◽  
Hanqing Wang
2021 ◽  
Vol 6 (2) ◽  
pp. 1327-1334
Author(s):  
Siddharth Mayya ◽  
Diego S. D'antonio ◽  
David Saldana ◽  
Vijay Kumar

Robotics ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 55
Author(s):  
Diogo Matos ◽  
Pedro Costa ◽  
José Lima ◽  
Paulo Costa

Most path planning algorithms used presently in multi-robot systems are based on offline planning. The Timed Enhanced A* (TEA*) algorithm gives the possibility of planning in real time, rather than planning in advance, by using a temporal estimation of the robot’s positions at any given time. In this article, the implementation of a control system for multi-robot applications that operate in environments where communication faults can occur and where entire sections of the environment may not have any connection to the communication network will be presented. This system uses the TEA* to plan multiple robot paths and a supervision system to control communications. The supervision system supervises the communication with the robots and checks whether the robot’s movements are synchronized. The implemented system allowed the creation and execution of paths for the robots that were both safe and kept the temporal efficiency of the TEA* algorithm. Using the Simtwo2020 simulation software, capable of simulating movement dynamics and the Lazarus development environment, it was possible to simulate the execution of several different missions by the implemented system and analyze their results.


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.


Author(s):  
Muhammed Oguz Tas ◽  
Ugur Yayan ◽  
Hasan Serhan Yavuz ◽  
Ahmet Yazici

Robotic systems are used many areas where it is dangerous or difficult for people to do. The importance of autonomous robots increased with the Industry 4.0, and the concept of reliability needed more attention for long term operability of robotic systems. In this study, reliability based task allocation analysis is performed for robots by using fuzzy logic. With the help of fuzzy inference system, the result of reliability based task allocation are obtained using the amount of carried load and load carrying distances. In the study, cases of task allocation based on nearest and reliability were analyzed and compared. Experimental results showed that, the system reliability that occurs with reliability based task allocation is higher than the system reliability that occurs with nearest based task allocation.


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

Sign in / Sign up

Export Citation Format

Share Document