D*lite
By Sven Koenig, Maxim Likhachev. AAAI/IAAI, 2002
865 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/89d487427c6614e033544d33a161a6f8da1d984a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Sergey Levine
- Pieter Abbeel
- Vladlen Koltun
- Dmytro Mishkin
- Alexey Dosovitskiy
- Jitendra Malik
- Chelsea Finn
- Abhinav Kumar Gupta
Citations in the corpus
- Multipartite RRTs for Rapid Replanning in Dynamic Environments (2007, methodology): “Dynamic programming based approaches such as D* [1] and D*-Lite [2] are dynamic extensions of the A* algorithm which perform minimal modifications to a previous search tree in order to maintain an optimal path.”
- 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].”
- Benchmarking Classic and Learned Navigation in Complex 3D Environments (2019, methodology): “We employ the D* Lite algorithm [27] that is specifically designed to perform efficiently in this dynamic scenario.”
- Differentially constrained mobile robot motion planning in state lattices (2009, methodology): “Our approach incorporates efficient replanning by reusing previous computation via the D * search algorithm and its variants (Koenig & Likhachev, 2002; Stentz, 1995).”
- A Survey of Real-Time Strategy Game AI Research and Competition in StarCraft (2013, unknown): “Even if specialized algorithms, such as D*-Lite [59]”
- Planning algorithms (2006, background): “For more on Stentz’s algorithm and related work, see [546, 914].”
- A constrained A* approach towards optimal path planning for an unmanned surface vehicle in a maritime environment containing dynamic obstacles and ocean currents (2018, background): “, 2007) and D* Lite (Koenig and Likhachev, 2002) has been conducted.”
- Using interpolation to improve path planning: The Field D* algorithm (2006, methodology): “• DOI: 10.1002/rob.20109 cremental A*, and D* Lite are extensions of A* that incrementally repair solution paths when changes occur in the underlying graph Stentz, 1995; Koenig & Likhachev, 2002a, b, c .”