Lifelong Planning A

By Sven Koenig, Maxim Likhachev, David Furcy. Artificial Intelligence, 2004

756 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Signal Processing

View Paper: https://www.semanticscholar.org/paper/e4481d5f8a3a06caafa1a8eebb4cfacb66ad6004

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Networks and Communications

In Signal Processing

Citations in the corpus

Path Planning for Autonomous Mobile Robots: A Review (2021, methodology): “This was taken into account as a reference to produce a much simpler version of D* called D*-Lite [164,165].”
Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs (2014, background): “Recently, Salzman and Halperin [30] have given FMT* quasi-anytime performance by independently solving increasingly dense RGGs in their MPLB algorithm.”
Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic (2014, methodology): “Arslan and Tsiotras [18] use a graph structure and lifelong planning A* (LPA*) [19] techniques in the RRT# algorithm to prune the existing graph.”
Fast Marching Tree: a Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions (2013, neutral): “However, RRT# grows the tree in a fundamentally different way, by interleaving the addition of new nodes and corresponding edges to the graph with a Gauss–Seidel relaxation of the Bellman equation (1); it is essentially the same relaxation used in the LPA* algorithm (Koenig et al., 2004).”
Assistive teleoperation of robot arms via automatic time-optimal mode switching (2016, neutral): “Our preliminary results on approximate algorithms like Weighted A* and LPA* [30] which trade-off optimality for speed, have been encouraging.”
Rapidly-exploring Random Belief Trees for motion planning under uncertainty (2011, methodology): “[17], however that algorithm is used for deterministic queries, and our search techniques make direct use of covariance propagation properties.”
Fast replanning for navigation in unknown terrain (2005, methodology): “These optimizations are similar to the optimizations for [20].”