A* search algorithm · Lablypedia

One major practical drawback is its $O (b^{d})$ space complexity where d is the depth of the shallowest solution (the length of the shortest path from the source node to any given goal node) and b is the branching factor (the maximum number of successors for any given state). In practical travel-routing systems, it is generally outperformed by algorithms that can pre-process the graph to attain better performance, as well as by memory-bounded approaches; however, A* is still the best solution in many cases.

Peter Hart, Nils Nilsson and Bertram Raphael of Stanford Research Institute (now SRI International) first published the algorithm in 1968. It can be seen as an extension of Dijkstra's algorithm. A* achieves better performance by using heuristics to guide its search.

The A* algorithm terminates once it finds the shortest path to a specified goal, rather than generating the entire shortest-path tree from a specified source to all possible goals.

History

A* was created as part of the Shakey project, which had the aim of building a mobile robot that could plan its own actions. Nils Nilsson originally proposed using the Graph Traverser algorithm for Shakey's path planning. Graph Traverser is guided by a heuristic function h(n), the estimated distance from node n to the goal node: it entirely ignores g(n), the distance from the start node to n. Bertram Raphael suggested using the sum, g(n) + h(n). Peter Hart invented the concepts we now call admissibility and consistency of heuristic functions. A* was originally designed for finding least-cost paths when the cost of a path is the sum of its costs, but it has been shown that A* can be used to find optimal paths for any problem satisfying the conditions of a cost algebra.

The original 1968 A* paper contained a theorem stating that no A*-like algorithm could expand fewer nodes than A* if the heuristic function is consistent and A*'s tie-breaking rule is suitably chosen. A "correction" was published a few years later claiming that consistency was not required, but this was shown to be false in 1985 in Dechter and Pearl's definitive study of A*'s optimality (now called optimal efficiency), which gave an example of A* with a heuristic that was admissible but not consistent expanding arbitrarily more nodes than an alternative A*-like algorithm.

7 more chapters are free with a Lably account.

Description

A* is an informed search algorithm, or a best-first search, meaning that it is formulated in terms of weighted graphs: starting from a specific starting node of a graph, it aims to find a path to the given goal node having the smallest cost (least distance travelled, shortest time, etc.). It does this by maintaining a tree of paths originating at the start node and extending those paths one edge at a time until the goal node is reached.

At each iteration of its main loop, A* needs to determine which of its paths to extend. It does so based on the cost of the path and an estimate of the cost required to extend the path all the way to the goal. Specifically, A* selects the path that minimizes

f (n) = g (n) + h (n)

where n is the next node on the path, g(n) is the cost of the path from the start node to n, and h(n) is a heuristic function that estimates the cost of the cheapest path from n to the goal. The heuristic function is problem-specific.

Typical implementations of A* use a priority queue to perform the repeated selection of minimum (estimated) cost nodes to expand. This priority queue is known as the open set, fringe or frontier. At each step of the algorithm, the node with the lowest f(x) value is removed from the queue, the f and g values of its neighbors are updated accordingly, and these neighbors are added to the queue. The algorithm continues until a removed node (thus the node with the lowest f value out of all fringe nodes) is a goal node. The f value of that goal is then also the cost of the shortest path, since h at the goal is zero in an admissible heuristic.

The algorithm described so far only gives the length of the shortest path. To find the actual sequence of steps, the algorithm can be easily revised so that each node on the path keeps track of its predecessor. After this algorithm is run, the ending node will point to its predecessor, and so on, until some node's predecessor is the start node.

As an example, when searching for the shortest route on a map, h(x) might represent the straight-line distance to the goal, since that is physically the smallest possible distance between any two points. For a grid map from a video game, using the Taxicab distance or the Chebyshev distance becomes better depending on the set of movements available (4-way or 8-way).

If the heuristic h satisfies the additional condition h(x) ≤ d(x, y) + h(y) for every edge (x, y) of the graph (where d denotes the length of that edge), then h is called monotone, or consistent. With a consistent heuristic, A* is guaranteed to find an optimal path without processing any node more than once and A* is equivalent to running Dijkstra's algorithm with the reduced cost d'(x, y) = d(x, y) + h(y) − h(x).

