Non-Cooperative Multi-Robot Planning Under Shared Resources

As more and more single-use robots are introduced to private and public spaces, it will become essential to mediate the interaction between robots. In particular, we consider the problem of resource sharing in non-cooperative multi-robot systems. We discuss the motivation for different types of shared resources and share how we used auctions to address the non-cooperative multi-agent pathfinding problem. We summarize those result, which are presented in full in a separate paper. Finally, we discuss some avenues for future work, including the application of auctions to allocate multi-unit chance-constrained resources under the presence of uncertainty. CCS CONCEPTS • Computing methodologies → Multi-agent planning; • Theory of computation → Algorithmic mechanism design.