When choosing a function for this algorithm, using the Manhattan distance or L1 norm will make this algorithm "inadmissible," (*) meaning that it is not guaranteed to provide an optimal result.
Anthony Stentz developed a version of this algorithm in which nodes can be marked with the keywords RAISE or LOWER. Sven Koenig developed the so-called "Lifelong Planning" variant of this algorithm, which combines its informed methodology with an incremental planning approach, such as iterative deepening. When choosing a function for this algorithm, using the Manhattan distance or L1 norm will make this algorithm "inadmissible," (*) meaning that it is not guaranteed to provide an optimal result. This algorithm, which is favored when the topology of the search space or general direction of travel is known, combines a knowledge function and a heuristic function. When this algorithm has a heuristic function that is set equal to zero, it reduces to Dijkstra's algorithm. For 10 points, name this pathfinding algorithm named for a letter
Anthony Stentz developed a version of this algorithm in which nodes can be marked with the keywords RAISE or LOWER.
A* algorithm [accept D* before "incremental"]