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

UAStar.pas

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．