ConnectionStrategy.h
144 kPRMConstant_(boost::math::constants::e<double>() + (boost::math::constants::e<double>() / (double)d))
KStarStrategy(const NumNeighborsFn &n, const boost::shared_ptr< NearestNeighbors< Milestone > > &nn, const unsigned int d=1)
Constructor.
Definition: ConnectionStrategy.h:140
boost::shared_ptr< NearestNeighbors< Milestone > > nn_
Nearest neighbors data structure.
Definition: ConnectionStrategy.h:95
void log(const char *file, int line, LogLevel level, const char *m,...)
Root level logging function. This should not be invoked directly, but rather used via a logging macro...
Definition: Console.cpp:104
boost::function< double(const _T &, const _T &)> DistanceFunction
The definition of a distance function.
Definition: NearestNeighbors.h:55
std::vector< Milestone > neighbors_
Scratch space for storing k-nearest neighbors.
Definition: ConnectionStrategy.h:98
const double bound_
The maximum distance at which nearby milestones are reported.
Definition: ConnectionStrategy.h:203
unsigned int k_
Maximum number of nearest neighbors to attempt to connect new milestones to.
Definition: ConnectionStrategy.h:92
Return at most k neighbors, as long as they are also within a specified bound.
Definition: ConnectionStrategy.h:167
const std::vector< Milestone > & operator()(const Milestone &m)
Given a milestone m, find the number of nearest neighbors connection attempts that should be made fro...
Definition: ConnectionStrategy.h:83
KBoundedStrategy(const unsigned int k, const double bound, const boost::shared_ptr< NearestNeighbors< Milestone > > &nn)
Constructor.
Definition: ConnectionStrategy.h:178
const NumNeighborsFn n_
Function returning the number of milestones added to the roadmap so far.
Definition: ConnectionStrategy.h:157
void setNearestNeighbors(const boost::shared_ptr< NearestNeighbors< Milestone > > &nn)
Set the nearest neighbors datastructure to use.
Definition: ConnectionStrategy.h:75
KStrategy(const unsigned int k, const boost::shared_ptr< NearestNeighbors< Milestone > > &nn)
Constructor takes the maximum number of nearest neighbors to return (k) and the nearest neighbors dat...
Definition: ConnectionStrategy.h:63
Abstract representation of a container that can perform nearest neighbors queries.
Definition: NearestNeighbors.h:50
Make the minimal number of connections required to ensure asymptotic optimality.
Definition: ConnectionStrategy.h:127