- A Note on Two Problems in Connexion with Graphs by Dijkstra
- A Formal Basis for the Heuristic Determination of Minimum Cost Paths by Hart
- On the complexity of admissible search algorithms by Martelli
- Heuristic Search Viewed as Path Finding in a Graph by Pohl
- R* Search by Likhachev abd Stentz
- Incremental A* by Koenig and Likhachev
- Lifelong planning A* by Koenig, Likhachev a
willcmc
/ planning-papers.md
Created
April 5, 2020 14:31
— forked from tejus-gupta/planning-papers.md