重み付き彩色グラフにおける大域最適経路探索のための一般化A*アルゴリズム
A Generalized A* Algorithm for Finding Globally Optimal Paths in Weighted Colored Graphs
辺の重みと色で幾何・意味情報を表現した重み付き彩色グラフ上で、低ランク色の辺を最小限に含む最短経路を探索するClass-Ordered A*を提案し、完全性と最適性を証明した。
著者: Jaein Lim, Panagiotis Tsiotras
分類: cs.RO, cs.AI, cs.SY, eess.SY
原文アブストラクト
Both geometric and semantic information of the search space is imperative for a good plan. We encode those properties in a weighted colored graph (geometric information in terms of edge weight and semantic information in terms of edge and vertex color), and propose a generalized A* to find the shortest path among the set of paths with minimal inclusion of low-ranked color edges. We prove the completeness and optimality of this Class-Ordered A* (COA*) algorithm with respect to the hereto defined notion of optimality. The utility of COA* is numerically validated in a ternary graph with feasible, infeasible, and unknown vertices and edges for the cases of a 2D mobile robot, a 3D robotic arm, and a 5D robotic arm with limited sensing capabilities. We compare the results of COA* to that of the regular A* algorithm, the latter of which finds the shortest path regardless of uncertainty, and we show that the COA* dominates the A* solution in terms of finding less uncertain paths.
