| Class | Description |
|---|---|
| AnnealedTSPSearchPlanner |
Class that uses a simulated annealing approach to producing
a solution to the TSP problem that represents a series of
waypoints in a search pattern.
|
| AStarSearchPlanner |
Class that will use the A* search algorithm to compute a series of waypoints that will
search a geographic area with a prescribed probability of detection
|
| BestFirstSearchPlan |
Contains an area search plan computed using an A* search
|
| BestFirstSearchPlanner |
Class that will use the Best First search algorithm to compute a series of waypoints that will
search a geographic area with a prescribed probability of detection
|
| BestFirstSearchPlanStep |
Represents a step in a search plan.
|
| BestFirstSearchWorldState |
Represents the state of the world at various stages of a search.
|
| BreadthFirstSearchPlan |
Contains an area search plan computed using an breadth-first search
|
| BreadthFirstSearchPlanner |
Class that will use the Breadth First search algorithm to compute a series of waypoints
that will search a geographic area with a prescribed probability of detection
|
| BreadthFirstSearchPlanStep |
Represents a step in a breadth-first search plan.
|
| BreadthFirstSearchWorldState |
Represents the state of the world at various stages of a search.
|
| ExpandingRectangleSearchPlanner |
Used to plan an expanding square search pattern
|
| ExpandingSquareSearchPlanner |
Used to plan an expanding square search pattern
|
| GraphPlanSearchPlanner |
Class that will use the GraphPlan search algorithm to compute a series of
waypoints that will search a geographic area with a prescribed probability of detection.
|
| ListSearchPlanner |
Class that will use discrete relaxation to compute a series
of waypoints that will search a geographic area with a
prescribed probability of detection
|
| ParallelTrackSearchPlanner |
Used to plan a creeping line search pattern
|
| PrunedAStarSearchPlanner |
Class that will use the Best First search algorithm to compute a series of waypoints that will
search a geographic area with a prescribed probability of detection
|
| SearchPatternPlanner |
Class that will use the A* search algorithm to compute a series of waypoints that will
search a geographic area with a prescribed probability of detection
|
| SearchPlan |
Contains an area search plan computed using an A* search
|
| SearchPlanStep |
Represents a step in a search plan.
|
| SearchTrackPlanner |
Abstract class used to generate a series of waypoints for a search
|
| SearchWorldState |
Represents the state of the world at various stages of a search.
|
| SectorPatternSearchPlanner |
Used to plan an expanding square search pattern
|
| ShrinkingSquareSearchPlanner |
Used to plan a shrinking square search pattern (oposite of an expanding square)
|
| TrackedSearchPlanner |
Abstract class used for search pattern planners that require
equally spaced legs based on the required PD
|
| TSPSearchPlanner |
Class that will use iterative improvement to a traveling salesman problem
solution to compute a series of waypoints that will search a geographic
area with a prescribed probability of detection
|