Dec-MCTS: Decentralized planning for multi-robot active perception
- Publication Type:
- Journal Article
- Citation:
- International Journal of Robotics Research, 2019, 38 (2-3), pp. 316 - 337
- Issue Date:
- 2019-03-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| decMCTS_journal_15.pdf | Published Version | 1.91 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© The Author(s) 2018. We propose a decentralized variant of Monte Carlo tree search (MCTS) that is suitable for a variety of tasks in multi-robot active perception. Our algorithm allows each robot to optimize its own actions by maintaining a probability distribution over plans in the joint-action space. Robots periodically communicate a compressed form of their search trees, which are used to update the joint distribution using a distributed optimization approach inspired by variational methods. Our method admits any objective function defined over robot action sequences, assumes intermittent communication, is anytime, and is suitable for online replanning. Our algorithm features a new MCTS tree expansion policy that is designed for our planning scenario. We extend the theoretical analysis of standard MCTS to provide guarantees for convergence rates to the optimal payoff sequence. We evaluate the performance of our method for generalized team orienteering and online active object recognition using real data, and show that it compares favorably to centralized MCTS even with severely degraded communication. These examples demonstrate the suitability of our algorithm for real-world active perception with multiple robots.
Please use this identifier to cite or link to this item: