時空間的に分散した情報獲得のためのマルチロボット経路計画
Spatially temporally distributed informative path planning for multi-robot systems
移動ロボット群が時空間場をガウス過程でモデル化し、接続性を保ちながら最大の情報利得を得る経路を分散最適化で計画する手法を提案した。
著者: Binh Nguyen, Linh Nguyen, Truong X. Nghiem, Hung La, Jose Baca, Pablo Rangel, Miguel Cid Montoya, Thang Nguyen
分類: cs.RO, cs.SY, eess.SY
原文アブストラクト
This paper investigates the problem of informative path planning for a mobile robotic sensor network in spatially temporally distributed mapping. The robots are able to gather noisy measurements from an area of interest during their movements to build a Gaussian Process (GP) model of a spatio-temporal field. The model is then utilized to predict the spatio-temporal phenomenon at different points of interest. To spatially and temporally navigate the group of robots so that they can optimally acquire maximal information gains while their connectivity is preserved, we propose a novel multistep prediction informative path planning optimization strategy employing our newly defined local cost functions. By using the dual decomposition method, it is feasible and practical to effectively solve the optimization problem in a distributed manner. The proposed method was validated through synthetic experiments utilizing real-world data sets.
