Vertex.h

/*********************************************************************
 * Software License Agreement (BSD License)
 *
 *  Copyright (c) 2019, University of Oxford
 *  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 University of Toronto 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.
 *********************************************************************/
 
// Authors: Marlin Strub
 
#ifndef OMPL_GEOMETRIC_PLANNERS_INFORMEDTREES_EITSTAR_VERTEX_
#define OMPL_GEOMETRIC_PLANNERS_INFORMEDTREES_EITSTAR_VERTEX_
 
#include <memory>
#include <vector>
 
#include "ompl/base/Cost.h"
#include "ompl/base/OptimizationObjective.h"
#include "ompl/datastructures/BinaryHeap.h"
 
#include "ompl/geometric/planners/informedtrees/eitstar/Direction.h"
#include "ompl/geometric/planners/informedtrees/eitstar/Edge.h"
 
namespace ompl
{
    namespace geometric
    {
        namespace eitstar
        {
            // Forward declare the EIT* state class.
            class State;
 
            class Vertex : public std::enable_shared_from_this<Vertex>  // Inheritance must be public here.
            {
            public:
                Vertex(const std::shared_ptr<State> &state,
                       const std::shared_ptr<ompl::base::OptimizationObjective> &objective, const Direction &direction);
 
                ~Vertex();
 
                std::size_t getId() const;
 
                std::shared_ptr<State> getState() const;
 
                const std::vector<std::shared_ptr<Vertex>> &getChildren() const;
 
                bool hasChildren() const;
 
                std::vector<std::shared_ptr<Vertex>>
                updateCurrentCostOfChildren(const std::shared_ptr<ompl::base::OptimizationObjective> &objective);
 
                void addChild(const std::shared_ptr<Vertex> &vertex);
 
                void removeChild(const std::shared_ptr<Vertex> &vertex);
 
                std::weak_ptr<Vertex> getParent() const;
 
                bool isParent(const std::shared_ptr<Vertex> &vertex) const;
 
                std::weak_ptr<Vertex> getTwin() const;
 
                void updateParent(const std::shared_ptr<Vertex> &vertex);
 
                void setEdgeCost(const ompl::base::Cost &edgeCost);
 
                ompl::base::Cost getEdgeCost() const;
 
                void resetParent();
 
                void setTwin(const std::shared_ptr<Vertex> &vertex);
 
                void clearChildren();
 
                std::size_t getExpandTag() const;
 
                void registerExpansionInReverseSearch(std::size_t tag);
 
                void callOnBranch(const std::function<void(const std::shared_ptr<eitstar::State> &)> &function);
 
            private:
                const std::size_t id_;
 
                const std::shared_ptr<const ompl::base::OptimizationObjective> objective_;
 
                ompl::base::Cost edgeCost_{std::numeric_limits<double>::signaling_NaN()};
 
                std::weak_ptr<Vertex> parent_{};
 
                std::weak_ptr<Vertex> twin_{};
 
                std::vector<std::shared_ptr<Vertex>> children_{};
 
                std::size_t expandTag_{0u};
 
                const std::shared_ptr<State> state_;
 
                const Direction direction_;
 
                friend class ReverseQueue;
 
                mutable std::vector<ompl::BinaryHeap<
                    std::tuple<ompl::base::Cost, ompl::base::Cost, unsigned int, unsigned int, Edge>,
                    std::function<bool(
                        const std::tuple<ompl::base::Cost, ompl::base::Cost, unsigned int, unsigned int, Edge> &,
                        const std::tuple<ompl::base::Cost, ompl::base::Cost, unsigned int, unsigned int, Edge> &)>>::
                                        Element *>
                    outgoingReverseQueueLookup_;
            };
 
        }  // namespace eitstar
 
    }  // namespace geometric
 
}  // namespace ompl
 
#endif  // OMPL_GEOMETRIC_PLANNERS_INFORMEDTREES_EITSTAR_QUEUE_