Corpus ID: 235694537

Greedy Decentralized Auction-based Task Allocation for Multi-Agent Systems

@article{Braquet2021GreedyDA,
  title={Greedy Decentralized Auction-based Task Allocation for Multi-Agent Systems},
  author={Martin Braquet and Efstathios Bakolas},
  journal={ArXiv},
  year={2021},
  volume={abs/2107.00144}
}
We propose a decentralized auction-based algorithm for the solution of dynamic task allocation problems for spatially distributed multi-agent systems. In our approach, each member of the multi-agent team is assigned to at most one task from a set of spatially distributed tasks, while several agents can be allocated to the same task. The task assignment is dynamic since it is updated at discrete time stages (iterations) to account for the current states of the agents as the latter move towards… Expand

Figures from this paper

References

SHOWING 1-10 OF 24 REFERENCES
Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions
TLDR
This paper proposes an algorithm that provides an assignment profile with utility at least 1∕(1+κ) of the optimal utility, where κ∈[0,1] is a parameter for the curvature of the submodular utility functions. Expand
Competitive analysis of repeated greedy auction algorithm for online multi-robot task assignment
TLDR
It is proved that for the general problem, under the same assumptions on the payoff as in MWBMP and an assumption on the number of tasks arising in each group, a repeated auction algorithm, where each group of tasks is optimally allocated to the available group of robots has a guaranteed competitive ratio. Expand
Consensus-Based Decentralized Auctions for Robust Task Allocation
This paper addresses task allocation to coordinate a fleet of autonomous vehicles by presenting two decentralized algorithms: the consensus-based auction algorithm (CBAA) and its generalization toExpand
Auctions for multi-robot task allocation in communication limited environments
TLDR
It is found that G-Prim and its repeated variant perform relatively well when communication is poor, and that re-sending winner data in later rounds is an easy way to improve the performance of multi-round auctions, in general. Expand
Repeated auctions for robust task execution by a robot team
TLDR
An auction-based algorithm for dynamic allocation of tasks to robots robustness to uncertainties and to robot malfunctions that happen during task execution, enabling the robots to recover from failures and reducing the overall time for task completion is presented. Expand
Resource-based task allocation for multi-robot systems
TLDR
The effectiveness of the proposed algorithm with respect to task completion time, resource consumption, and communication overhead is theoretically analyzed and is also demonstrated from the simulation of the delivery mission. Expand
Sample Greedy Based Task Allocation for Multiple Robot Systems
TLDR
A task allocation algorithm that can be decentralised by leveraging the submodularity concepts and sampling process is developed and it is confirmed that the proposed algorithm achieves solution quality, which is comparable to a state-of-the-art algorithm in the monotone case, and much better quality in the non-monot one case with significantly less computational complexity. Expand
Distributed Adaptive Reinforcement Learning: A Method for Optimal Routing
TLDR
A distributed SARSA reinforcement learning algorithm is proposed to capture the model errors and the environment changes, such as variations in customer distributions in each area, traffic, and fares, thereby providing optimal routing policies in real-time. Expand
Sold!: auction methods for multirobot coordination
TLDR
The primary contribution of the paper is to show empirically that distributed negotiation mechanisms such as MURDOCH are viable and effective for coordinating physical multirobot systems. Expand
Autonomous Vehicle-Target Assignment: A Game-Theoretical Formulation
We consider an autonomous vehicle-target assignment problem where a group of vehicles are expected to optimally assign themselves to a set of targets. We introduce a game-theoretical formulation ofExpand
...
1
2
3
...