ProductGraph.h

/*********************************************************************
* Software License Agreement (BSD License)
*
*  Copyright (c) 2012, Rice 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 Rice 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: Matt Maly */
 
#ifndef OMPL_CONTROL_PLANNERS_LTL_PRODUCTGRAPH_
#define OMPL_CONTROL_PLANNERS_LTL_PRODUCTGRAPH_
 
#include "ompl/base/State.h"
#include "ompl/control/planners/ltl/Automaton.h"
#include "ompl/control/planners/ltl/PropositionalDecomposition.h"
#include "ompl/util/ClassForward.h"
#include <boost/graph/adjacency_list.hpp>
#include <unordered_map>
#include <map>
#include <ostream>
#include <vector>
 
namespace ompl
{
    namespace control
    {
 
        OMPL_CLASS_FORWARD(ProductGraph);
 
        class ProductGraph
        {
        public:
            class State;
 
 
            struct HashState
            {
                std::size_t operator()(const State &s) const;
            };
 
            class State
            {
                friend class ProductGraph;
 
            public:
                State() = default;
 
                State(const State &s) = default;
 
                bool operator==(const State &s) const;
 
                bool isValid() const;
 
                friend struct HashState;
 
                friend std::ostream &operator<<(std::ostream &out, const State &s);
 
                int getDecompRegion() const;
 
                int getCosafeState() const;
 
                int getSafeState() const;
 
            private:
                int decompRegion{-1};
                int cosafeState{-1};
                int safeState{-1};
            };
 
            ProductGraph(PropositionalDecompositionPtr decomp, AutomatonPtr cosafetyAut, AutomatonPtr safetyAut);
 
            ProductGraph(const PropositionalDecompositionPtr &decomp, AutomatonPtr cosafetyAut);
 
            ~ProductGraph();
 
            const PropositionalDecompositionPtr &getDecomp() const;
 
            const AutomatonPtr &getCosafetyAutom() const;
 
            const AutomatonPtr &getSafetyAutom() const;
 
            std::vector<State *> computeLead(State *start, const std::function<double(State *, State *)> &edgeWeight);
 
            void clear();
 
            void buildGraph(State *start, const std::function<void(State *)> &initialize = [](State *){});
 
            bool isSolution(const State *s) const;
 
            State *getStartState() const;
 
            double getRegionVolume(const State *s);
 
            int getCosafeAutDistance(const State *s) const;
 
            int getSafeAutDistance(const State *s) const;
 
            State *getState(const base::State *cs) const;
 
            State *getState(const base::State *cs, int cosafe, int safe) const;
 
            State *getState(const State *parent, int nextRegion) const;
 
            State *getState(const State *parent, const base::State *cs) const;
 
            State *getState(int region, int cosafe, int safe) const
            {
                State s;
                s.decompRegion = region;
                s.cosafeState = cosafe;
                s.safeState = safe;
                State *&ret = stateToPtr_[s];
                if (ret == nullptr)
                    ret = new State(s);
                return ret;
            }
 
        protected:
            struct Edge
            {
                double cost;
            };
 
            using GraphType = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, State *, Edge>;
            using Vertex = boost::graph_traits<GraphType>::vertex_descriptor;
            using VertexIter = boost::graph_traits<GraphType>::vertex_iterator;
            using VertexIndexMap = boost::property_map<GraphType, boost::vertex_index_t>::type;
            using EdgeIter = boost::graph_traits<GraphType>::edge_iterator;
 
            PropositionalDecompositionPtr decomp_;
            AutomatonPtr cosafety_;
            AutomatonPtr safety_;
            GraphType graph_;
            State *startState_;
            std::vector<State *> solutionStates_;
 
            /* Only one State pointer will be allocated for each possible State
               in the ProductGraph. There will exist situations in which
               all we have are the component values (region, automaton states)
               of a State and we want the actual State pointer.
               We use this map to access it. */
            mutable std::unordered_map<State, State *, HashState> stateToPtr_;
 
            /* Map from State pointer to the index of the corresponding vertex
               in the graph. */
            std::unordered_map<State *, int> stateToIndex_;
        };
    }
}
#endif