サンプリングベースの時相論理経路計画
Sampling-Based Temporal Logic Path Planning
環境内の領域が満たす性質上のLTL式を満たす無限経路を、増分型かつ疎なグラフで探索する確率的完全なサンプリングベース計画法を提案した。
著者: Cristian Ioan Vasile, Calin Belta
分類: cs.RO
原文アブストラクト
In this paper, we propose a sampling-based motion planning algorithm that finds an infinite path satisfying a Linear Temporal Logic (LTL) formula over a set of properties satisfied by some regions in a given environment. The algorithm has three main features. First, it is incremental, in the sense that the procedure for finding a satisfying path at each iteration scales only with the number of new samples generated at that iteration. Second, the underlying graph is sparse, which guarantees the low complexity of the overall method. Third, it is probabilistically complete. Examples illustrating the usefulness and the performance of the method are included.
