D* search algorithm

From Wikipedia, the free encyclopedia

In computer science and robotics, the D* algorithm (pronounced "D star") is a dynamic version of the backward variant of Dijkstra's algorithm and A* search algorithm. Also known as Stentz's Algorithm, it was first developed by Anthony Stentz in 1994. [1] It is widely used in vehicle navigation applications.

[edit] References

  1. ^ Stentz, A. (1994). "Optimal and efficient path planning for partially-knownenvironments". Robotics and Automation, 1994. Proceedings., 1994 IEEE International Conference on: 3310-3317.