All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator
ompl::geometric::KStarStrategy< Milestone > Class Template Reference

Make the minimal number of connections required to ensure asymptotic optimality. More...

#include <ConnectionStrategy.h>

Inheritance diagram for ompl::geometric::KStarStrategy< Milestone >:

List of all members.

Public Member Functions

 KStarStrategy (const boost::function0< unsigned int > &n, const boost::shared_ptr< NearestNeighbors< Milestone > > &nn, const unsigned int d=1)
 Constructor.
std::vector< Milestone > & operator() (const Milestone &m)
 Given a milestone m, find the number of nearest neighbors connection attempts that should be made from it, according to the connection strategy.

Protected Attributes

const boost::function0
< unsigned int > 
n_
 Function returning the number of milestones added to the roadmap so far.
const double kPRMConstant_

Detailed Description

template<class Milestone>
class ompl::geometric::KStarStrategy< Milestone >

Make the minimal number of connections required to ensure asymptotic optimality.

This connection strategy attempts to connect a milestone to its k-nearest neighbors where k is a function of the number of milestones that have already been added to the roadmap (n).

k(n) = kPRMConstant * log(n)

where

kPRMConstant > kStarPRMConstant = e(1 + 1/d)

and d is the number of dimensions in the state space. Note that kPRMConstant = 2e is a valid choice for any problem instance and so, if d is not provided, this value is used.

The user must provide a function that returns the value of n.

External documentation
S. Karaman and E. Frazzoli Sampling-based algorithms for optimal motion planning, Int. Journal of Robotics Research Volume 30, Number 7, June 2010

Definition at line 126 of file ConnectionStrategy.h.


Constructor & Destructor Documentation

template<class Milestone>
ompl::geometric::KStarStrategy< Milestone >::KStarStrategy ( const boost::function0< unsigned int > &  n,
const boost::shared_ptr< NearestNeighbors< Milestone > > &  nn,
const unsigned int  d = 1 
) [inline]

Constructor.

Parameters:
na function that returns the number of milestones that have already been added to the roadmap
nnthe nearest neighbors datastruture to use
dthe dimensionality of the state space. The default is 1, which will make kPRMConstant=2e which is valid for all problem instances.

Definition at line 139 of file ConnectionStrategy.h.


The documentation for this class was generated from the following file: