社会的配慮ナビゲーションのためのホモトピー類を高速に探索するランダム化手法
A Fast Randomized Method to Find Homotopy Classes for Socially-Aware Navigation
ボロノイ図に基づくグラフ探索と社会力モデルのコストで、異なるホモトピー類に属する多様な経路を高速に生成する手法を提案し、Yenのアルゴリズムより速く多様な経路が得られることを示した。
著者: Luigi Palmieri, Andrey Rudenko, Kai O. Arras
分類: cs.RO, cs.CV
原文アブストラクト
We introduce and show preliminary results of a fast randomized method that finds a set of K paths lying in distinct homotopy classes. We frame the path planning task as a graph search problem, where the navigation graph is based on a Voronoi diagram. The search is biased by a cost function derived from the social force model that is used to generate and select the paths. We compare our method to Yen's algorithm, and empirically show that our approach is faster to find a subset of homotopy classes. Furthermore our approach computes a set of more diverse paths with respect to the baseline while obtaining a negligible loss in path quality.
