All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator Friends
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 1234]
\NomplMain namespace. Contains everything in this library
 oNbaseThis namespace contains sampling based planning routines shared by both planning under geometric constraints (geometric) and planning under differential constraints (dynamic)
 oNcontrolThis namespace contains sampling based planning routines used by planning under differential constraints
 oNgeometricThis namespace contains code that is specific to planning under geometric constraints
 oNmachineThis namespace contains routines that read specifications of the machine in use
 oNmagicThis namespace includes magic constants used in various places in OMPL
 oNmsgMessage namespace. This contains classes needed to output error messages (or logging) from within the library. Message logging can be performed with logging macros
 oNtimeNamespace containing time datatypes and time operations
 oNtoolsIncludes various tools such as self config, benchmarking, etc
 oCBinaryHeapThis class provides an implementation of an updatable min-heap. Using it is a bit cumbersome, as it requires keeping track of the BinaryHeap::Element* type, however, it should be as fast as it gets with an updatable heap
 oCGreedyKCentersAn instance of this class can be used to greedily select a given number of representatives from a set of data points that are all far apart from each other
 oCGridRepresentation of a simple grid
 oCGridBThis class defines a grid that keeps track of its boundary: it distinguishes between interior and exterior cells
 oCGridNRepresentation of a grid where cells keep track of how many neighbors they have
 oCNearestNeighborsAbstract representation of a container that can perform nearest neighbors queries
 oCNearestNeighborsGNATGeometric Near-neighbor Access Tree (GNAT), a data structure for nearest neighbor search
 oCNearestNeighborsLinearA nearest neighbors datastructure that uses linear search
 oCNearestNeighborsSqrtApproxA nearest neighbors datastructure that uses linear search. The linear search is done over sqrt(n) elements only. (Every sqrt(n) elements are skipped)
 oCPDFA container that supports probabilistic sampling over weighted data
 oCExceptionThe exception type for ompl
 \CRNGRandom number generation. An instance of this class cannot be used by multiple threads at once (member functions are not const). However, the constructor is thread safe and different instances can be used safely in any number of threads. It is also guaranteed that all created instances will have a different random seed