Pseudocode

The following pseudocode describes the algorithm:

<span id="mwpw"></span><span class="k" id="mwqA">function</span><span class="w" id="mwqQ"> </span><span class="nf" id="mwqg">reconstruct_path</span><span class="p" id="mwqw">(</span><span class="n" id="mwrA">came_from</span><span class="o" id="mwrQ">,</span><span class="w" id="mwrg"> </span><span class="n" id="mwrw">current</span><span class="p" id="mwsA">)</span> <span class="w" id="mwsQ"> </span><span class="n" id="mwsg">total_path</span><span class="w" id="mwsw"> </span><span class="o" id="mwtA">:=</span><span class="w" id="mwtQ"> </span><span class="cm" id="mwtg">{current}</span> <span class="w" id="mwtw"> </span><span class="k" id="mwuA">while</span><span class="w" id="mwuQ"> </span><span class="n" id="mwug">current</span><span class="w" id="mwuw"> </span><span class="k" id="mwvA">in</span><span class="w" id="mwvQ"> </span><span class="n" id="mwvg">came_from</span><span class="o" id="mwvw">.</span><span class="n" id="mwwA">keys</span><span class="o" id="mwwQ">:</span> <span class="w" id="mwwg"> </span><span class="n" id="mwww">current</span><span class="w" id="mwxA"> </span><span class="o" id="mwxQ">:=</span><span class="w" id="mwxg"> </span><span class="n" id="mwxw">came_from</span><span class="p" id="mwyA">[</span><span class="n" id="mwyQ">current</span><span class="p" id="mwyg">]</span> <span class="w" id="mwyw"> </span><span class="n" id="mwzA">total_path</span><span class="o" id="mwzQ">.</span><span class="n" id="mwzg">prepend</span><span class="p" id="mwzw">(</span><span class="n" id="mw0A">current</span><span class="p" id="mw0Q">)</span> <span class="w" id="mw0g"> </span><span class="n" id="mw0w">return</span><span class="w" id="mw1A"> </span><span class="n" id="mw1Q">total_path</span> <span class="c1" id="mw1g">// A* finds a path from start to goal.</span> <span class="c1" id="mw1w">// h is the heuristic function. h(n) estimates the cost to reach goal from node n.</span> <span class="k" id="mw2A">function</span><span class="w" id="mw2Q"> </span><span class="nf" id="mw2g">a_star</span><span class="p" id="mw2w">(</span><span class="n" id="mw3A">start</span><span class="o" id="mw3Q">,</span><span class="w" id="mw3g"> </span><span class="n" id="mw3w">goal</span><span class="o" id="mw4A">,</span><span class="w" id="mw4Q"> </span><span class="n" id="mw4g">h</span><span class="p" id="mw4w">)</span> <span class="w" id="mw5A"> </span><span class="c1" id="mw5Q">// The set of discovered nodes that may need to be (re-)expanded.</span> <span class="w" id="mw5g"> </span><span class="c1" id="mw5w">// Initially, only the start node is known.</span> <span class="w" id="mw6A"> </span><span class="c1" id="mw6Q">// This is usually implemented as a min-heap or priority queue rather than a hash-set.</span> <span class="w" id="mw6g"> </span><span class="n" id="mw6w">open_set</span><span class="w" id="mw7A"> </span><span class="o" id="mw7Q">:=</span><span class="w" id="mw7g"> </span><span class="cm" id="mw7w">{start}</span> <span class="w" id="mw8A"> </span><span class="c1" id="mw8Q">// For node n, came_from[n] is the node immediately preceding it on the cheapest path from the start</span> <span class="w" id="mw8g"> </span><span class="c1" id="mw8w">// to n currently known.</span> <span class="w" id="mw9A"> </span><span class="n" id="mw9Q">came_from</span><span class="w" id="mw9g"> </span><span class="o" id="mw9w">:=</span><span class="w" id="mw-A"> </span><span class="n" id="mw-Q">an</span><span class="w" id="mw-g"> </span><span class="n" id="mw-w">empty</span><span class="w" id="mw_A"> </span><span class="n" id="mw_Q">map</span> <span class="w" id="mw_g"> </span><span class="c1" id="mw_w">// For node n, g_score[n] is the currently known cost of the cheapest path from start to n.</span> <span class="w" id="mwAQA"> </span><span class="n" id="mwAQE">g_score</span><span class="w" id="mwAQI"> </span><span class="o" id="mwAQM">:=</span><span class="w" id="mwAQQ"> </span><span class="n" id="mwAQU">map</span><span class="w" id="mwAQY"> </span><span class="k" id="mwAQc">with</span><span class="w" id="mwAQg"> </span><span class="kp" id="mwAQk">default</span><span class="w" id="mwAQo"> </span><span class="n" id="mwAQs">value</span><span class="w" id="mwAQw"> </span><span class="k" id="mwAQ0">of</span><span class="w" id="mwAQ4"> </span><span class="n" id="mwAQ8">Infinity</span> <span class="w" id="mwARA"> </span><span class="n" id="mwARE">g_score</span><span class="p" id="mwARI">[</span><span class="n" id="mwARM">start</span><span class="p" id="mwARQ">]</span><span class="w" id="mwARU"> </span><span class="o" id="mwARY">:=</span><span class="w" id="mwARc"> </span><span class="mi" id="mwARg">0</span> <span class="w" id="mwARk"> </span><span class="c1" id="mwARo">// For node n, f_score[n] := g_score[n] + h(n). f_score[n] represents our current best guess as to</span> <span class="w" id="mwARs"> </span><span class="c1" id="mwARw">// how cheap a path could be from start to finish if it goes through n.</span> <span class="w" id="mwAR0"> </span><span class="n" id="mwAR4">f_score</span><span class="w" id="mwAR8"> </span><span class="o" id="mwASA">:=</span><span class="w" id="mwASE"> </span><span class="n" id="mwASI">map</span><span class="w" id="mwASM"> </span><span class="k" id="mwASQ">with</span><span class="w" id="mwASU"> </span><span class="kp" id="mwASY">default</span><span class="w" id="mwASc"> </span><span class="n" id="mwASg">value</span><span class="w" id="mwASk"> </span><span class="k" id="mwASo">of</span><span class="w" id="mwASs"> </span><span class="n" id="mwASw">Infinity</span> <span class="w" id="mwAS0"> </span><span class="n" id="mwAS4">f_score</span><span class="p" id="mwAS8">[</span><span class="n" id="mwATA">start</span><span class="p" id="mwATE">]</span><span class="w" id="mwATI"> </span><span class="o" id="mwATM">:=</span><span class="w" id="mwATQ"> </span><span class="n" id="mwATU">h</span><span class="p" id="mwATY">(</span><span class="n" id="mwATc">start</span><span class="p" id="mwATg">)</span> <span class="w" id="mwATk"> </span><span class="k" id="mwATo">while</span><span class="w" id="mwATs"> </span><span class="n" id="mwATw">open_set</span><span class="w" id="mwAT0"> </span><span class="k" id="mwAT4">is</span><span class="w" id="mwAT8"> </span><span class="k" id="mwAUA">not</span><span class="w" id="mwAUE"> </span><span class="n" id="mwAUI">empty</span> <span class="w" id="mwAUM"> </span><span class="c1" id="mwAUQ">// This operation can occur in O(Log(N)) time if open_set is a min-heap or a priority queue</span> <span class="w" id="mwAUU"> </span><span class="n" id="mwAUY">current</span><span class="w" id="mwAUc"> </span><span class="o" id="mwAUg">:=</span><span class="w" id="mwAUk"> </span><span class="n" id="mwAUo">the</span><span class="w" id="mwAUs"> </span><span class="n" id="mwAUw">node</span><span class="w" id="mwAU0"> </span><span class="k" id="mwAU4">in</span><span class="w" id="mwAU8"> </span><span class="n" id="mwAVA">open_set</span><span class="w" id="mwAVE"> </span><span class="n" id="mwAVI">having</span><span class="w" id="mwAVM"> </span><span class="n" id="mwAVQ">the</span><span class="w" id="mwAVU"> </span><span class="n" id="mwAVY">lowest</span><span class="w" id="mwAVc"> </span><span class="n" id="mwAVg">f_score</span><span class="p" id="mwAVk">[]</span><span class="w" id="mwAVo"> </span><span class="n" id="mwAVs">value</span> <span class="w" id="mwAVw"> </span><span class="k" id="mwAV0">if</span><span class="w" id="mwAV4"> </span><span class="n" id="mwAV8">current</span><span class="w" id="mwAWA"> </span><span class="o" id="mwAWE">=</span><span class="w" id="mwAWI"> </span><span class="n" id="mwAWM">goal</span> <span class="w" id="mwAWQ"> </span><span class="n" id="mwAWU">return</span><span class="w" id="mwAWY"> </span><span class="n" id="mwAWc">reconstruct_path</span><span class="p" id="mwAWg">(</span><span class="n" id="mwAWk">came_from</span><span class="o" id="mwAWo">,</span><span class="w" id="mwAWs"> </span><span class="n" id="mwAWw">current</span><span class="p" id="mwAW0">)</span> <span class="w" id="mwAW4"> </span><span class="n" id="mwAW8">open_set</span><span class="o" id="mwAXA">.</span><span class="n" id="mwAXE">remove</span><span class="p" id="mwAXI">(</span><span class="n" id="mwAXM">current</span><span class="p" id="mwAXQ">)</span> <span class="w" id="mwAXU"> </span><span class="k" id="mwAXY">for</span><span class="w" id="mwAXc"> </span><span class="n" id="mwAXg">each</span><span class="w" id="mwAXk"> </span><span class="n" id="mwAXo">neighbor</span><span class="w" id="mwAXs"> </span><span class="k" id="mwAXw">of</span><span class="w" id="mwAX0"> </span><span class="n" id="mwAX4">current</span> <span class="w" id="mwAX8"> </span><span class="c1" id="mwAYA">// d(current,neighbor) is the weight of the edge from current to neighbor</span> <span class="w" id="mwAYE"> </span><span class="c1" id="mwAYI">// tentative_g_score is the distance from start to the neighbor through current</span> <span class="w" id="mwAYM"> </span><span class="n" id="mwAYQ">tentative_g_score</span><span class="w" id="mwAYU"> </span><span class="o" id="mwAYY">:=</span><span class="w" id="mwAYc"> </span><span class="n" id="mwAYg">g_score</span><span class="p" id="mwAYk">[</span><span class="n" id="mwAYo">current</span><span class="p" id="mwAYs">]</span><span class="w" id="mwAYw"> </span><span class="o" id="mwAY0">+</span><span class="w" id="mwAY4"> </span><span class="n" id="mwAY8">d</span><span class="p" id="mwAZA">(</span><span class="n" id="mwAZE">current</span><span class="o" id="mwAZI">,</span><span class="w" id="mwAZM"> </span><span class="n" id="mwAZQ">neighbor</span><span class="p" id="mwAZU">)</span> <span class="w" id="mwAZY"> </span><span class="k" id="mwAZc">if</span><span class="w" id="mwAZg"> </span><span class="n" id="mwAZk">tentative_g_score</span><span class="w" id="mwAZo"> </span><span class="o" id="mwAZs"><</span><span class="w" id="mwAZw"> </span><span class="n" id="mwAZ0">g_score</span><span class="p" id="mwAZ4">[</span><span class="n" id="mwAZ8">neighbor</span><span class="p" id="mwAaA">]</span> <span class="w" id="mwAaE"> </span><span class="c1" id="mwAaI">// This path to neighbor is better than any previous one. Record it!</span> <span class="w" id="mwAaM"> </span><span class="n" id="mwAaQ">came_from</span><span class="p" id="mwAaU">[</span><span class="n" id="mwAaY">neighbor</span><span class="p" id="mwAac">]</span><span class="w" id="mwAag"> </span><span class="o" id="mwAak">:=</span><span class="w" id="mwAao"> </span><span class="n" id="mwAas">current</span> <span class="w" id="mwAaw"> </span><span class="n" id="mwAa0">g_score</span><span class="p" id="mwAa4">[</span><span class="n" id="mwAa8">neighbor</span><span class="p" id="mwAbA">]</span><span class="w" id="mwAbE"> </span><span class="o" id="mwAbI">:=</span><span class="w" id="mwAbM"> </span><span class="n" id="mwAbQ">tentative_g_score</span> <span class="w" id="mwAbU"> </span><span class="n" id="mwAbY">f_score</span><span class="p" id="mwAbc">[</span><span class="n" id="mwAbg">neighbor</span><span class="p" id="mwAbk">]</span><span class="w" id="mwAbo"> </span><span class="o" id="mwAbs">:=</span><span class="w" id="mwAbw"> </span><span class="n" id="mwAb0">tentative_g_score</span><span class="w" id="mwAb4"> </span><span class="o" id="mwAb8">+</span><span class="w" id="mwAcA"> </span><span class="n" id="mwAcE">h</span><span class="p" id="mwAcI">(</span><span class="n" id="mwAcM">neighbor</span><span class="p" id="mwAcQ">)</span> <span class="w" id="mwAcU"> </span><span class="k" id="mwAcY">if</span><span class="w" id="mwAcc"> </span><span class="n" id="mwAcg">neighbor</span><span class="w" id="mwAck"> </span><span class="k" id="mwAco">not</span><span class="w" id="mwAcs"> </span><span class="k" id="mwAcw">in</span><span class="w" id="mwAc0"> </span><span class="n" id="mwAc4">open_set</span> <span class="w" id="mwAc8"> </span><span class="n" id="mwAdA">open_set</span><span class="o" id="mwAdE">.</span><span class="n" id="mwAdI">add</span><span class="p" id="mwAdM">(</span><span class="n" id="mwAdQ">neighbor</span><span class="p" id="mwAdU">)</span> <span class="w" id="mwAdY"> </span><span class="c1" id="mwAdc">// Open set is empty but goal was never reached</span> <span class="w" id="mwAdg"> </span><span class="n" id="mwAdk">return</span><span class="w" id="mwAdo"> </span><span class="n" id="mwAds">failure</span>

