万能プラン:たった一つの行動列ですべてを解決
Universal Plans: One Action Sequence to Solve Them All!
障害物や初期状態、目標に依存せず、あらゆる計画問題を解くことが保証された「万能プラン」を提案し、離散・連続計画での完全性を証明した。
著者: Kalle G. Timperi, Alexander J. LaValle, Steven M. LaValle
分類: cs.RO, math.CO, math.NT
原文アブストラクト
This paper introduces the notion of a universal plan, which when executed, is guaranteed to solve all planning problems in a category, regardless of the obstacles, initial state, and goal set. Such plans are specified as a deterministic sequence of actions that are blindly applied without any sensor feedback. Thus, they can be considered as pure exploration in a reinforcement learning context, and we show that with basic memory requirements, they even yield optimal plans. Building upon results in number theory and theory of automata, we provide universal plans both for discrete and continuous (motion) planning and prove their (semi)completeness. The concepts are applied and illustrated through simulation studies, and several directions for future research are sketched.
