Lazy Bi-directional KPIECE with one level of discretization. More...
#include <LBKPIECE1.h>
Classes | |
class | Motion |
Representation of a motion for this algorithm. More... | |
Public Member Functions | |
LBKPIECE1 (const base::SpaceInformationPtr &si) | |
Constructor. | |
void | setProjectionEvaluator (const base::ProjectionEvaluatorPtr &projectionEvaluator) |
Set the projection evaluator. This class is able to compute the projection of a given state. | |
void | setProjectionEvaluator (const std::string &name) |
Set the projection evaluator (select one from the ones registered with the state space). | |
const base::ProjectionEvaluatorPtr & | getProjectionEvaluator (void) const |
Get the projection evaluator. | |
void | setRange (double distance) |
Set the range the planner is supposed to use. | |
double | getRange (void) const |
Get the range the planner is using. | |
void | setBorderFraction (double bp) |
Set the fraction of time for focusing on the border (between 0 and 1). This is the minimum fraction used to select cells that are exterior (minimum because if 95% of cells are on the border, they will be selected with 95% chance, even if this fraction is set to 90%) | |
double | getBorderFraction (void) const |
Get the fraction of time to focus exploration on boundary. | |
void | setMinValidPathFraction (double fraction) |
When extending a motion, the planner can decide to keep the first valid part of it, even if invalid states are found, as long as the valid part represents a sufficiently large fraction from the original motion. This function sets the minimum acceptable fraction. | |
double | getMinValidPathFraction (void) const |
Get the value of the fraction set by setMinValidPathFraction() | |
virtual void | setup (void) |
Perform extra configuration steps, if needed. This call will also issue a call to ompl::base::SpaceInformation::setup() if needed. This must be called before solving. | |
virtual bool | solve (const base::PlannerTerminationCondition &ptc) |
Function that can solve the motion planning problem. This function can be called multiple times on the same problem, without calling clear() in between. This allows the planner to continue work more time on an unsolved problem, for example. If this option is used, it is assumed the problem definition is not changed (unpredictable results otherwise). The only change in the problem definition that is accounted for is the addition of starting or goal states (but not changing previously added start/goal states). The function terminates if the call to ptc returns true. | |
virtual void | clear (void) |
Clear all internal datastructures. Planner settings are not affected. Subsequent calls to solve() will ignore all previous work. | |
virtual void | getPlannerData (base::PlannerData &data) const |
Get information about the current run of the motion planner. Repeated calls to this function will update data (only additions are made). This is useful to see what changed in the exploration datastructure, between calls to solve(), for example (without calling clear() in between). | |
Protected Member Functions | |
void | freeMotion (Motion *motion) |
Free the memory for a motion. | |
void | removeMotion (Discretization< Motion > &disc, Motion *motion) |
Remove a motion from a tree of motions. | |
bool | isPathValid (Discretization< Motion > &disc, Motion *motion, base::State *temp) |
Since solutions are computed in a lazy fashion, once trees are connected, the solution found needs to be checked for validity. This function checks whether the reverse path from a given motion to a root is valid. If this is not the case, invalid motions are removed. | |
Protected Attributes | |
base::StateSamplerPtr | sampler_ |
The employed state sampler. | |
base::ProjectionEvaluatorPtr | projectionEvaluator_ |
The employed projection evaluator. | |
Discretization< Motion > | dStart_ |
The start tree. | |
Discretization< Motion > | dGoal_ |
The goal tree. | |
double | minValidPathFraction_ |
When extending a motion, the planner can decide to keep the first valid part of it, even if invalid states are found, as long as the valid part represents a sufficiently large fraction from the original motion. | |
double | maxDistance_ |
The maximum length of a motion to be added to a tree. | |
RNG | rng_ |
The random number generator. |
Lazy Bi-directional KPIECE with one level of discretization.
@par Short description KPIECE is a tree-based planner that uses a discretization (multiple levels, in general) to guide the exploration of the continuous space. This implementation is a simplified one, using a single level of discretization: one grid. The grid is imposed on a projection of the state space. When exploring the space, preference is given to the boundary of this grid. The boundary is computed to be the set of grid cells that have less than 2n non-diagonal neighbors in an n-dimensional projection space. It is important to set the projection the algorithm uses (setProjectionEvaluator() function). If no projection is set, the planner will attempt to use the default projection associated to the state space. An exception is thrown if no default projection is available either. This variant of the implementation use two trees of exploration with lazy collision checking, hence the LB prefix. @par External documentation - I.A. Şucan and L.E. Kavraki, Kinodynamic motion planning by interior-exterior cell exploration, in <em>Workshop on the Algorithmic Foundations of Robotics</em>, Dec. 2008.<br> <a href="http://ioan.sucan.ro/files/pubs/wafr2008.pdf">[PDF]</a> - R. Bohlin and L.E. Kavraki, Path planning using lazy PRM, in <em>Proc. 2000 IEEE Intl. Conf. on Robotics and Automation</em>, pp. 521–528, 2000. DOI: <a href="http://dx.doi.org/10.1109/ROBOT.2000.844107">10.1109/ROBOT.2000.844107</a><br> <a href="http://ieeexplore.ieee.org/ielx5/6794/18235/00844107.pdf?tp=&arnumber=844107&isnumber=18235">[PDF]
Definition at line 81 of file LBKPIECE1.h.
void ompl::geometric::LBKPIECE1::setRange | ( | double | distance | ) | [inline] |
Set the range the planner is supposed to use.
This parameter greatly influences the runtime of the algorithm. It represents the maximum length of a motion to be added in the tree of motions.
Definition at line 125 of file LBKPIECE1.h.