Main Page   Namespace List   Class Hierarchy   Compound List   File List   Compound Members   File Members  

RRTDual Class Reference

Planners that grow trees from the initial and goal. More...

#include <rrt.h>

Inheritance diagram for RRTDual:

RRT IncrementalPlanner Planner Solver RRTBidirBalanced RRTConCon RRTExtCon RRTExtExt List of all members.

Public Methods

 RRTDual (Problem *p)
virtual ~RRTDual ()
virtual bool Plan ()
 The dual-tree planner used in LaValle, Kuffner, ICRA 1999. Each tree is extended toward a randomly-sampled point. RRTExtExt is generally better. More...


Protected Methods

void RecoverSolution (MSLNode *n1, MSLNode *n2)

Detailed Description

Planners that grow trees from the initial and goal.

This planner grows one tree, G, from the initial state, and one tree, G2, from the goal state. When the closest pair of points between the two trees is within GapError, a solution path is returned. The planners in the derived classes also use two trees, and are generally more efficient than RRTDual.


Constructor & Destructor Documentation

RRTDual::RRTDual Problem   p
 

virtual RRTDual::~RRTDual   [inline, virtual]
 


Member Function Documentation

bool RRTDual::Plan   [virtual]
 

The dual-tree planner used in LaValle, Kuffner, ICRA 1999. Each tree is extended toward a randomly-sampled point. RRTExtExt is generally better.

Reimplemented from RRT.

Reimplemented in RRTExtExt.

void RRTDual::RecoverSolution MSLNode   n1,
MSLNode   n2
[protected]
 


The documentation for this class was generated from the following files: Motion Strategy Library


Web page maintained by Steve LaValle