Scalable Multiagent Coordination with Distributed Online Open Loop Planning
Lenz Belzner, Thomas Gabor

TL;DR
This paper introduces a distributed online open loop planning framework for multiagent coordination under uncertainty, utilizing heuristic search and Thompson sampling to efficiently explore large decision spaces.
Contribution
It presents a novel general framework (DOOLP) and a specific instantiation (DOTS) that effectively model and manage uncertainty in multiagent decision making.
Findings
Effective coordination in a smart factory case study.
Robust and scalable planning with limited search.
Positive empirical results demonstrating efficiency.
Abstract
We propose distributed online open loop planning (DOOLP), a general framework for online multiagent coordination and decision making under uncertainty. DOOLP is based on online heuristic search in the space defined by a generative model of the domain dynamics, which is exploited by agents to simulate and evaluate the consequences of their potential choices. We also propose distributed online Thompson sampling (DOTS) as an effective instantiation of the DOOLP framework. DOTS models sequences of agent choices by concatenating a number of multiarmed bandits for each agent and uses Thompson sampling for dealing with action value uncertainty. The Bayesian approach underlying Thompson sampling allows to effectively model and estimate uncertainty about (a) own action values and (b) other agents' behavior. This approach yields a principled and statistically sound solution to the…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics · Robotic Path Planning Algorithms · Optimization and Search Problems
