Other Links:
|
TAStarPathPlanner
Quick Start:
Notes: The "Find Path" Button does NOT use A* and does not consider the cost of terrain, it finds the shortest distance path avoiding walls. Programming Notes: This implementation of A* uses a TStringList to implement the priority queue (by setting the string to the priority). Changing the priority queue to use a heap speeds up the algorithms significantly and makes it usable for large maps (such as using image maps on the Bitmap tab). Generalizing the heap priority queue A* algorithm to use interfaces (such as an IMap and ILocation) makes it a 6 times slower. Finally, using LOTS of walls or other impassable terrain makes A* MUCH faster (it is understandable why Age of Empires has impassable forests :) ).
Version History for Path Planning |
Send mail to
webmasterNO@SPAMRiverSoftAVG.com with questions or comments about this web
site. |