|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||
See:
Description
| Interface Summary | |
|---|---|
| NavigationMesh | A navigation mesh is a set of nodes covering a map area which represent branching pathways for the vehicle to move from one location to another. |
| PathFinder | This class creates a set of waypoints connected by straight lines that lead from one location to another without colliding with mapped geometry. |
| SearchAlgorithm | An interface for defining generic node search algorithms. |
| Class Summary | |
|---|---|
| AstarSearchAlgorithm | This is an implementation of the A* search algorithm. |
| DijkstraPathFinder | This class calculates the shortest path from a starting point to a finish point. |
| FourWayGridMesh | Generates a grid of nodes. |
| GridNode | |
| Node | This class represents a Node which can be connected to other neighboring nodes. |
| NodePathFinder | This path finder class uses one of the common search algorithms (e.g. |
| Path | Represents a path consisting of an ordered collection of waypoints |
| RandomPathFinder | PathFinder that takes a map and a dummy set of range readings. |
| RandomSelfGeneratingNode | This Node is able to randomly generate its own neighbors via the getNeighbors() method. |
| ShortestPathFinder | This class calculates the shortest path from a starting point to a finish point. |
Path finding classes.
|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||