経路計画arXiv:1507.03727
確率的セル分解の確率的完全性について
On Probabilistic Completeness of Probabilistic Cell Decomposition
近似セル分解と確率的サンプリングを組み合わせた経路計画法PCDが確率的完全性を持つことを初めて詳細に証明した論文。
著者: Frank Lingelbach
分類: cs.RO
原文アブストラクト
Probabilistic Cell Decomposition (PCD) is a probabilistic path planning method combining the concepts of approximate cell decomposition with probabilistic sampling. It has been shown that the use of lazy evaluation techniques and supervised sampling in important areas result in a high performance path planning method. Even if it was postulated before that PCD is probabilistically complete, we present a detailed proof of probabilistic completeness here for the first time.
