ompl/geometric/planners/AnytimePathShortening.h
00001 /********************************************************************* 00002 * Software License Agreement (BSD License) 00003 * 00004 * Copyright (c) 2014, Rice University 00005 * All rights reserved. 00006 * 00007 * Redistribution and use in source and binary forms, with or without 00008 * modification, are permitted provided that the following conditions 00009 * are met: 00010 * 00011 * * Redistributions of source code must retain the above copyright 00012 * notice, this list of conditions and the following disclaimer. 00013 * * Redistributions in binary form must reproduce the above 00014 * copyright notice, this list of conditions and the following 00015 * disclaimer in the documentation and/or other materials provided 00016 * with the distribution. 00017 * * Neither the name of the Rice University nor the names of its 00018 * contributors may be used to endorse or promote products derived 00019 * from this software without specific prior written permission. 00020 * 00021 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 00022 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 00023 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 00024 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 00025 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 00026 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 00027 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 00028 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 00029 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00030 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN 00031 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 00032 * POSSIBILITY OF SUCH DAMAGE. 00033 *********************************************************************/ 00034 00035 /* Author: Ryan Luna */ 00036 00037 #ifndef OMPL_GEOMETRIC_PLANNERS_ANYTIMEOPTIMIZATION_ANYTIMEPATHSHORTENING_ 00038 #define OMPL_GEOMETRIC_PLANNERS_ANYTIMEOPTIMIZATION_ANYTIMEPATHSHORTENING_ 00039 00040 #include "ompl/base/Planner.h" 00041 #include <vector> 00042 00043 namespace ompl 00044 { 00045 namespace geometric 00046 { 00065 class AnytimePathShortening : public base::Planner 00066 { 00067 public: 00069 AnytimePathShortening(const base::SpaceInformationPtr &si); 00070 00072 virtual ~AnytimePathShortening(void); 00073 00076 void addPlanner(base::PlannerPtr &planner); 00077 00082 virtual void setProblemDefinition(const base::ProblemDefinitionPtr &pdef); 00083 00090 virtual base::PlannerStatus solve(const base::PlannerTerminationCondition &ptc); 00091 00095 virtual void clear(void); 00096 00100 virtual void getPlannerData(base::PlannerData &data) const; 00101 00103 virtual void getPlannerData(ompl::base::PlannerData &data, unsigned int idx) const; 00104 00108 virtual void setup(void); 00109 00114 virtual void checkValidity(void); 00115 00117 unsigned int getNumPlanners(void) const; 00118 00120 base::PlannerPtr getPlanner(unsigned int i) const; 00121 00123 bool isShortcutting(void) const; 00124 00126 void setShortcut(bool shortcut); 00127 00129 bool isHybridizing(void) const; 00130 00132 void setHybridize(bool hybridize); 00133 00135 unsigned int maxHybridizationPaths(void) const; 00136 00138 void setMaxHybridizationPath(unsigned int maxPathCount); 00139 00141 void setDefaultNumPlanners(unsigned int numPlanners); 00142 00144 unsigned int getDefaultNumPlanners() const; 00145 00147 std::string getBestCost() const; 00148 00149 protected: 00152 virtual void threadSolve(base::Planner *planner, const base::PlannerTerminationCondition &ptc); 00153 00155 std::vector<base::PlannerPtr> planners_; 00156 00158 bool shortcut_; 00159 00161 bool hybridize_; 00162 00165 unsigned int maxHybridPaths_; 00166 00169 unsigned int defaultNumPlanners_; 00170 }; 00171 } 00172 } 00173 #endif