Login / Signup
A general technique for fast comprehensive multi-root planning on graphs by coloring vertices and deferring edges.
Christopher M. Dellin
Siddhartha S. Srinivasa
Published in:
ICRA (2015)
Keyphrases
</>
weighted graph
undirected graph
directed graph
random graphs
edge weights
decision theoretic
spanning tree
directed edges
special case
heuristic search
closely related
graph theory
planning problems
ai planning
graph clustering
adjacency matrix
vertex set
labeled graphs