Remark: In this pseudocode, if a node is reached by one path, removed from open_set, and subsequently reached by a cheaper path, it will be added to open_set again. This is essential to guarantee that the path returned is optimal if the heuristic function is admissible but not consistent. If the heuristic is consistent, when a node is removed from open_set the path to it is guaranteed to be optimal so the test ‘tentative_g_score < g_score[neighbor]’ will always fail if the node is reached again. The pseudocode implemented here is sometimes called the graph-search version of A*. This is in contrast with the version without the ‘tentative_g_score < g_score[neighbor]’ test to add nodes back to open_set, which is sometimes called the tree-search version of A* and require a consistent heuristic to guarantee optimality.

Example

An example of an A* algorithm in action where nodes are cities connected with roads and h(x) is the straight-line distance to the target point:

Key: green: start; blue: goal; orange: visited

The A* algorithm has real-world applications. In this example, edges are railroads and h(x) is the great-circle distance (the shortest possible distance on a sphere) to the target. The algorithm is searching for a path between Washington, D.C., and Los Angeles.

Implementation details

There are a number of simple optimizations or implementation details that can significantly affect the performance of an A* implementation. The first detail to note is that the way the priority queue handles ties can have a significant effect on performance in some situations. If ties are broken so the queue behaves in a LIFO manner, A* will behave like depth-first search among equal cost paths (avoiding exploring more than one equally optimal solution).

