|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||
See:
Description
| Interface Summary | |
|---|---|
| AStarGoal | This class defines the goal of A* algorithm, it affects how the A* works. |
| AStarMap | This class represents the search space for A* algorithm 1) we need to know which neighbours the node has 2) we need to know the travel cost between two nodes (edge cost) |
| Class Summary | |
|---|---|
| AStar | ======================================================== This file holds implementation of generic A* algorithm, better refered to as A* Machine according to Dan Higgins, Generic A* Pathfind, AI Gaming Wisdom, 2002 ======================================================== What is A* ---------- A* is space-search algorithm using a custom-built heuristic. |
| AStarHeap | This is Heap used by AStar algorithm. |
| AStarHeapComparator | |
| AStarHeapIterator | Clasical iterator for AStarHeap. |
| AStarResult | This class is returned by AStar.aStar(). |
Implementation of A* path search algorithm. Bots can use A* for navigation.
|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||