On Probabilistic Completeness of Probabilistic Cell Decomposition
Robotics
2015-07-15 v1
Abstract
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.
Cite
@article{arxiv.1507.03727,
title = {On Probabilistic Completeness of Probabilistic Cell Decomposition},
author = {Frank Lingelbach},
journal= {arXiv preprint arXiv:1507.03727},
year = {2015}
}