edge_shortest_path.h
Go to the documentation of this file.
1 /*********************************************************************
2  *
3  * Software License Agreement (BSD License)
4  *
5  * Copyright (c) 2016,
6  * TU Dortmund - Institute of Control Theory and Systems Engineering.
7  * All rights reserved.
8  *
9  * Redistribution and use in source and binary forms, with or without
10  * modification, are permitted provided that the following conditions
11  * are met:
12  *
13  * * Redistributions of source code must retain the above copyright
14  * notice, this list of conditions and the following disclaimer.
15  * * Redistributions in binary form must reproduce the above
16  * copyright notice, this list of conditions and the following
17  * disclaimer in the documentation and/or other materials provided
18  * with the distribution.
19  * * Neither the name of the institute nor the names of its
20  * contributors may be used to endorse or promote products derived
21  * from this software without specific prior written permission.
22  *
23  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
24  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
25  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
26  * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
27  * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
28  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
29  * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
30  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
31  * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
33  * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34  * POSSIBILITY OF SUCH DAMAGE.
35  *
36  * Notes:
37  * The following class is derived from a class defined by the
38  * g2o-framework. g2o is licensed under the terms of the BSD License.
39  * Refer to the base class source for detailed licensing information.
40  *
41  * Author: Christoph Rösmann
42  *********************************************************************/
43 
44 #ifndef EDGE_SHORTEST_PATH_H_
45 #define EDGE_SHORTEST_PATH_H_
46 
47 #include <float.h>
48 
49 #include <base_local_planner/BaseLocalPlannerConfig.h>
50 
53 
54 #include <Eigen/Core>
55 
56 namespace teb_local_planner {
57 
64 class EdgeShortestPath : public BaseTebBinaryEdge<1, double, VertexPose, VertexPose> {
65 public:
69  EdgeShortestPath() { this->setMeasurement(0.); }
70 
74  void computeError() {
75  ROS_ASSERT_MSG(cfg_, "You must call setTebConfig on EdgeShortestPath()");
76  const VertexPose *pose1 = static_cast<const VertexPose*>(_vertices[0]);
77  const VertexPose *pose2 = static_cast<const VertexPose*>(_vertices[1]);
78  _error[0] = (pose2->position() - pose1->position()).norm();
79 
80  ROS_ASSERT_MSG(std::isfinite(_error[0]), "EdgeShortestPath::computeError() _error[0]=%f\n", _error[0]);
81  }
82 
83 public:
84  EIGEN_MAKE_ALIGNED_OPERATOR_NEW
85 };
86 
87 } // end namespace
88 
89 #endif /* EDGE_SHORTEST_PATH_H_ */
Edge defining the cost function for minimizing the Euclidean distance between two consectuive poses...
void computeError()
Actual cost function.
#define ROS_ASSERT_MSG(cond,...)
const TebConfig * cfg_
Store TebConfig class for parameters.
Base edge connecting two vertices in the TEB optimization problem.
Eigen::Vector2d & position()
Access the 2D position part.
Definition: vertex_pose.h:141
This class stores and wraps a SE2 pose (position and orientation) into a vertex that can be optimized...
Definition: vertex_pose.h:63


teb_local_planner
Author(s): Christoph Rösmann
autogenerated on Wed Jun 3 2020 04:03:08