PathLengthOptimizationObjective.cpp
1 /*********************************************************************
2 * Software License Agreement (BSD License)
3 *
4 * Copyright (c) 2010, Rice University
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 Rice University 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, Jonathan Gammell */
36 
37 #include "ompl/base/objectives/PathLengthOptimizationObjective.h"
38 #include <memory>
39 #include "ompl/base/samplers/informed/PathLengthDirectInfSampler.h"
40 
41 ompl::base::PathLengthOptimizationObjective::PathLengthOptimizationObjective(const SpaceInformationPtr &si)
42  : ompl::base::OptimizationObjective(si)
43 {
44  description_ = "Path Length";
45 
46  // Setup a default cost-to-go heuristics:
48 }
49 
51 {
52  return identityCost();
53 }
54 
56 {
57  return Cost(si_->distance(s1, s2));
58 }
59 
61  const State *s2) const
62 {
63  return motionCost(s1, s2);
64 }
65 
67  const ProblemDefinitionPtr &probDefn, unsigned int maxNumberCalls) const
68 {
69 // Make the direct path-length informed sampler and return. If OMPL was compiled with Eigen, a direct version is
70 // available, if not a rejection-based technique can be used
71  return std::make_shared<PathLengthDirectInfSampler>(probDefn, maxNumberCalls);
72 }
A shared pointer wrapper for ompl::base::SpaceInformation.
Definition of an abstract state.
Definition: State.h:113
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 stateCost(const State *s) const override
Returns identity cost.
Definition of a cost value. Can represent the cost of a motion or the cost of a state.
Definition: Cost.h:111
Cost motionCostHeuristic(const State *s1, const State *s2) const override
the motion cost heuristic for this objective is simply the configuration space distance between s1 an...
A shared pointer wrapper for ompl::base::ProblemDefinition.
std::string description_
The description of this optimization objective.
Cost motionCost(const State *s1, const State *s2) const override
Motion cost for this objective is defined as the configuration space distance between s1 and s2,...
InformedSamplerPtr allocInformedStateSampler(const ProblemDefinitionPtr &probDefn, unsigned int maxNumberCalls) const override
Allocate a state sampler for the path-length objective (i.e., direct ellipsoidal sampling).
Main namespace. Contains everything in this library.
Definition: AppBase.h:21
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...