/usr/include/ompl/control/PathControl.h is in libompl-dev 0.14.2+dfsg-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 | /*********************************************************************
* Software License Agreement (BSD License)
*
* Copyright (c) 2010, Rice University
* 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 Rice University 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_CONTROL_PATH_CONTROL_
#define OMPL_CONTROL_PATH_CONTROL_
#include "ompl/control/SpaceInformation.h"
#include "ompl/base/Path.h"
#include "ompl/geometric/PathGeometric.h"
#include <vector>
namespace ompl
{
namespace control
{
/** \brief Definition of a control path.
This is the type of path produced when planning with
differential constraints. */
class PathControl : public base::Path
{
public:
/** \brief Constructor */
PathControl(const base::SpaceInformationPtr &si);
/** \brief Copy constructor */
PathControl(const PathControl &path);
virtual ~PathControl(void)
{
freeMemory();
}
/** \brief Assignment operator */
PathControl& operator=(const PathControl& other);
/** \brief The path length (sum of control durations) */
virtual double length(void) const;
/** \brief Check if the path is valid */
virtual bool check(void) const;
/** \brief Print the path to a stream */
virtual void print(std::ostream &out) const;
/** \brief Print the path as a real-valued matrix where the
i-th row represents the i-th state along the path, followed
by the control and duration needed to reach this state. For
the first state the control and duration are zeroes. The
state components printed are those returned by
ompl::base::StateSpace::copyToReals, while the control
components printed are the discrete components (if any)
followed by the real-valued ones as returned by
ompl::control::ControlSpace::getValueAddressAtIndex. */
virtual void printAsMatrix(std::ostream &out) const;
/** \brief Convert this path into a geometric path (interpolation is performed and then states are copied) */
geometric::PathGeometric asGeometric(void) const;
/** @name Path operations
@{ */
/** \brief Append \e state to the end of the path; it is assumed \e state is the first state, so no control is applied.
The memory for \e state is copied. There are no checks to make sure the number of controls and states make sense. */
void append(const base::State *state);
/** \brief Append \e state to the end of the path and assume \e control is applied for the duration \e duration.
The memory for \e state and for \e control is copied. There are no checks to make sure the number of controls and states make sense. */
void append(const base::State *state, const Control *control, double duration);
/** \brief Make the path such that all controls are applied for a single time step (computes intermediate states) */
void interpolate(void);
/** \brief Set this path to a random segment */
void random(void);
/** \brief Set this path to a random valid segment. Sample \e attempts times for valid segments. Returns true on success.*/
bool randomValid(unsigned int attempts);
/** @} */
/** @name Functionality for accessing states and controls
@{ */
/** \brief Get the states that make up the path (as a reference, so it can be modified, hence the function is not const) */
std::vector<base::State*>& getStates(void)
{
return states_;
}
/** \brief Get the controls that make up the path (as a reference, so it can be modified, hence the function is not const) */
std::vector<Control*>& getControls(void)
{
return controls_;
}
/** \brief Get the control durations used along the path (as a reference, so it can be modified, hence the function is not const) */
std::vector<double>& getControlDurations(void)
{
return controlDurations_;
}
/** \brief Get the state located at \e index along the path */
base::State* getState(unsigned int index)
{
return states_[index];
}
/** \brief Get the state located at \e index along the path */
const base::State* getState(unsigned int index) const
{
return states_[index];
}
/** \brief Get the control located at \e index along the path. This is the control that gets applied to the state located at \e index */
Control* getControl(unsigned int index)
{
return controls_[index];
}
/** \brief Get the control located at \e index along the path. This is the control that gets applied to the state located at \e index */
const Control* getControl(unsigned int index) const
{
return controls_[index];
}
/** \brief Get the duration of the control at \e index, which gets applied to the state at \e index. */
double getControlDuration(unsigned int index) const
{
return controlDurations_[index];
}
/** \brief Get the number of states (way-points) that make up this path */
std::size_t getStateCount(void) const
{
return states_.size();
}
/** \brief Get the number of controls applied along this path. This should be equal to getStateCount() - 1 unless there are 0 states, in which case the number of controls will also be 0. */
std::size_t getControlCount(void) const
{
return controls_.size();
}
/** @} */
protected:
/** \brief The list of states that make up the path */
std::vector<base::State*> states_;
/** \brief The control applied at each state. This array contains one element less than the list of states */
std::vector<Control*> controls_;
/** \brief The duration of the control applied at each state. This array contains one element less than the list of states */
std::vector<double> controlDurations_;
/** \brief Free the memory allocated by the path */
void freeMemory(void);
/** \brief Copy the content of a path to this one */
void copyFrom(const PathControl& other);
};
}
}
#endif
|