LBTRRT.h

/*********************************************************************
* Software License Agreement (BSD License)
*
*  Copyright (c) 2015, Tel Aviv University
*  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 Tel Aviv University 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: Oren Salzman, Sertac Karaman, Ioan Sucan, Mark Moll */

#ifndef OMPL_GEOMETRIC_PLANNERS_RRT_LBT_RRT_
#define OMPL_GEOMETRIC_PLANNERS_RRT_LBT_RRT_

#include "ompl/geometric/planners/PlannerIncludes.h"
#include "ompl/base/OptimizationObjective.h"
#include "ompl/datastructures/NearestNeighbors.h"
#include "ompl/datastructures/DynamicSSSP.h"

#include <fstream>

namespace ompl
{

    namespace geometric
    {

        class LBTRRT : public base::Planner
        {
        public:

            LBTRRT (const base::SpaceInformationPtr &si);

            virtual ~LBTRRT();

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

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

            virtual void clear();

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

            double getGoalBias() const
            {
                return goalBias_;
            }

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

            double getRange() const
            {
                return maxDistance_;
            }

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

            virtual void setup();

            void setApproximationFactor(double epsilon)
            {
                epsilon_ = epsilon;
            }

            double getApproximationFactor() const
            {
                return epsilon_;
            }

            // Planner progress property functions
            std::string getIterationCount() const
            {
                return std::to_string(iterations_);
            }
            std::string getBestCost() const
            {
                return std::to_string(bestCost_);
            }

        protected:

            class Motion
            {
            public:

                Motion() : state_(nullptr), parentApx_(nullptr), costApx_(0.0)
                {
                }

                Motion(const base::SpaceInformationPtr &si)
                    : state_(si->allocState()), parentApx_(nullptr), costApx_(0.0)
                {
                }

                ~Motion()
                {
                }

                base::State          *state_;
                std::size_t          id_;
                double               costLb_;
                Motion               *parentApx_;
                double               costApx_;
                std::vector<Motion*> childrenApx_;
            };

            struct IsLessThan
            {
                IsLessThan (LBTRRT *plannerPtr, Motion *motion)
                    : plannerPtr_(plannerPtr), motion_(motion)
                {
                }

                bool operator() (const Motion *motionA, const Motion *motionB)
                {
                    double costA = motionA->costLb_;
                    double costB = motionB->costLb_;

                    double distA = plannerPtr_->distanceFunction(motionA, motion_);
                    double distB = plannerPtr_->distanceFunction(motionB, motion_);

                    return costA + distA < costB + distB;
                }
                LBTRRT *plannerPtr_;
                Motion *motion_;
            }; //IsLessThan

            struct IsLessThanLB
            {
                IsLessThanLB (LBTRRT *plannerPtr): plannerPtr_(plannerPtr)
                {
                }

                bool operator() (const Motion *motionA, const Motion *motionB) const
                {
                    return motionA->costLb_ < motionB->costLb_;
                }
                LBTRRT*  plannerPtr_;
            }; //IsLessThanLB

            typedef std::set<Motion*, IsLessThanLB> Lb_queue;
            typedef Lb_queue::iterator              Lb_queue_iter;

            void considerEdge(Motion *parent, Motion *child, double c);

            double lazilyUpdateApxParent(Motion *child, Motion *parent);

            void updateChildCostsApx(Motion *m, double delta);

            void removeFromParentApx(Motion *m);

            void freeMemory();

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

            bool checkMotion(const Motion *a, const Motion *b)
            {
                return checkMotion(a->state_, b->state_);
            }
            bool checkMotion(const base::State *a, const base::State *b)
            {
                return si_->checkMotion(a, b);
            }

            Motion* getMotion(std::size_t i)
            {
                return idToMotionMap_[i];
            }

            base::StateSamplerPtr                          sampler_;

            std::shared_ptr< NearestNeighbors<Motion*> > nn_;

            DynamicSSSP                                    lowerBoundGraph_;

            std::vector<Motion*>                           idToMotionMap_;

            double                                         goalBias_;

            double                                         maxDistance_;

            double                                         epsilon_;

            RNG                                            rng_;

            Motion                                         *lastGoalMotion_;

            // Planner progress properties
            unsigned int                                   iterations_;
            double                                         bestCost_;
        };

    }
}

#endif //OMPL_GEOMETRIC_PLANNERS_RRT_LBT_RRT_