スパースガウス過程回帰によるマルチロボット情報経路計画
Multi-Robot Informative Path Planning from Regression with Sparse Gaussian Processes (with Appendix)
スパースガウス過程と勾配降下法を用いて、連続環境における情報量の多い経路を効率的に計画し、距離・速度・加速度制約も考慮できるマルチロボット情報経路計画手法を提案した。
著者: Kalvik Jakkala, Srinivas Akella
分類: cs.RO
原文アブストラクト
This paper addresses multi-robot informative path planning (IPP) for environmental monitoring. The problem involves determining informative regions in the environment that should be visited by robots to gather the most information about the environment. We propose an efficient sparse Gaussian process-based approach that uses gradient descent to optimize paths in continuous environments. Our approach efficiently scales to both spatially and spatio-temporally correlated environments. Moreover, our approach can simultaneously optimize the informative paths while accounting for routing constraints, such as a distance budget and limits on the robot's velocity and acceleration. Our approach can be used for IPP with both discrete and continuous sensing robots, with point and non-point field-of-view sensing shapes, and for both single and multi-robot IPP. We demonstrate that the proposed approach is fast and accurate on real-world data.
