1,741 research outputs found
Sequential Single-Cluster Auctions for Multi-Robot Task Allocation
This thesis studies task allocation in multi-robot teams operating in dynamic environments. The multi-robot task allocation problem
is a complex NP-Complete optimisation problem with globally optimal solutions often difficult to find. Because of this, the rapid generation of near optimal solutions to the problem that minimise task execution time and/or energy used by robots is highly desired. Our approach seeks to cluster together closely related tasks and then builds on existing distributed market-based auction architectures for distributing these sets of tasks among several autonomous robots.
Dynamic environments introduce many challenges that are not found in closed systems. For instance, it is common for additional tasks to be inserted into a system after an initial solution to the task allocation problem is determined. Additionally, it is highly likely in long-term autonomous systems that individual robots may suffer some form of failure. The ability to alter plans to react to these types of challenges in a dynamic environment is required for the completion of all tasks. In our approach we allow the repeated formation and auctioning of task clusters with varying tasks. This allows us to react to and change the task allocation among robots during execution.
Throughout this thesis we use empirical evaluation to study different approaches for forming clusters of tasks and the application of task clustering to distributed auctions for multi-robot task allocation problems. Our results show that allocating clusters of tasks to robots in solving these types of problems is a fast and effective method and produces near optimal solutions
Recommended from our members
Centralized versus market-based approaches to mobile task allocation problem: State-of-the-art
Centralized approach has been adopted for finding solutions to resource allocation problems (RAPs) in many real-life applications. On the other hand, market-based approach has been proposed as an alternative to solve the problem due to recent advancement in ICT technologies. In spite of the existence of some efforts to review the pros and cons of each approach in RAPs, the studies cannot be directly applied to specific problem domains like mobile task allocation problem which is characterised with high level of uncertainty on the availability of resources (workers). This paper aims to review existing studies on task allocation problems(TAPs) focusing on those two approaches and their comparison and identify major issues that need to be resolved for comparing the two approaches in mobile task allocation problems. Mobile Task Allocation Problem (MTAP) is defined and its problematic structures are explained in relation with task allocation to mobile workers. Solutions produced by each approach to some applications and variations of MTAP are also discussed and compared. Finally, some future research directions are identified in order to compare both approaches in function of uncertainty emerging from the mobile nature of the MTAP
Punctual versus continuous auction coordination for multi-robot and multi-task topological navigation
International audienceThis paper addresses the interest of using Punctual versus Continuous coordination for mobile multi-robot systems where robots use auction sales to allocate tasks between them and to compute their policies in a distributed way. In Continuous coordination, one task at a time is assigned and performed per robot. In Punctual coordination, all the tasks are distributed in Rendezvous phases during the mission execution. However , tasks allocation problem grows exponentially with the number of tasks. The proposed approach consists in two aspects: (1) a control architecture based on topo-logical representation of the environment which reduces the planning complexity and (2) a protocol based on Sequential Simultaneous Auctions (SSA) to coordinate Robots' policies. The policies are individually computed using Markov Decision Processes oriented by several goal-task positions to reach. Experimental results on both real robots and simulation describe an evaluation of the proposed robot architecture coupled wih the SSA protocol. The efficiency of missions' execution is empirically evaluated regarding continuous planning
Simultaneous Auctions for "Rendez-Vous" Coordination Phases in Multi-robot Multi-task Mission
International audienceThis paper presents a protocol that permits to automatically allocate tasks, in a distributed way, among a fleet of agents when communication is not permanently available. In cooperation settings when communication is available only during short periods, it is difficult to build joint policies of agents to collectively accomplish a mission defined by a set of tasks. The proposed approach aims to punctually coordinate the agents during "Rendezvous'' phases defined by the short periods when communication is available. This approach consists of a series of simultaneous auctions to coordinate individual policies computed in a distributed way from Markov decision processes oriented by several goals. These policies allow the agents to evaluate their own relevance in each task achievement and to communicate bids when possible. This approach is illustrated on multi-mobile-robot missions similar to distributed traveling salesmen problem. Experimental results (through simulation and on real robots) demonstrate that high-quality allocations are quickly computed
Multi-Robot Task Allocation: A Spatial Queuing Approach
Multi-Robot Task Allocation (MRTA) is an important area of research in autonomous multi-robot systems. The main problem in MRTA is to match a set of robots to a set of tasks so that the tasks can be completed by the robots while optimizing a certain metric such as the time required to complete all tasks, distance traveled by the robots and energy expended by the robots. We consider a scenario where the tasks can appear dynamically and the location of tasks are not known a priori by the robots. Additionally, for a task to be completed, it needs to be performed by multiple robots. This setting is called the MR-ST-TA (multi-robot, single-task, time- extended assginment) category of MRTA; solving the MRTA problem for this category is a known NP-hard problem. In this thesis, we address this problem by proposing a new algorithm that uses a spatial queue-based model to allocate tasks between robots while comparing its performance to several other known methods. We have implemented these algorithms on an accurately simulated model of Corobot robots within the Webots simulator for diïŹerent numbers of robots and tasks. The results show that our method is adept in all proïŹered environments, especially scenarios that beneïŹt from path planning, whereas other methods display inherent weakness at one end of the spectrum: a decentralized greedy approach exhibits ineïŹcient behavior as the robot to task ratio dips below one, whereas the Hungarian method (an oïŹine algorithm) fails to keep pace as the robot count increases
- âŠ