A* algorithm tutorial
Sep, 2001 - Justin Heyes-Jones
A very good introduction to the A* algorithm. Toward More Realistic Pathfinding
March 2001 - Marco Pinter
This article goes over some modifications to A* that can help making movements a little more realistic. It mentions a couple of optimizations for the algorithm. It also explains how to take into account the turning radius when searching for a path. Optimal and Efficient Path Planning for Partially-Known Environments
1994 - Anthony Stentz
This article is about the D* algorithm. D* is short for dynamic A*, and is designed to handle the problem where path costs change as you traverse the path. The Focused D* Algorithm for Real-Time Replanning
Aug 1995 - Anthony Stentz
This article shows how the D* algorithm can be improved by focusing the replanning around the position of the agent. Amit's Thoughts on Path-Finding
Nov 2001 - Amit J Patel
This page has plenty of interesting tips and ideas on how to improve your path-finding algorithm. Fast Pathfinding via Symmetry Breaking
Feb, 2012 - Daniel Harabor
Very effective, yet simple, algorithm to reduce the amount of work performed by A* algorithms for path finding. |