pRRT.h

Go to the documentation of this file.

/*********************************************************************
* Software License Agreement (BSD License)
*
*  Copyright (c) 2008, Willow Garage, Inc.
*  All rights reserved.
*
*  Redistribution and use in source and binary forms, with or without
*  modification, are permitted provided that the following conditions
*  are met:
*
*   * Redistributions of source code must retain the above copyright
*     notice, this list of conditions and the following disclaimer.
*   * Redistributions in binary form must reproduce the above
*     copyright notice, this list of conditions and the following
*     disclaimer in the documentation and/or other materials provided
*     with the distribution.
*   * Neither the name of the Willow Garage nor the names of its
*     contributors may be used to endorse or promote products derived
*     from this software without specific prior written permission.
*
*  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
*  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
*  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
*  FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
*  COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
*  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
*  BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
*  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
*  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
*  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
*  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
*  POSSIBILITY OF SUCH DAMAGE.
*********************************************************************/

/* Author: Ioan Sucan */

#ifndef OMPL_GEOMETRIC_PLANNERS_RRT_pRRT_
#define OMPL_GEOMETRIC_PLANNERS_RRT_pRRT_

#include "ompl/geometric/planners/PlannerIncludes.h"
#include "ompl/base/StateSamplerArray.h"
#include "ompl/datastructures/NearestNeighbors.h"
#include <boost/thread/mutex.hpp>

namespace ompl
{

    namespace geometric
    {

        class pRRT : public base::Planner
        {
        public:

            pRRT(const base::SpaceInformationPtr &si) : base::Planner(si, "pRRT"),
                                                        samplerArray_(si)
            {
                type_ = base::PLAN_TO_GOAL_ANY;

                setThreadCount(2);
                goalBias_ = 0.05;
                maxDistance_ = 0.0;
            }

            virtual ~pRRT(void)
            {
                freeMemory();
            }

            virtual void getPlannerData(base::PlannerData &data) const;

            virtual bool solve(const base::PlannerTerminationCondition &ptc);

            virtual void clear(void);

            void setGoalBias(double goalBias)
            {
                goalBias_ = goalBias;
            }

            double getGoalBias(void) const
            {
                return goalBias_;
            }

            void setRange(double distance)
            {
                maxDistance_ = distance;
            }

            double getRange(void) const
            {
                return maxDistance_;
            }

            void setThreadCount(unsigned int nthreads);

            unsigned int getThreadCount(void) const
            {
                return threadCount_;
            }

            template<template<typename T> class NN>
            void setNearestNeighbors(void)
            {
                nn_.reset(new NN<Motion*>());
            }

            virtual void setup(void);

        protected:

            class Motion
            {
            public:

                Motion(void) : state(NULL), parent(NULL)
                {
                }

                Motion(const base::SpaceInformationPtr &si) : state(si->allocState()), parent(NULL)
                {
                }

                ~Motion(void)
                {
                }

                base::State       *state;
                Motion            *parent;

            };

            struct SolutionInfo
            {
                Motion      *solution;
                Motion      *approxsol;
                double       approxdif;
                boost::mutex lock;
            };

            void threadSolve(unsigned int tid, const base::PlannerTerminationCondition &ptc, SolutionInfo *sol);
            void freeMemory(void);

            double distanceFunction(const Motion* a, const Motion* b) const
            {
                return si_->distance(a->state, b->state);
            }

            base::StateSamplerArray<base::StateSampler> samplerArray_;
            boost::shared_ptr< NearestNeighbors<Motion*> >      nn_;
            boost::mutex                                        nnLock_;

            unsigned int                                        threadCount_;

            double                                              goalBias_;
            double                                              maxDistance_;
        };

    }
}

#endif

---

ompl
Author(s): Ioan Sucan/isucan@rice.edu, Mark Moll/mmoll@rice.edu, Lydia Kavraki/kavraki@rice.edu
autogenerated on Fri Jan 11 09:33:19 2013