Bench-MR
A Motion Planning Benchmark for Wheeled Mobile Robots
ThetaStarSearch< UserState > Member List

This is the complete list of members for ThetaStarSearch< UserState >, including all inherited members.

AddSuccessor(UserState &State)ThetaStarSearch< UserState >inlinevirtual
CancelSearch()ThetaStarSearch< UserState >inlinevirtual
EnsureMemoryFreed()ThetaStarSearch< UserState >inlinevirtual
FreeSolutionNodes()ThetaStarSearch< UserState >inlinevirtual
GetClosedListNext()ThetaStarSearch< UserState >inlinevirtual
GetClosedListNext(float &f, float &g, float &h)ThetaStarSearch< UserState >inlinevirtual
GetClosedListStart()ThetaStarSearch< UserState >inlinevirtual
GetClosedListStart(float &f, float &g, float &h)ThetaStarSearch< UserState >inlinevirtual
GetCurrentBestRawNode()ThetaStarSearch< UserState >inline
GetOpenListNext()ThetaStarSearch< UserState >inlinevirtual
GetOpenListNext(float &f, float &g, float &h)ThetaStarSearch< UserState >inlinevirtual
GetOpenListStart()ThetaStarSearch< UserState >inlinevirtual
GetOpenListStart(float &f, float &g, float &h)ThetaStarSearch< UserState >inlinevirtual
GetSolutionCost()ThetaStarSearch< UserState >inlinevirtual
GetSolutionEnd()ThetaStarSearch< UserState >inlinevirtual
GetSolutionNext()ThetaStarSearch< UserState >inlinevirtual
GetSolutionPrev()ThetaStarSearch< UserState >inlinevirtual
GetSolutionStart()ThetaStarSearch< UserState >inlinevirtual
GetStepCount()ThetaStarSearch< UserState >inlinevirtual
m_connectGrandParentThetaStarSearch< UserState >
m_euclideanCostThetaStarSearch< UserState >
m_useAstarThetaStarSearch< UserState >
SEARCH_STATE_FAILED enum valueThetaStarSearch< UserState >
SEARCH_STATE_INVALID enum valueThetaStarSearch< UserState >
SEARCH_STATE_NOT_INITIALISED enum valueThetaStarSearch< UserState >
SEARCH_STATE_OUT_OF_MEMORY enum valueThetaStarSearch< UserState >
SEARCH_STATE_SEARCHING enum valueThetaStarSearch< UserState >
SEARCH_STATE_SUCCEEDED enum valueThetaStarSearch< UserState >
SearchStep()ThetaStarSearch< UserState >inlinevirtual
SetStartAndGoalStates(UserState &Start, UserState &Goal)ThetaStarSearch< UserState >inlinevirtual
ThetaStarSearch()ThetaStarSearch< UserState >inline
ThetaStarSearch(bool euclideanCostChoice)ThetaStarSearch< UserState >inline
ThetaStarSearch(int MaxNodes)ThetaStarSearch< UserState >inline
UpdateVertex(Node *n, Node *successor)ThetaStarSearch< UserState >inlinevirtual
UpdateVertexGrandParent(Node *n, Node *successor)ThetaStarSearch< UserState >inlinevirtual
use_connectGrandParent()ThetaStarSearch< UserState >inlinevirtual
useAstar()ThetaStarSearch< UserState >inlinevirtual