Loading...
Searching...
No Matches
PropositionalTriangularDecomposition.cpp
137 WrapperDecomposition::WrapperDecomposition(const oc::Decomposition *decomp, const ob::RealVectorBounds &bounds,
148 void WrapperDecomposition::sampleFromRegion(int rid, ompl::RNG &rng, std::vector<double> &coord) const
153 void WrapperDecomposition::sampleFullState(const ob::StateSamplerPtr &sampler, const std::vector<double> &coord,
The lower and upper bounds for an Rn space.
Definition RealVectorBounds.h:48
PropositionalDecomposition(const DecompositionPtr &decomp)
Creates a propositional decomposition wrapped around a given decomposition with a given number of pro...
Definition PropositionalDecomposition.cpp:46
int getNumProps() const override
Returns the number of propositions in this propositional decomposition.
Definition PropositionalTriangularDecomposition.cpp:84
PropositionalTriangularDecomposition(const base::RealVectorBounds &bounds, const std::vector< Polygon > &holes=std::vector< Polygon >(), const std::vector< Polygon > &props=std::vector< Polygon >())
Creates a PropositionalTriangularDecomposition over the given bounds, which must be 2-dimensional....
Definition PropositionalTriangularDecomposition.cpp:76
World worldAtRegion(int triID) override
Returns the World corresponding to a given region.
Definition PropositionalTriangularDecomposition.cpp:89
A TriangularDecomposition is a triangulation that ignores obstacles.
Definition TriangularDecomposition.h:56
A class to represent an assignment of boolean values to propositions. A World can be partially restri...
Definition World.h:72
This namespace contains sampling based planning routines shared by both planning under geometric cons...
Definition ConstrainedSpaceInformation.h:55
This namespace contains sampling based planning routines used by planning under differential constrai...
Definition Control.h:45
STL namespace.