Program Listing for File ParallelPlan.h

↰ Return to documentation for file (src/ompl/tools/multiplan/ParallelPlan.h)

/*********************************************************************
* Software License Agreement (BSD License)
*
*  Copyright (c) 2011, 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_TOOLS_MULTIPLAN_PARALLEL_PLAN_
#define OMPL_TOOLS_MULTIPLAN_PARALLEL_PLAN_

#include "ompl/base/Planner.h"
#include "ompl/geometric/PathGeometric.h"
#include <mutex>

namespace ompl
{
    namespace geometric
    {
        OMPL_CLASS_FORWARD(PathHybridization);
    }

    namespace tools
    {
        OMPL_CLASS_FORWARD(ParallelPlan);

        class ParallelPlan
        {
        public:
            ParallelPlan(const base::ProblemDefinitionPtr &pdef);

            virtual ~ParallelPlan();

            void addPlanner(const base::PlannerPtr &planner);

            void addPlannerAllocator(const base::PlannerAllocator &pa);

            void clearHybridizationPaths();

            void clearPlanners();

            const base::ProblemDefinitionPtr &getProblemDefinition() const
            {
                return pdef_;
            }

            base::ProblemDefinitionPtr &getProblemDefinition()
            {
                return pdef_;
            }

            base::PlannerStatus solve(double solveTime, bool hybridize = true);

            base::PlannerStatus solve(const base::PlannerTerminationCondition &ptc, bool hybridize = true);

            base::PlannerStatus solve(double solveTime, std::size_t minSolCount, std::size_t maxSolCount,
                                      bool hybridize = true);

            base::PlannerStatus solve(const base::PlannerTerminationCondition &ptc, std::size_t minSolCount,
                                      std::size_t maxSolCount, bool hybridize = true);

        protected:
            void solveOne(base::Planner *planner, std::size_t minSolCount,
                          const base::PlannerTerminationCondition *ptc);

            void solveMore(base::Planner *planner, std::size_t minSolCount, std::size_t maxSolCount,
                           const base::PlannerTerminationCondition *ptc);

            base::ProblemDefinitionPtr pdef_;

            std::vector<base::PlannerPtr> planners_;

            geometric::PathHybridizationPtr phybrid_;

            std::mutex phlock_;

        private:
            unsigned int foundSolCount_;

            std::mutex foundSolCountLock_;
        };
    }
}

#endif