Pathfinder v2

A shortest path algorithm with external obstacle avoidance

A shortest path algorithm (based on Dijkstra's algorithm) with obstacle avoidance; the agent (robot) is represented as a single point, but the dimensions of the obstacles are inflated to account for the external dimensions of the agent. The shortest path is calculated so as to prevent collision between the agent and the obstacles.