Lazy Lifelong Planning for Efficient Replanning in Graphs with Expensive Edge Evaluation
Jaein Lim, Siddhartha Srinivasa, Panagiotis Tsiotras
Abstract
We present an incremental search algorithm, called Lifelong-GLS, which combines the vertex efficiency of Lifelong Planning A* (LPA*) and the edge efficiency of Generalized Lazy Search (GLS) for efficient replanning on dynamic graphs where edge evaluation is expensive. We use a lazily evaluated LPA* to repair the cost-to-come inconsistencies of the relevant region of the current search tree based on the previous search results, and then we restrict the expensive edge evaluations only to the current shortest subpath as in the GLS framework. The proposed algorithm is complete and correct in finding the optimal solution in the current graph, if one exists. We also show the efficiency of the proposed algorithm compared to the standard LPA* and the GLS algorithms over consecutive search episodes in a dynamic environment.
BibTeX
@inproceedings{iros2022_lazylifelongplan,
title = {Lazy Lifelong Planning for Efficient Replanning in Graphs with Expensive Edge Evaluation},
author = {Jaein Lim and Siddhartha Srinivasa and Panagiotis Tsiotras},
booktitle = {IROS 2022},
year = {2022}
}