206 research outputs found
Partial Replanning for Decentralized Dynamic Task Allocation
In time-sensitive and dynamic missions, multi-UAV teams must respond quickly
to new information and objectives. This paper presents a dynamic decentralized
task allocation algorithm for allocating new tasks that appear online during
the solving of the task allocation problem. Our algorithm extends the
Consensus-Based Bundle Algorithm (CBBA), a decentralized task allocation
algorithm, allowing for the fast allocation of new tasks without a full
reallocation of existing tasks. CBBA with Partial Replanning (CBBA-PR) enables
the team to trade-off between convergence time and increased coordination by
resetting a portion of their previous allocation at every round of bidding on
tasks. By resetting the last tasks allocated by each agent, we are able to
ensure the convergence of the team to a conflict-free solution. CBBA-PR can be
further improved by reducing the team size involved in the replanning, further
reducing the communication burden of the team and runtime of CBBA-PR. Finally,
we validate the faster convergence and improved solution quality of CBBA-PR in
multi-UAV simulations.Comment: 11 pages, Accepted to AIAA GNC 201
Task allocation and consensus with groups of cooperating Unmanned Aerial Vehicles
The applications for Unmanned Aerial Vehicles are numerous and cover a range of areas from military applications, scientific projects to commercial activities, but many of these applications require substantial human involvement. This work focuses on the problems and limitations in cooperative Unmanned Aircraft Systems to provide increasing realism for cooperative algorithms. The Consensus Based Bundle Algorithm is extended to remove single agent limits on the task allocation and consensus algorithm. Without this limitation the Consensus Based Grouping Algorithm is proposed that allows the allocation and consensus of multiple agents onto a single task. Solving these problems further increases the usability of cooperative Unmanned Aerial Vehicles groups and reduces the need for human involvement. Additional requirements are taken into consideration including equipment requirements of tasks and creating a specific order for task completion. The Consensus Based Grouping Algorithm provides a conflict free feasible solution to the multi-agent task assignment problem that provides a reasonable assignment without the limitations of previous algorithms. Further to this the new algorithm reduces the amount of communication required for consensus and provides a robust and dynamic data structure for a realistic application. Finally this thesis provides a biologically inspired improvement to the Consensus Based Grouping Algorithm that improves the algorithms performance and solves some of the difficulties it encountered with larger cooperative requirements
A review of task allocation methods for UAVs
Unmanned aerial vehicles, can offer solutions to a lot of problems, making it crucial to research more and improve the task allocation methods used. In this survey, the main approaches used for task allocation in applications involving UAVs are presented as well as the most common applications of UAVs that require the application of task allocation methods. They are followed by the categories of the task allocation algorithms used, with the main focus being on more recent works. Our analysis of these methods focuses primarily on their complexity, optimality, and scalability. Additionally, the communication schemes commonly utilized are presented, as well as the impact of uncertainty on task allocation of UAVs. Finally, these methods are compared based on the aforementioned criteria, suggesting the most promising approaches
A survey of task allocation techniques in MAS
Multi-agent systems and especially unmanned vehicles, are a crucial part of the solution to a lot of real world problems, making essential the improvement of task allocation techniques. In this review, we present the main techniques used for task allocation algorithms, categorising them based on the techniques used, focusing mainly on recent works. We also analyse these methods, focusing mainly on their complexity, optimality and scalability. We also refer to common communication schemes used in task allocation methods, as well as to the role of uncertainty in task allocation. Finally, we compare them based on the above criteria, trying to find gaps in the literature and to propose the most promising ones
Multi-robot preemptive task scheduling with fault recovery: a novel approach to automatic logistics of smart factories
This paper presents a novel approach for Multi-Robot Task Allocation (MRTA) that introduces
priority policies on preemptive task scheduling and considers dependencies between tasks, and
tolerates faults. The approach is referred to as Multi-Robot Preemptive Task Scheduling with Fault
Recovery (MRPF). It considers the interaction between running processes and their tasks for management
at each new event, prioritizing the more relevant tasks without idleness and latency. The benefit
of this approach is the optimization of production in smart factories, where autonomous robots are
being employed to improve efficiency and increase flexibility. The evaluation of MRPF is performed
through experimentation in small-scale warehouse logistics, referred to as Augmented Reality to
Enhanced Experimentation in Smart Warehouses (ARENA). An analysis of priority scheduling, task
preemption, and fault recovery is presented to show the benefits of the proposed approach.This study was financed in part by the Coordenação de Aperfeiçoamento de Pessoal de
NÃvel Superior—Brasil (CAPES)—Finance Code 001 and in part by Conselho Nacional de Desenvolvimento
CientÃfico e Tecnológico (CNPq).info:eu-repo/semantics/publishedVersio
A Method For Improving Decentralized Task Allocation For Multiagent Systems in Low-Communication Environments.
Communication is an important aspect of task allocation, but it has a cost and low communication restricts the information exchange needed for task allocation. As a result, a lot of decentralized task allocation algorithms perform worse as communication worsens. The contribution of this thesis is a method to improve the performance of a task allocation algorithm in low-communication environments and reduce the cost of communication by restricting communication. This method, applied to the Consensus Based Auction Algorithm (CBAA), determines when an agent should communicate and estimates the information that will be received from other agents.
This method is compared to other decentralized task allocation algorithms at different levels of communication in a ship protection scenario. Results show that this method when applied to CBAA performs comparably to CBAA while reducing communication
A one decade survey of autonomous mobile robot systems
Recently, autonomous mobile robots have gained popularity in the modern world due to their relevance technology and application in real world situations. The global market for mobile robots will grow significantly over the next 20 years. Autonomous mobile robots are found in many fields including institutions, industry, business, hospitals, agriculture as well as private households for the purpose of improving day-to-day activities and services. The development of technology has increased in the requirements for mobile robots because of the services and tasks provided by them, like rescue and research operations, surveillance, carry heavy objects and so on. Researchers have conducted many works on the importance of robots, their uses, and problems. This article aims to analyze the control system of mobile robots and the way robots have the ability of moving in real-world to achieve their goals. It should be noted that there are several technological directions in a mobile robot industry. It must be observed and integrated so that the robot functions properly: Navigation systems, localization systems, detection systems (sensors) along with motion and kinematics and dynamics systems. All such systems should be united through a control unit; thus, the mission or work of mobile robots are conducted with reliability
An Auction-based Coordination Strategy for Task-Constrained Multi-Agent Stochastic Planning with Submodular Rewards
In many domains such as transportation and logistics, search and rescue, or
cooperative surveillance, tasks are pending to be allocated with the
consideration of possible execution uncertainties. Existing task coordination
algorithms either ignore the stochastic process or suffer from the
computational intensity. Taking advantage of the weakly coupled feature of the
problem and the opportunity for coordination in advance, we propose a
decentralized auction-based coordination strategy using a newly formulated
score function which is generated by forming the problem into task-constrained
Markov decision processes (MDPs). The proposed method guarantees convergence
and at least 50% optimality in the premise of a submodular reward function.
Furthermore, for the implementation on large-scale applications, an approximate
variant of the proposed method, namely Deep Auction, is also suggested with the
use of neural networks, which is evasive of the troublesome for constructing
MDPs. Inspired by the well-known actor-critic architecture, two Transformers
are used to map observations to action probabilities and cumulative rewards
respectively. Finally, we demonstrate the performance of the two proposed
approaches in the context of drone deliveries, where the stochastic planning
for the drone league is cast into a stochastic price-collecting Vehicle Routing
Problem (VRP) with time windows. Simulation results are compared with
state-of-the-art methods in terms of solution quality, planning efficiency and
scalability.Comment: 17 pages, 5 figure
Development of Decentralized Task Allocation Algorithms for Multi-Agent Systems with Very Low Communication
Existing decentralized task allocation algorithms perform poorly under very low communication. Although previous work has considered task allocation algorithms in the presence of imperfect communication, the case of very low communication has not yet been addressed.
In this thesis, we present two new algorithms: the Spatial Division Playbook Algorithm and the Travelling Salesman Playbook Algorithm, which cater to the cases when the instantaneous probability (p) of a successful message between agents satisfies p << 0.01. These algorithms work by assuming that communications may not happen, but then derive advantages whenever communications are successful.
We compare these algorithms experimentally with three state-of-the-art algorithms - ACBBA, PIA and DHBA - across multiple communication levels and multiple numbers of targets, based on three communication models: Bernoulli model, Gilbert-Elliot model and Rayleigh Fading model. Our results show that the algorithms perform better than the other algorithms and reduce the time required to ensure all targets are visited
- …