When a path is required at the end of the search, it is common to keep with each node a reference to that node's parent. At the end of the search, these references can be used to recover the optimal path. If these references are being kept then it can be important that the same node doesn't appear in the priority queue more than once (each entry corresponding to a different path to the node, and each with a different cost). A standard approach here is to check if a node about to be added already appears in the priority queue. If it does, then the priority and parent pointers are changed to correspond to the lower-cost path. A standard binary heap based priority queue does not directly support the operation of searching for one of its elements, but it can be augmented with a hash table that maps elements to their position in the heap, allowing this decrease-priority operation to be performed in logarithmic time. Alternatively, a Fibonacci heap can perform the same decrease-priority operations in constant amortized time.

Special cases

Dijkstra's algorithm, as another example of a uniform-cost search algorithm, can be viewed as a special case of A* where ⁠ $h (x) = 0$ ⁠ for all x. General depth-first search can be implemented using A* by considering that there is a global counter C initialized with a very large value. Every time we process a node we assign C to all of its newly discovered neighbors. After every single assignment, we decrease the counter C by one. Thus the earlier a node is discovered, the higher its ⁠ $h (x)$ ⁠ value. Both Dijkstra's algorithm and depth-first search can be implemented more efficiently without including an ⁠ $h (x)$ ⁠ value at each node.

