Decentralised Online Planning for Multi-Robot Warehouse Commissioning

Claes, Daniel, Oliehoek, Frans ORCID: 0000-0003-4372-5055, Baier, Hendrik and Tuyls, Karl (2017) Decentralised Online Planning for Multi-Robot Warehouse Commissioning. In: 16th International Conference on Autonomous Agents and Multiagent Systems, 2017-5-8 - 2017-5-12, Sao Paulo, Brazil.

This is the latest version of this item.

	Text spataps_mcts.pdf - Submitted version Download (769kB)
	Text Claes17AAMAS.pdf - Published version Download (817kB)

Official URL: http://dl.acm.org/citation.cfm?id=3091125

Abstract

Warehouse commissioning is a complex task in which a team of robots needs to gather and deliver items as fast and efficiently as possible while adhering to the constraint capacity of the robots. Typical centralised control approaches can quickly become infeasible when dealing with many robots. Instead, we tackle this spatial task allocation problem via distributed planning on each robot in the system. State of the art distributed planning approaches suffer from a number of limiting assumptions and ad-hoc approximations. This paper demonstrates how to use Monte Carlo Tree Search (MOTS) to overcome these limitations and provide, scalability in a more principled manner. Our simulation-based evaluation demonstrates that this translates to higher task per-formance, especially when tasks get more complex. Moreover, this higher performance does not come at the cost of scalability: in fact, the proposed approach scales better than the previous best approach, demonstrating excellent performance on an 8-robot team servicing a warehouse comprised of over 200 locations.

Item Type:	Conference or Workshop Item (Unspecified)
Uncontrolled Keywords:	Decentralised Online Planning, SPATAPs, Multi-Robot Systems, MMDP, Warehouse Commissioning
Depositing User:	Symplectic Admin
Date Deposited:	12 Jul 2017 08:15
Last Modified:	19 Jan 2023 07:14
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3006364