多目的情報探索のためのパレートモンテカルロ木探索
Pareto Monte Carlo Tree Search for Multi-Objective Informative Planning
探索と活用のトレードオフなど競合する目的を扱うため、パレート最適解を求めるモンテカルロ木探索による情報探索計画法を提案し、劣ったノード選択回数が対数オーダーで抑えられ最適解に多項式速度で収束することを示した。
著者: Weizhe Chen, Lantao Liu
分類: cs.RO
原文アブストラクト
In many environmental monitoring scenarios, the sampling robot needs to simultaneously explore the environment and exploit features of interest with limited time. We present an anytime multi-objective informative planning method called Pareto Monte Carlo tree search which allows the robot to handle potentially competing objectives such as exploration versus exploitation. The method produces optimized decision solutions for the robot based on its knowledge (estimation) of the environment state, leading to better adaptation to environmental dynamics. We provide algorithmic analysis on the critical tree node selection step and show that the number of times choosing sub-optimal nodes is logarithmically bounded and the search result converges to the optimal choices at a polynomial rate.
