Issue No. 06 - November/December (2002 vol. 14)
<p><b>Abstract</b>—A* graph search effectively computes the optimal solution path from start nodes to goal nodes in a graph, using a heuristic function. In some applications, the graph may change slightly in the course of its use and the solution path then needs to be updated. Very often, the new solution will differ only slightly from the old. Rather than perform the full A* on the new graph, we compute the necessary <ss>OPEN</ss> nodes from which the revised solution can be obtained by A*. In this "Differential A*" algorithm, the graph topology, transition costs, or start/goals may change simultaneously. We develop the algorithm and discuss when it gives an improvement over simply reapplying A*. We briefly discuss an application to robot path planning in configuration space, where such graph changes naturally arise.</p>
Graph search, uniform cost search, a-star search, A* search, optimal navigation, incremental graph changes, dynamic scheduling, dynamic routing, robot path planning.
Leo Dorst, Karen I. Trovato, "Differential A*", IEEE Transactions on Knowledge & Data Engineering, vol. 14, no. , pp. 1218-1229, November/December 2002, doi:10.1109/TKDE.2002.1047763