Lazy Incremental Search for Efficient Replanning with Bounded Suboptimality Guarantees

by   Jaein Lim, et al.

We present a lazy incremental search algorithm, Lifelong-GLS (L-GLS), along with its bounded suboptimal version, Bounded L-GLS (B-LGLS) that combine the search efficiency of incremental search algorithms with the evaluation efficiency of lazy search algorithms for fast replanning in problem domains where edge-evaluations are more expensive than vertex-expansions. The proposed algorithms generalize Lifelong Planning A* (LPA*) and its bounded suboptimal version, Truncated LPA* (TLPA*), within the Generalized Lazy Search (GLS) framework, so as to restrict expensive edge evaluations only to the current shortest subpath when the cost-to-come inconsistencies are propagated during repair. We also present dynamic versions of the L-GLS and B-LGLS algorithms, called Generalized D* (GD*) and Bounded Generalized D* (B-GD*), respectively, for efficient replanning with non-stationary queries, designed specifically for navigation of mobile robots. We prove that the proposed algorithms are complete and correct in finding a solution that is guaranteed not to exceed the optimal solution cost by a user-chosen factor. Our numerical and experimental results support the claim that the proposed integration of the incremental and lazy search frameworks can help find solutions faster compared to the regular incremental or regular lazy search algorithms when the underlying graph representation changes often.


page 4

page 9

page 13

page 16

page 17

page 19

page 20

page 26


Lazy Lifelong Planning for Efficient Replanning in Graphs with Expensive Edge Evaluation

We present an incremental search algorithm, called Lifelong-GLS, which c...

Algorithms for Generating Ordered Solutions for Explicit AND/OR Structures

We present algorithms for generating alternative solutions for explicit ...

A Stochastic Process Model of Classical Search

Among classical search algorithms with the same heuristic information, w...

T*ε – Bounded-Suboptimal Efficient Motion Planning for Minimum-Time Planar Curvature-Constrained Systems

We consider the problem of finding collision-free paths for curvature-co...

ePA*SE: Edge-based Parallel A* for Slow Evaluations

Parallel search algorithms harness the multithreading capability of mode...

A-ePA*SE: Anytime Edge-Based Parallel A* for Slow Evaluations

Anytime search algorithms are useful for planning problems where a solut...

Incremental Clustering and Expansion for Faster Optimal Planning in Dec-POMDPs

This article presents the state-of-the-art in optimal solution methods f...

Please sign up or login with your details

Forgot password? Click here to reset