OptimizationObjective.h
1 /*********************************************************************
2 * Software License Agreement (BSD License)
3 *
4 * Copyright (c) 2012, Willow Garage, Inc.
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 *
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above
14 * copyright notice, this list of conditions and the following
15 * disclaimer in the documentation and/or other materials provided
16 * with the distribution.
17 * * Neither the name of the Willow Garage nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
29 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
31 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
32 * POSSIBILITY OF SUCH DAMAGE.
33 *********************************************************************/
34 
35 /* Author: Luis G. Torres, Ioan Sucan, Jonathan Gammell */
36 
37 #ifndef OMPL_BASE_OPTIMIZATION_OBJECTIVE_
38 #define OMPL_BASE_OPTIMIZATION_OBJECTIVE_
39 
40 #include "ompl/base/Cost.h"
41 #include "ompl/base/SpaceInformation.h"
42 #include "ompl/util/ClassForward.h"
43 #include "ompl/base/ProblemDefinition.h"
44 #include "ompl/base/samplers/InformedStateSampler.h"
45 
46 #include <iostream>
47 
48 namespace ompl
49 {
50  namespace base
51  {
52  class Goal;
53 
55  typedef std::function<Cost (const State*, const Goal*)> CostToGoHeuristic;
56 
58 
59  OMPL_CLASS_FORWARD(OptimizationObjective);
61 
69  {
70  public:
71  // non-copyable
73  OptimizationObjective& operator=(const OptimizationObjective&) = delete;
74 
77 
78  virtual ~OptimizationObjective()
79  {
80  }
81 
83  const std::string& getDescription() const;
84 
86  virtual bool isSatisfied(Cost c) const;
87 
89  Cost getCostThreshold() const;
90 
92  void setCostThreshold(Cost c);
93 
95  virtual bool isCostBetterThan(Cost c1, Cost c2) const;
96 
98  virtual bool isCostEquivalentTo(Cost c1, Cost c2) const;
99 
101  virtual bool isFinite(Cost cost) const;
102 
104  virtual Cost betterCost(Cost c1, Cost c2) const;
105 
107  virtual Cost stateCost(const State *s) const = 0;
108 
110  virtual Cost motionCost(const State *s1, const State *s2) const = 0;
111 
113  virtual Cost combineCosts(Cost c1, Cost c2) const;
114 
116  virtual Cost identityCost() const;
117 
119  virtual Cost infiniteCost() const;
120 
122  virtual Cost initialCost(const State *s) const;
123 
125  virtual Cost terminalCost(const State *s) const;
126 
128  virtual bool isSymmetric() const;
129 
131  virtual Cost averageStateCost(unsigned int numStates) const;
132 
135 
137  bool hasCostToGoHeuristic() const;
138 
140  Cost costToGo(const State *state, const Goal *goal) const;
141 
143  virtual Cost motionCostHeuristic(const State *s1, const State *s2) const;
144 
147 
149  virtual InformedSamplerPtr allocInformedStateSampler(const ProblemDefinitionPtr probDefn, unsigned int maxNumberCalls) const;
150 
152  virtual void print(std::ostream &out) const;
153 
154  protected:
157 
159  std::string description_;
160 
163 
166  };
167 
176  Cost goalRegionCostToGo(const State *state, const Goal *goal);
177 
180  {
181  public:
183 
185  void addObjective(const OptimizationObjectivePtr& objective,
186  double weight);
187 
189  std::size_t getObjectiveCount() const;
190 
192  const OptimizationObjectivePtr& getObjective(unsigned int idx) const;
193 
195  double getObjectiveWeight(unsigned int idx) const;
196 
198  void setObjectiveWeight(unsigned int idx, double weight);
199 
201  void lock();
202 
204  bool isLocked() const;
205 
210  virtual Cost stateCost(const State *s) const;
211 
216  virtual Cost motionCost(const State *s1, const State *s2) const;
217 
218  protected:
219 
221  struct Component
222  {
223  Component(const OptimizationObjectivePtr& obj, double weight);
224  OptimizationObjectivePtr objective;
225  double weight;
226  };
227 
229  std::vector<Component> components_;
230 
232  bool locked_;
233 
234  // Friend functions for operator overloads for easy multiobjective creation
236  const OptimizationObjectivePtr &b);
237 
239 
241  };
242 
245  const OptimizationObjectivePtr &b);
246 
249 
252  }
253 }
254 
255 #endif
virtual Cost initialCost(const State *s) const
Returns a cost value corresponding to starting at a state s. No optimal planners currently support th...
std::string description_
The description of this optimization objective.
virtual void print(std::ostream &out) const
Print information about this optimization objective.
A shared pointer wrapper for ompl::base::ProblemDefinition.
virtual Cost stateCost(const State *s) const =0
Evaluate a cost map defined on the state space at a state s.
This class allows for the definition of multiobjective optimal planning problems. Objectives are adde...
std::vector< Component > components_
List of objective/weight pairs.
virtual bool isSymmetric() const
Check if this objective has a symmetric cost metric, i.e. motionCost(s1, s2) = motionCost(s2, s1). Default implementation returns whether the underlying state space has symmetric interpolation.
Abstract definition of goals.
Definition: Goal.h:62
Cost goalRegionCostToGo(const State *state, const Goal *goal)
For use when the cost-to-go of a state under the optimization objective is equivalent to the goal reg...
void addObjective(const OptimizationObjectivePtr &objective, double weight)
Adds a new objective for this multiobjective. A weight must also be specified for specifying importan...
virtual Cost averageStateCost(unsigned int numStates) const
Compute the average state cost of this objective by taking a sample of numStates states.
void setCostThreshold(Cost c)
Set the cost threshold for objective satisfaction. When a path is found with a cost better than the c...
const std::string & getDescription() const
Get the description of this optimization objective.
virtual Cost infiniteCost() const
Get a cost which is greater than all other costs in this OptimizationObjective; required for use in D...
virtual Cost motionCost(const State *s1, const State *s2) const =0
Get the cost that corresponds to the motion segment between s1 and s2.
CostToGoHeuristic costToGoFn_
The function used for returning admissible estimates on the optimal cost of the path between a given ...
const SpaceInformationPtr & getSpaceInformation() const
Returns this objective's SpaceInformation. Needed for operators in MultiOptimizationObjective.
void setCostToGoHeuristic(const CostToGoHeuristic &costToGo)
Set the cost-to-go heuristic function for this objective. The cost-to-go heuristic is a function whic...
Cost threshold_
The cost threshold used for checking whether this objective has been satisfied during planning...
virtual Cost motionCostHeuristic(const State *s1, const State *s2) const
Defines an admissible estimate on the optimal cost on the motion between states s1 and s2...
virtual Cost motionCost(const State *s1, const State *s2) const
Cost getCostThreshold() const
Returns the cost threshold currently being checked for objective satisfaction.
Cost costToGo(const State *state, const Goal *goal) const
Uses a cost-to-go heuristic to calculate an admissible estimate of the optimal cost from a given stat...
virtual bool isCostEquivalentTo(Cost c1, Cost c2) const
Compare whether cost c1 and cost c2 are equivalent. By default defined as !isCostBetterThan(c1, c2) && !isCostBetterThan(c2, c1), as if c1 is not better than c2, and c2 is not better than c1, then they are equal.
virtual bool isCostBetterThan(Cost c1, Cost c2) const
Check whether the the cost c1 is considered better than the cost c2. By default, this returns true if...
A shared pointer wrapper for ompl::base::SpaceInformation.
virtual Cost betterCost(Cost c1, Cost c2) const
Return the minimum cost given c1 and c2. Uses isCostBetterThan.
Defines a pairing of an objective and its weight.
Definition of an abstract state.
Definition: State.h:50
OptimizationObjectivePtr operator+(const OptimizationObjectivePtr &a, const OptimizationObjectivePtr &b)
Given two optimization objectives, returns a MultiOptimizationObjective that combines the two objecti...
void setObjectiveWeight(unsigned int idx, double weight)
Sets the weighing factor of a specific objective.
Abstract definition of optimization objectives.
friend OptimizationObjectivePtr operator+(const OptimizationObjectivePtr &a, const OptimizationObjectivePtr &b)
Given two optimization objectives, returns a MultiOptimizationObjective that combines the two objecti...
double getObjectiveWeight(unsigned int idx) const
Returns the weighing factor of a specific objective.
bool isLocked() const
Returns whether this multiobjective has been locked from adding further objectives.
A shared pointer wrapper for ompl::base::OptimizationObjective.
std::size_t getObjectiveCount() const
Returns the number of objectives that make up this multiobjective.
bool hasCostToGoHeuristic() const
Check if this objective has a cost-to-go heuristic function.
void lock()
This method "freezes" this multiobjective so that no more objectives can be added to it...
bool locked_
Whether this multiobjective is locked from further additions.
virtual bool isSatisfied(Cost c) const
Check if the the given cost c satisfies the specified cost objective, defined as better than the spec...
virtual Cost combineCosts(Cost c1, Cost c2) const
Get the cost that corresponds to combining the costs c1 and c2. Default implementation defines this c...
virtual InformedSamplerPtr allocInformedStateSampler(const ProblemDefinitionPtr probDefn, unsigned int maxNumberCalls) const
Allocate a heuristic-sampling state generator for this cost function, defaults to a basic rejection s...
virtual Cost terminalCost(const State *s) const
Returns a cost value corresponding to a path ending at a state s. No optimal planners currently suppo...
virtual bool isFinite(Cost cost) const
Returns whether the cost is finite or not.
SpaceInformationPtr si_
The space information for this objective.
virtual Cost stateCost(const State *s) const
virtual Cost identityCost() const
Get the identity cost value. The identity cost value is the cost c_i such that, for all costs c...
const OptimizationObjectivePtr & getObjective(unsigned int idx) const
Returns a specific objective from this multiobjective, where the individual objectives are in order o...
Definition of a cost value. Can represent the cost of a motion or the cost of a state.
Definition: Cost.h:47
friend OptimizationObjectivePtr operator*(double w, const OptimizationObjectivePtr &a)
Given a weighing factor and an optimization objective, returns a MultiOptimizationObjective containin...
OptimizationObjectivePtr operator*(double w, const OptimizationObjectivePtr &a)
Given a weighing factor and an optimization objective, returns a MultiOptimizationObjective containin...
std::function< Cost(const State *, const Goal *)> CostToGoHeuristic
The definition of a function which returns an admissible estimate of the optimal path cost from a giv...