3,444 research outputs found
Concurrent Constrained Optimization of Unknown Rewards for Multi-Robot Task Allocation
Task allocation can enable effective coordination of multi-robot teams to
accomplish tasks that are intractable for individual robots. However, existing
approaches to task allocation often assume that task requirements or reward
functions are known and explicitly specified by the user. In this work, we
consider the challenge of forming effective coalitions for a given
heterogeneous multi-robot team when task reward functions are unknown. To this
end, we first formulate a new class of problems, dubbed COncurrent Constrained
Online optimization of Allocation (COCOA). The COCOA problem requires online
optimization of coalitions such that the unknown rewards of all the tasks are
simultaneously maximized using a given multi-robot team with constrained
resources. To address the COCOA problem, we introduce an online optimization
algorithm, named Concurrent Multi-Task Adaptive Bandits (CMTAB), that leverages
and builds upon continuum-armed bandit algorithms. Experiments involving
detailed numerical simulations and a simulated emergency response task reveal
that CMTAB can effectively trade-off exploration and exploitation to
simultaneously and efficiently optimize the unknown task rewards while
respecting the team's resource constraints.Comment: 9 pages, 5 figures, to be published in RSS 202
A Survey and Analysis of Multi-Robot Coordination
International audienceIn the field of mobile robotics, the study of multi-robot systems (MRSs) has grown significantly in size and importance in recent years. Having made great progress in the development of the basic problems concerning single-robot control, many researchers shifted their focus to the study of multi-robot coordination. This paper presents a systematic survey and analysis of the existing literature on coordination, especially in multiple mobile robot systems (MMRSs). A series of related problems have been reviewed, which include a communication mechanism, a planning strategy and a decision-making structure. A brief conclusion and further research perspectives are given at the end of the paper
A New Method for Improving the Fairness of Multi-Robot Task Allocation by Balancing the Distribution of Tasks
This paper presents an innovative task allocation method for multi-robot systems that aims to optimize task distribution while taking into account various performance metrics such as efficiency, speed, and cost. Contrary to conventional approaches, the proposed method takes a comprehensive approach to initialization by integrating the K-means clustering algorithm, the Hungarian method for solving the assignment problem, and a genetic algorithm specifically adapted for Open Loop Travel Sales Man Problem (OLTSP). This synergistic combination allows for a more robust initialization, effectively grouping similar tasks and robots, and laying a strong foundation for the subsequent optimization process. The suggested method is flexible enough to handle a variety of situations, including Multi-Robot System (MRS) with robots that have unique capabilities and tasks of varying difficulty. The method provides a more adaptable and flexible solution than traditional algorithms, which might not be able to adequately address these variations because of the heterogeneity of the robots and the complexity of the tasks. Additionally, ensuring optimal task allocation is a key component of the suggested method. The method efficiently determines the best task assignments for robots through the use of a systematic optimization approach, thereby reducing the overall cost and time needed to complete all tasks. This contrasts with some existing methods that might not ensure optimality or might have limitations in their ability to handle a variety of scenarios. Extensive simulation experiments and numerical evaluations are carried out to validate the method's efficiency. The extensive validation process verifies the suggested approach's dependability and efficiency, giving confidence in its practical applicability
Evolutionary swarm robotics: a theoretical and methodological itinerary from individual neuro-controllers to collective behaviours
In the last decade, swarm robotics gathered much attention in the research community. By drawing inspiration from social insects and other self-organizing systems, it focuses on large robot groups featuring distributed control, adaptation, high robustness, and flexibility. Various reasons lay behind this interest in similar multi-robot systems. Above all, inspiration comes from the observation of social activities, which are based on concepts like division of labor, cooperation, and communication. If societies are organized in such a way in order to be more efficient, then robotic groups also could benefit from similar paradigms
Towards adaptive multi-robot systems: self-organization and self-adaptation
Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.The development of complex systems ensembles that operate in uncertain environments is a major challenge. The reason for this is that system designers are not able to fully specify the system during specification and development and before it is being deployed. Natural swarm systems enjoy similar characteristics, yet, being self-adaptive and being able to self-organize, these systems show beneficial emergent behaviour. Similar concepts can be extremely helpful for artificial systems, especially when it comes to multi-robot scenarios, which require such solution in order to be applicable to highly uncertain real world application. In this article, we present a comprehensive overview over state-of-the-art solutions in emergent systems, self-organization, self-adaptation, and robotics. We discuss these approaches in the light of a framework for multi-robot systems and identify similarities, differences missing links and open gaps that have to be addressed in order to make this framework possible
- …