ompl Namespace Reference

Main namespace. Contains everything in this library. More...

Namespaces
namespace	base
	This namespace contains sampling based planning routines shared by both planning under geometric constraints (geometric) and planning under differential constraints (dynamic).
namespace	control
	This namespace contains sampling based planning routines used by planning under differential constraints.
namespace	geometric
	This namespace contains code that is specific to planning under geometric constraints.
namespace	machine
	This namespace contains routines that read specifications of the machine in use.
namespace	magic
	This namespace includes magic constants used in various places in OMPL.
namespace	msg
	Message namespace. This contains classes needed to output error messages (or logging) from within the library.
namespace	time
	Namespace containing time datatypes and time operations.
Classes
class	Benchmark
	Benchmark a set of planners on a problem instance. More...
class	BinaryHeap
	This 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. More...
class	Exception
	The exception type for ompl. More...
class	GreedyKCenters
	An 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. More...
class	Grid
	Representation of a simple grid. More...
class	GridB
	This class defines a grid that keeps track of its boundary: it distinguishes between interior and exterior cells. More...
class	GridN
	Representation of a grid where cells keep track of how many neighbors they have. More...
class	NearestNeighbors
	Abstract representation of a container that can perform nearest neighbors queries. More...
class	NearestNeighborsGNAT
	Geometric Near-neighbor Access Tree (GNAT), a data structure for nearest neighbor search. More...
class	NearestNeighborsLinear
	A nearest neighbors datastructure that uses linear search. More...
class	NearestNeighborsSqrtApprox
	A nearest neighbors datastructure that uses linear search. The linear search is done over sqrt(n) elements only. (Every sqrt(n) elements are skipped). More...
class	PDF
	A container that supports probabilistic sampling over weighted data. More...
class	Profiler
	This is a simple thread-safe tool for counting time spent in various chunks of code. This is different from external profiling tools in that it allows the user to count time spent in various bits of code (sub-function granularity) or count how many times certain pieces of code are executed. More...
class	RNG
	Random 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. More...
class	SelfConfig
	This class contains methods that automatically configure various parameters for motion planning. If expensive computation is performed, the results are cached. More...
class	StateSpaceCollection
	Manage a set of state spaces such that they share common subspaces. More...

---

Detailed Description

Main namespace. Contains everything in this library.