Reactive Multi-agent Coordination using Auction-based Task Allocation and Behavior Trees
Niklas Dahlquist, Bj\"orn Lindqvist, Akshit Saradagi, George, Nikolakopoulos

TL;DR
This paper introduces a reactive multi-agent coordination architecture combining auction-based task allocation with Behavior Trees, effectively managing multi-stage tasks and rerouting agents in dynamic scenarios.
Contribution
It presents a novel architecture that unifies market-inspired task auctioning with Behavior Trees for reactive multi-agent coordination, especially for multi-stage tasks.
Findings
The architecture scales well with the number of agents and tasks.
It effectively manages rerouting in multi-stage tasks.
Experimental validation demonstrates practical effectiveness.
Abstract
This article presents an architecture for multi-agent task allocation and task execution, through the unification of a market-inspired task-auctioning system with Behavior Trees for managing and executing lower level behaviors. We consider the scenario with multi-stage tasks, such as 'pick and place', whose arrival times are not known a priori. In such a scenario, a coordinating architecture is expected to be reactive to newly arrived tasks and the resulting rerouting of agents should be dependent on the stage of completion of their current multi-stage tasks. In the novel architecture proposed in this article, a central auctioning system gathers bids (cost-estimates for completing currently available tasks) from all agents, and solves a combinatorial problem to optimally assign tasks to agents. For every agent, it's participation in the auctioning system and execution of an assigned…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAuction Theory and Applications · Multi-Agent Systems and Negotiation · Scheduling and Optimization Algorithms
