Login / Signup
Lazy Lifelong Planning for Efficient Replanning in Graphs with Expensive Edge Evaluation.
Jaein Lim
Siddhartha S. Srinivasa
Panagiotis Tsiotras
Published in:
IROS (2022)
Keyphrases
</>
computationally expensive
computationally intensive
heuristic search
neural network
undirected graph
decision theoretic
search algorithm
edge detection
learning activities
shortest path
orders of magnitude
agent architecture
graph databases
planning process
lazy learning
minimum spanning trees