SOS計画法によるキノダイナミック運動計画のための許容ヒューリスティック設計
Design of Admissible Heuristics for Kinodynamic Motion Planning via Sum-of-Squares Programming
キノダイナミック運動計画における許容ヒューリスティックを、問題データから直接確認できる十分条件とSOS計画法による多項式時間最適化で設計する手法を提案した論文。
著者: Brian Paden, Valerio Varriccho, Emilio Frazzoli
分類: cs.RO
原文アブストラクト
How does one obtain an admissible heuristic for a kinodynamic motion planning problem? This paper develops the analytical tools and techniques to answer this question. A sufficient condition for the admissibility of a heuristic is presented which can be checked directly from the problem data. This condition is also used to formulate a concave program to optimize an admissible heuristic. This optimization is then approximated and solved in polynomial time using sum-of-squares programming techniques. A number of examples are provided to demonstrate these concepts.
