Description: This is a routing algorithm A* a package. The use of very simple: 1. Specified routing region size (grid) 2. Specify which node is the barrier 3. Given the starting point and the goal node node, routing ! will return the shortest path. In addition, obstacles encountered can be set only when the angle go around obstructions
File list (Check if you may need any files):
UAStar.pas