Fetching the paper…
Reading the bibliography…
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.
A formal basis for the heuristic determination of minimum cost paths
P. E. Hart, N. J. Nilsson, and B. Raphael · 1968
Earlier work this paper cites.
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
L. E. Kavraki, P. Svestka, J. Latombe, and M. H. Overmars · 1996
Earlier work this paper cites.
An incremental algorithm for a generalization of the shortest-path problem
G. Ramalingam and T. Reps · 1996
Earlier work this paper cites.
Rapidly-exploring random trees: A new tool for path planning
S. M. Lavalle · 1998
Earlier work this paper cites.
Path planning using lazy PRM
R. Bohlin and L. E. Kavraki · 2000
Earlier work this paper cites.
Randomized kinodynamic planning
S. M. LaValle and J. J. Kuffner · 2001
Earlier work this paper cites.
Lifelong planning A*
S. Koenig, M. Likhachev, and D. Furcy · 2003
Earlier work this paper cites.
Fast replanning for navigation in unknown terrain
S. Koenig and M. Likhachev · 2004
Earlier work this paper cites.
A Generalized A* Algorithm for Finding Globally Optimal Paths in Weighted Colored Graphs
J. Lim and P. Tsiotras · 2012
Cited alongside, same era.
The Open Motion Planning Library
I. A. Şucan, M. Moll, and L. E. Kavraki · 2012
Cited alongside, same era.
Use of relaxation methods in sampling-based algorithms for optimal motion planning
O. Arslan and P. Tsiotras · 2013
Cited alongside, same era.
Kinodynamic RRT*: Asymptotically optimal motion planning for robots with linear dynamics
D. J. Webb and J. van den Berg · 2013
Cited alongside, same era.
Planning single-arm manipulations with n-arm robots
B. Cohen, M. Phillips, and M. Likhachev · 2014
Cited alongside, same era.
Reducing the barrier to entry of complex robotic software: a MoveIt! case study
Batch informed trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs
J. D. Gammell, S. S. Srinivasa, and T. D. Barfoot · 2015
Later among the works it cites.
Lazy collision checking in asymptotically-optimal motion planning
K. Hauser · 2015
Later among the works it cites.
Truncated incremental search
S. Aine and M. Likhachev · 2016
Later among the works it cites.
A unifying formalism for shortest path problems with expensive edge evaluations via lazy best-first search over paths with edge selectors
C. M. Dellin and S. S. Srinivasa · 2016
Later among the works it cites.
Lazy receding horizon A* for efficient path planning in graphs with expensive-to-evaluate edges
A. Mandalika, O. Salzman, and S. S. Srinivasa · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
D. Coleman, I. A. Şucan, S. Chitta, and N. Correll · 2014
Cited alongside, same era.
Distributed heuristic forward search for multi-agent planning
R. Nissim and R. Brafman · 2014
Cited alongside, same era.
FMAP: Distributed cooperative multi-agent planning
A. Torreño, E. Onaindia, and Ó. Sapena · 2014
Cited alongside, same era.
MAMS-A*: Multi-agent multi-scale A*
J. Lim and P. Tsiotras
Cited in the paper.
Advanced BIT* (ABIT*): Sampling-based planning with advanced graph-search techniques
M. P. Strub and J. D. Gammell
Cited in the paper.
Generalized lazy search for robot motion planning: Interleaving search and edge evaluation via event-based toggles
A. Mandalika, S. Choudhury, O. Salzman, and S. S. Srinivasa · 2019
Later among the works it cites.
Adaptively informed trees (AIT*): Fast asymptotically optimal path planning through adaptive heuristics
M. P. Strub and J. D. Gammell · 2020
Later among the works it cites.