Class List

Here are the classes, structs, unions and interfaces with brief descriptions:
AbstractSearchStateBase class for a search state
Adjacency
AdjacencyListSBPLEnv< Coords >SBPL Environment represented as an adjacency list graph
ADPlannerAnytime D* search planner: all states are uniquely defined by stateIDs
ADSEARCHSTATEDATAGeneric state structure in the search tree generated by AD*
ADSEARCHSTATESPACEStatespace of AD*
anaPlannerAna* planner
anaSEARCHSTATEDATAState structure used in ana* search tree
anaSEARCHSTATESPACEStatespace of ana*
ARAPlannerARA* planner
ARASEARCHSTATEDATAState structure used in ARA* search tree
ARASEARCHSTATESPACEStatespace of ARA*
BELIEFSTATEWITHBINARYHVALS
BINARYHIDDENVARIABLE
bresenham_param_t
CBucket
CELLV
CHeap
CIntHeap
CKey
CList
CMDP
CMDPACTION
CMDPSTATE
CSlidingBucket
DiscreteSpaceInformationBase class for environments defining planning graphs It is independent of the graph search used The main means of communication between environment and graph search is through stateID. Each state is uniquely defined by stateID and graph search is ONLY aware of stateIDs. It doesn't know anything about the actual state variables. Environment, on the other hand, maintains a mapping from stateID to actual state variables (coordinates) using StateID2IndexMapping array
ENV_NAV2D_CONFIG
ENV_NAV2DUU_CONFIG
ENV_NAVXYTHETALAT_CONFIG
ENV_ROBARM_CONFIG
ENV_XXX_CONFIG
ENVHASHENTRY
EnvironmentNAV2D2D (x,y) grid planning problem. For general structure see comments on parent class DiscreteSpaceInformation
EnvironmentNAV2D_t
EnvironmentNAV2DUUThis class is NOT fully yet implemented, please do not use it!
EnvironmentNAV2DUU_t
EnvironmentNAVXYTHETALAT
EnvironmentNAVXYTHETALAT_t
EnvironmentNAVXYTHETALATTICE3D (x,y,theta) planning using lattice-based graph problem. For general structure see comments on parent class DiscreteSpaceInformation For info on lattice-based planning used here, you can check out the paper: Maxim Likhachev and Dave Ferguson, " Planning Long Dynamically-Feasible Maneuvers for Autonomous Vehicles", IJRR'09
EnvironmentNAVXYTHETAMLEVLATThis is x,y,theta lattice planning but with multiple levels in z. In other words, it is for doing collision checking in 3D (x,y,z). The z level is split into numofzlevs levels. If numofzlevs = 1, then it defaults to the original x,y,theta lattice planning defined in EnvironmentNAVXYTHETALAT. Otherwise, it uses numofzlevs footprints of the robot and corresponding costmaps. It assumes that they correspond to each other and are projections of the robot and corresponding z regions of the 3D map
EnvironmentROBARMPlanar kinematic robot arm of variable number of degrees of freedom
EnvironmentROBARM_t
EnvironmentXXXThis is just an example of environment and can be used (copy and paste) for creating a more complex environment
EnvironmentXXX_t
EnvNAVXYTHETALAT2Dpt_t
EnvNAVXYTHETALAT3DCELL
EnvNAVXYTHETALAT3Dpt_t
EnvNAVXYTHETALATAction_t
EnvNAVXYTHETALATHashEntry_t
EnvNAVXYTHETAMLEVLATAddInfoAction_t
ENVROBARMHASHENTRY
ENVXXXHASHENTRY
HEAPELEMENT
HEAPINTELEMENT
listelement
MDPConfig
NAV2D_CELL
Point2D
POLICYBELIEFSTATEWITHBINARYHVALS
PPCPPlannerPPCP planner in explanations, S signifies a fully observable part of the state space H signifies hidden variables
PPCPPLANNERSTATEDATAState for PPCP
PPCPSTATESPACEPPCP statespace
RSTARACTIONDATA_TAction in Gamma graph. Each action in Gamma graph corresponds to a path
RSTARLSEARCHSTATEDATALow-level (local) search state in R*
RSTARLSEARCHSTATESPACELocal search statespace in R*
RSTARPlannerRSTAR* planner
RSTARSEARCHSTATEDATAHigh level states in R* search
RSTARSEARCHSTATESPACEStatespace
SBPL2DGridSearch2D search itself
sbpl_2Dcell_t
SBPL_2DGridSearchStateSearch state corresponding to each 2D cell
sbpl_2Dpt_t
SBPL_Exception
SBPL_xytheta_mprimitive
SBPLPlannerPure virtual base class for a generic planner
STATE2D_t
StateChangeQuerySee comments in sbpl/src/planners/planner.h about the what and why of this class
VIPlannerValue iteration planner
VIPLANNER_T
VIPLANNERSTATEDATAValue Iteration state
 All Classes Files Functions Variables Typedefs Enumerations Enumerator Defines


sbpl
Author(s): Maxim Likhachev/maximl@seas.upenn.edu
autogenerated on Fri Jan 11 09:38:50 2013