Decentralized Dynamic Task Allocation in Swarm Robotic Systems for Disaster Response
Multiple robotic systems, working together, can provide important solutions to different real-world applications (e.g., disaster response), among which task allocation problems feature prominently. Very few existing decentralized multi-robotic task allocation (MRTA) methods simultaneously offer the following capabilities: consideration of task deadlines, consideration of robot range and task completion capacity limitations, and allowing asynchronous decision-making under dynamic task spaces. To provision these capabilities, this paper presents a computationally efficient algorithm that involves novel construction and matching of bipartite graphs. Its performance is tested on a multi-UAV flood response application.
Code (0)
등록된 구현이 없습니다.
Tasks
Decision MakingDisaster ResponseSimilar Papers 제목 키워드 기반
SPACE: A Python-based Simulator for Evaluating Decentralized Multi-Robot Task Allocation Algorithms
Swarm robotics explores the coordination of multiple robots to achieve collective goals, with collective decision-making being a central focus. This process involves decentralized robots autonomously making local decisio…
Decision MakingFISC: A Fluid-Inspired Framework for Decentralized and Scalable Swarm Control
Achieving scalable coordination in large robotic swarms is often constrained by reliance on inter-agent communication, which introduces latency, bandwidth limitations, and vulnerability to failure. To address this gap, a…
A Local Information Aggregation based Multi-Agent Reinforcement Learning for Robot Swarm Dynamic Task Allocation
In this paper, we explore how to optimize task allocation for robot swarms in dynamic environments, emphasizing the necessity of formulating robust, flexible, and scalable strategies for robot cooperation. We introduce a…
Multi-agent Reinforcement LearningDensity Matrix-based Dynamics for Quantum Robotic Swarms
In a robotic swarm, parameters such as position and proximity to the target can be described in terms of probability amplitudes. This idea led to recent studies on a quantum approach to the definition of the swarm, inclu…
Informative Path Planning with Local Penalization for Decentralized and Asynchronous Swarm Robotic Search
Decentralized swarm robotic solutions to searching for targets that emit a spatially varying signal promise task parallelism, time efficiency, and fault tolerance. It is, however, challenging for swarm algorithms to offe…
Bayesian OptimizationTask Planning