Properties

Termination and completeness

On finite graphs with non-negative edge weights A* is guaranteed to terminate and is complete, i.e. it will always find a solution (a path from start to goal) if one exists. On infinite graphs with a finite branching factor and edge costs that are bounded away from zero ( $d (x, y) > ε > 0$ for some fixed $ε$ ), A* is guaranteed to terminate only if there exists a solution.

Admissibility

A search algorithm is said to be admissible if it is guaranteed to return an optimal solution. If the heuristic function used by A* is admissible, then A* is admissible. An intuitive "proof" of this is as follows:

Call a node closed if it has been visited and is not in the open set. We close a node when we remove it from the open set. A basic property of the A* algorithm, which we'll sketch a proof of below, is that when ⁠ $n$ ⁠ is closed, ⁠ $f (n)$ ⁠ is an optimistic estimate (lower bound) of the true distance from the start to the goal. So when the goal node, ⁠ $g$ ⁠, is closed, ⁠ $f (g)$ ⁠ is no more than the true distance. On the other hand, it is no less than the true distance, since it is the length of a path to the goal plus a heuristic term.

Now we'll see that whenever a node ⁠ $n$ ⁠ is closed, ⁠ $f (n)$ ⁠ is an optimistic estimate. It is enough to see that whenever the open set is not empty, it has at least one node ⁠ $n$ ⁠ on an optimal path to the goal for which ⁠ $g (n)$ ⁠ is the true distance from start, since in that case ⁠ $g (n)$ ⁠ + ⁠ $h (n)$ ⁠ underestimates the distance to goal, and therefore so does the smaller value chosen for the closed vertex. Let ⁠ $P$ ⁠ be an optimal path from the start to the goal. Let ⁠ $p$ ⁠ be the last closed node on ⁠ $P$ ⁠ for which ⁠ $g (p)$ ⁠ is the true distance from the start to ⁠ $p$ ⁠ (the start is one such vertex). The next node in ⁠ $P$ ⁠ has the correct ⁠ $g$ ⁠ value, since it was updated when ⁠ $p$ ⁠ was closed, and it is open since it is not closed.

