- D* search algorithm
In

computer science androbotics , the**D* algorithm**(pronounced "D star") is a dynamic version of the backward variant ofDijkstra's algorithm andA* search algorithm . Also known as Stentz's Algorithm, it was first developed byAnthony Stentz in1994 . cite conference

author = Stentz, A.

year = 1994

title = Optimal and efficient path planning for partially-knownenvironments

conference =

booktitle = Robotics and Automation, 1994. Proceedings., 1994 IEEE International Conference on

pages = 3310-3317

publisher =

url = http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=351061

conferenceurl = ] It is widely used in vehicle navigation applications.http://www.frc.ri.cmu.edu/projects/mars/publications.html#path_planning

**References**

*Wikimedia Foundation.
2010.*

### Look at other dictionaries:

**Search algorithm**— In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer… … Wikipedia**search algorithm**— paieškos algoritmas statusas T sritis automatika atitikmenys: angl. search algorithm vok. Suchalgorithmus, m rus. алгоритм поиска, m pranc. algorithme de recherche, m … Automatikos terminų žodynas**A* search algorithm**— In computer science, A* (pronounced A star ) is a best first, graph search algorithm that finds the least cost path from a given initial node to one goal node (out of one or more possible goals). It uses a distance plus cost heuristic function… … Wikipedia**Binary search algorithm**— for performing binary searches on Java arrays and Lists, respectively. They must be arrays of primitives, or the arrays or Lists must be of a type that implements the Comparable interface, or you must specify a custom Comparator object. Microsoft … Wikipedia**B* search algorithm**— In computer science, B* (pronounced B star ) is a best first, graph search algorithm that finds the least cost path from a given initial node to one goal node (out of one or more possible goals). First published by Hans Berliner in 1979, it is… … Wikipedia**Deducting Search Algorithm**— The Deducting Search Algorithm (DSA), also known as the Holmes Engine after the author Sir Arthur Conan Doyle’s famous sleuth, is a mathematical formula that interprets the choices made by the seeker whilst looking for a particular piece of… … Wikipedia**Rabin-Karp string search algorithm**— The Rabin Karp algorithm is a string searching algorithm created by Michael O. Rabin and Richard M. Karp in 1987 that uses hashing to find a substring in a text. It is used for multiple pattern matching rather than single pattern matching. For… … Wikipedia**Boyer–Moore string search algorithm**— The Boyer–Moore string search algorithm is a particularly efficient string searching algorithm, and it has been the standard benchmark for the practical string search literature. [Hume and Sunday (1991) [Fast String Searching] SOFTWARE PRACTICE… … Wikipedia**algorithm**— UK US /ˈælgərɪðəm/ noun [C] IT ► a set of mathematical instructions that must be followed in a fixed order, and that, especially if given to a computer, will help to calculate an answer to a mathematical problem: a computer/mathematical/search… … Financial and business terms**Search optimization**— may refer to:*Search algorithm *Search engine *Search engine optimization … Wikipedia