Loading...
Searching...
No Matches
SelfConfig.h
1/*********************************************************************
2 * Software License Agreement (BSD License)
3 *
4 * Copyright (c) 2011, 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: Ioan Sucan */
36
37#ifndef OMPL_TOOLS_SELF_CONFIG_
38#define OMPL_TOOLS_SELF_CONFIG_
39
40#include "ompl/base/Goal.h"
41#include "ompl/base/Planner.h"
42#include "ompl/base/SpaceInformation.h"
43#include "ompl/datastructures/NearestNeighborsSqrtApprox.h"
44#include "ompl/datastructures/NearestNeighborsGNAT.h"
45#include "ompl/datastructures/NearestNeighborsGNATNoThreadSafety.h"
46#include <mutex>
47#include <iostream>
48#include <string>
49
50namespace ompl
51{
53 namespace tools
54 {
59 {
60 public:
64 SelfConfig(const base::SpaceInformationPtr &si, const std::string &context = std::string());
65
67
71
75
81 void configureValidStateSamplingAttempts(unsigned int &attempts);
82
84 void configurePlannerRange(double &range);
85
89 void configureProjectionEvaluator(base::ProjectionEvaluatorPtr &proj);
90
92 void print(std::ostream &out = std::cout) const;
93
104 template <typename _T>
106 {
107 const base::StateSpacePtr &space = planner->getSpaceInformation()->getStateSpace();
108 const base::PlannerSpecs &specs = planner->getSpecs();
109 if (space->isMetricSpace())
110 {
111 if (specs.multithreaded)
112 return new NearestNeighborsGNAT<_T>();
114 }
116 }
117
119 static base::PlannerPtr getDefaultPlanner(const base::GoalPtr &goal);
120
121 private:
123 class SelfConfigImpl;
124
125 SelfConfigImpl *impl_;
126 std::string context_;
127 static std::mutex staticConstructorLock_;
129 };
130 } // namespace tools
131} // namespace ompl
132
133#endif
Geometric Near-neighbor Access Tree (GNAT), a data structure for nearest neighbor search.
Geometric Near-neighbor Access Tree (GNAT), a data structure for nearest neighbor search.
A nearest neighbors datastructure that uses linear search. The linear search is done over sqrt(n) ele...
Abstract representation of a container that can perform nearest neighbors queries.
Base class for a planner.
Definition Planner.h:216
const SpaceInformationPtr & getSpaceInformation() const
Get the space information this planner is using.
Definition Planner.cpp:66
const PlannerSpecs & getSpecs() const
Return the specifications (capabilities of this planner).
Definition Planner.cpp:51
static NearestNeighbors< _T > * getDefaultNearestNeighbors(const base::Planner *planner)
Select a default nearest neighbor datastructure for the given space.
Definition SelfConfig.h:105
void configureValidStateSamplingAttempts(unsigned int &attempts)
Instances of base::ValidStateSampler need a number of attempts to be specified – the maximum number o...
void configurePlannerRange(double &range)
Compute what a good length for motion segments is.
double getProbabilityOfValidState()
Get the probability of a sampled state being valid (calls base::SpaceInformation::probabilityOfValidS...
void configureProjectionEvaluator(base::ProjectionEvaluatorPtr &proj)
If proj is undefined, it is set to the default projection reported by base::StateSpace::getDefaultPro...
double getAverageValidMotionLength()
Get the probability of a sampled state being valid (calls base::SpaceInformation::averageValidMotionL...
void print(std::ostream &out=std::cout) const
Print the computed configuration parameters.
SelfConfig(const base::SpaceInformationPtr &si, const std::string &context=std::string())
Construct an instance that can configure the space encapsulated by si. Any information printed to the...
static base::PlannerPtr getDefaultPlanner(const base::GoalPtr &goal)
Given a goal specification, decide on a planner for that goal.
Includes various tools such as self config, benchmarking, etc.
Main namespace. Contains everything in this library.
Properties that planners may have.
Definition Planner.h:185
bool multithreaded
Flag indicating whether multiple threads are used in the computation of the planner.
Definition Planner.h:192