情報付きスタイナー木:高次元における多目的経路探索のためのサンプリングと枝刈り
Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions
サンプリングベースの経路計画と最小全域木の枝刈りを組み合わせ、高次元空間での多目的経路探索を効率的に解く手法を提案し、漸近的な2近似保証と高速・高品質な解を得られることを示した。
著者: Nikhil Chandak, Kenny Chour, Sivakumar Rathinam, R. Ravi
分類: cs.MA, cs.AI, cs.RO
原文アブストラクト
We interleave sampling based motion planning methods with pruning ideas from minimum spanning tree algorithms to develop a new approach for solving a Multi-Goal Path Finding (MGPF) problem in high dimensional spaces. The approach alternates between sampling points from selected regions in the search space and de-emphasizing regions that may not lead to good solutions for MGPF. Our approach provides an asymptotic, 2-approximation guarantee for MGPF. We also present extensive numerical results to illustrate the advantages of our proposed approach over uniform sampling in terms of the quality of the solutions found and computation speed.
