Author:
Mandava Ravi Kumar,Bondada Sukesh,Vundavilli Pandu R.
Reference13 articles.
1. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)
2. Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. SSC4 4(2), 100–107 (1968)
3. Anthony, S.: Optimal and efficient path planning for partially-known environments. In: Proceedings of the International Conference on Robotics and Automation, pp. 3310–3317 (1994)
4. Koenig, S., Likhachev, M., Furcy, D.: Lifelong planning A*. Artif. Intell. J. 155(1–2), 93–146 (2004)
5. LaValle, S.M.: Rapidly-exploring random trees: a new tool for path planning. Technical Report, Computer Science Department, Iowa State University, 98-11 (1998)
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献