Optimality and consistency

Algorithm A is optimally efficient with respect to a set of alternative algorithms Alts on a set of problems P if for every problem P in P and every algorithm A′ in Alts, the set of nodes expanded by A in solving P is a subset (possibly equal) of the set of nodes expanded by A′ in solving P. The definitive study of the optimal efficiency of A* is due to Rina Dechter and Judea Pearl. They considered a variety of definitions of Alts and P in combination with A*'s heuristic being merely admissible or being both consistent and admissible. The most interesting positive result they proved is that A*, with a consistent heuristic, is optimally efficient with respect to all admissible A*-like search algorithms on all "non-pathological" search problems. Roughly speaking, their notion of the non-pathological problem is what we now mean by "up to tie-breaking". This result does not hold if A*'s heuristic is admissible but not consistent. In that case, Dechter and Pearl showed there exist admissible A*-like algorithms that can expand arbitrarily fewer nodes than A* on some non-pathological problems.

Optimal efficiency is about the set of nodes expanded, not the number of node expansions (the number of iterations of A*'s main loop). When the heuristic being used is admissible but not consistent, it is possible for a node to be expanded by A* many times, an exponential number of times in the worst case. In such circumstances, Dijkstra's algorithm could outperform A* by a large margin. However, more recent research found that this pathological case only occurs in certain contrived situations where the edge weight of the search graph is exponential in the size of the graph and that certain inconsistent (but admissible) heuristics can lead to a reduced number of node expansions in A* searches.

Bounded relaxation

While the admissibility criterion guarantees an optimal solution path, it also means that A* must examine all equally meritorious paths to find the optimal path. To compute approximate shortest paths, it is possible to speed up the search at the expense of optimality by relaxing the admissibility criterion. Oftentimes we want to bound this relaxation, so that we can guarantee that the solution path is no worse than (1 + ε) times the optimal solution path. This new guarantee is referred to as ε-admissible.

There are a number of ε-admissible algorithms:

Weighted A*/Static Weighting's. If h_a(n) is an admissible heuristic function, in the weighted version of the A* search one uses h_w(n) = ε h_a(n), ε > 1 as the heuristic function, and perform the A* search as usual (which eventually happens faster than using h_a since fewer nodes are expanded). The path hence found by the search algorithm can have a cost of at most ε times that of the least cost path in the graph.
Convex Upward/Downward Parabola (XUP/XDP). Modification to the cost function in weighted A* to push optimality toward the start or goal. XDP gives paths which are near optimal close to the start, and XUP paths are near-optimal close to the goal. Both yield $ϵ$ -optimal paths overall.
$f_{XDP} (n) = \frac{1}{2 ϵ} [g (n) + (2 ϵ - 1) + \sqrt{(g (n) - h (n))^{2} + 4 ϵ g (n) h (n)}]$ .
$f_{XUP} (n) = \frac{1}{2 ϵ} [g (n) + h (n) + \sqrt{(g (n) + h (n))^{2} + 4 ϵ (ϵ - 1) h (n)^{2}}]$ .
Piecewise Upward/Downward Curve (pwXU/pwXD). Similar to XUP/XDP but with piecewise functions instead of parabola. Solution paths are also $ϵ$ -optimal.
$f_{pwXD} (n) = {\begin{cases} g (n) + h (n), & if h (n) > g (n) \\ g (n) + (2 ϵ - 1) h (n) / ϵ, & if h (n) \leq g (n) \end{cases}$
$f_{pwXU} (n) = {\begin{cases} g (n) / (2 ϵ - 1) + h (n), & if g (n) < (2 ϵ - 1) h (n) \\ (g (n) + h (n)) / ϵ, & if g (n) \geq (2 ϵ - 1) h (n) \end{cases}$
Dynamic Weighting uses the cost function ⁠ $f (n) = g (n) + (1 + ε w (n)) h (n)$ ⁠, where $w (n) = {\begin{cases} 1 - \frac{d (n)}{N} & d (n) \leq N \\ 0 & otherwise \end{cases}$ , and where ⁠ $d (n)$ ⁠ is the depth of the search and N is the anticipated length of the solution path.
Sampled Dynamic Weighting uses sampling of nodes to better estimate and debias the heuristic error.
$A_{ε}^{*}$ . uses two heuristic functions. The first is the FOCAL list, which is used to select candidate nodes, and the second h_F is used to select the most promising node from the FOCAL list.
A_ε selects nodes with the function ⁠ $A f (n) + B h_{F} (n)$ ⁠, where A and B are constants. If no nodes can be selected, the algorithm will backtrack with the function ⁠ $C f (n) + D h_{F} (n)$ ⁠, where C and D are constants.
AlphA* attempts to promote depth-first exploitation by preferring recently expanded nodes. AlphA* uses the cost function $f_{α} (n) = (1 + w_{α} (n)) f (n)$ , where $w_{α} (n) = {\begin{cases} λ & g (π (n)) \leq g (\tilde{n}) \\ Λ & otherwise \end{cases}$ , where λ and Λ are constants with $λ \leq Λ$ , π(n) is the parent of n, and ñ is the most recently expanded node.

Complexity

As a heuristic search algorithm, the performance of A* is heavily influenced by the quality of the heuristic function $h (n)$ . If the heuristic closely approximates the true cost to the goal, A* can significantly reduce the number of node expansions. On the other hand, a poor heuristic can lead to many unnecessary expansions.

Worst case

In the worst case, A* expands all nodes $n$ for which $f (n) = g (n) + h (n) \leq C^{*}$ , where $C^{*}$ is the cost of the optimal goal node.

Why it cannot be worse

Suppose there is a node $N^{'}$ in the open list with $f (N^{'}) > C^{*}$ , and it's the next node to be expanded. Since the goal node has $f (g o a l) = g (g o a l) + h (g o a l) = g (g o a l) = C^{*}$ , and $f (N^{'}) > C^{*}$ , the goal node will have a lower f-value and will be expanded before $N^{'}$ . Therefore, A* never expands nodes with $f (n) > C^{*}$ .

Why it cannot be better

Assume there exists an optimal algorithm that expands fewer nodes than $C^{*}$ in the worst case using the same heuristic. That means there must be some node $N^{'}$ such that $f (N^{'}) < C^{*}$ , yet the algorithm chooses not to expand it.

Now consider a modified graph where a new edge of cost $ε$ (with $ε > 0$ ) is added from $N^{'}$ to the goal. If $f (N^{'}) + ε < C^{*}$ , then the new optimal path goes through $N^{'}$ . However, since the algorithm still avoids expanding $N^{'}$ , it will miss the new optimal path, violating its optimality.

Therefore, no optimal algorithm including A* could expand fewer nodes than $C^{*}$ in the worst case.

Mathematical notation

The worst-case complexity of A* is often described as $O (b^{d})$ , where $b$ is the branching factor and $d$ is the depth of the shallowest goal. While this gives a rough intuition, it does not precisely capture the actual behavior of A*.

A more accurate bound considers the number of nodes with $f (n) \leq C^{*}$ . If $ε$ is the smallest possible difference in $f$ -cost between distinct nodes, then A* may expand up to:

$O (\frac{C^{*}}{ε})$

This represents both the time and space complexity in the worst case.

Space complexity

The space complexity of A* is roughly the same as that of all other graph search algorithms, as it keeps all generated nodes in memory. In practice, this turns out to be the biggest drawback of the A* search, leading to the development of memory-bounded heuristic searches, such as Iterative deepening A*, memory-bounded A*, and SMA*.

Applications

A* is often used for the common pathfinding problem in applications such as video games, but was originally designed as a general graph traversal algorithm. It finds applications in diverse problems, including the problem of parsing using stochastic grammars in NLP. Other cases include an Informational search with online learning.

Relations to other algorithms

A* differs from a greedy best-first search algorithm in that it takes the cost/distance already traveled, g(n), into account.

Some common variants of Dijkstra's algorithm can be viewed as a special case of A* where the heuristic $h (n) = 0$ for all nodes; in turn, both Dijkstra and A* are special cases of dynamic programming. A* itself is a special case of a generalization of branch and bound.

A* is similar to beam search except that beam search maintains a limit on the numbers of paths that it has to explore.

Variants

Anytime A*
Block A*
D*
Field D*
Fringe
Fringe Saving A* (FSA*)
Generalized Adaptive A* (GAA*)
Incremental heuristic search
Reduced A*
Iterative deepening A* (IDA*)
Jump point search
Lifelong Planning A* (LPA*)
New Bidirectional A* (NBA*)
Simplified Memory bounded A* (SMA*)
Theta*

A* can also be adapted to a bidirectional search algorithm, but special care needs to be taken for the stopping criterion.