no code implementations • 24 Dec 2020 • Jaein Lim, Panagiotis Tsiotras
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.
