segment_to_graph_node.h
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2017, <copyright holder> <email>
3  * All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions are met:
7  * * Redistributions of source code must retain the above copyright
8  * notice, this list of conditions and the following disclaimer.
9  * * Redistributions in binary form must reproduce the above copyright
10  * notice, this list of conditions and the following disclaimer in the
11  * documentation and/or other materials provided with the distribution.
12  * * Neither the name of the <organization> nor the
13  * names of its contributors may be used to endorse or promote products
14  * derived from this software without specific prior written permission.
15  *
16  * THIS SOFTWARE IS PROVIDED BY <copyright holder> <email> ''AS IS'' AND ANY
17  * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
18  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
19  * DISCLAIMED. IN NO EVENT SHALL <copyright holder> <email> BE LIABLE FOR ANY
20  * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
21  * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
22  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
23  * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
25  * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26  *
27  */
28 
29 #ifndef SEGMENT_TO_GRAPH_NODE_H
30 #define SEGMENT_TO_GRAPH_NODE_H
31 
32 #include <ros/ros.h>
33 #include <memory>
34 #include <tuw_multi_robot_msgs/Vertex.h>
35 #include <tuw_multi_robot_msgs/Graph.h>
36 #include <geometry_msgs/Point.h>
37 
38 #include <eigen3/Eigen/Dense>
39 
40 namespace tuw_graph
41 {
42  struct PathSeg
43  {
44  Eigen::Vector2d start;
45  Eigen::Vector2d end;
46  float width;
47  PathSeg(Eigen::Vector2d _s, Eigen::Vector2d _e, double _w) : start(_s), end(_e), width(_w) { }
48  };
49 
51  {
52  public:
54  void Publish();
57  std::unique_ptr<ros::Rate> rate_;
58 
59 
60  private:
62 
63 
64  std::string segment_file_;
65  std::string segment_topic_;
66  double path_length_;
67 
68  tuw_multi_robot_msgs::Graph current_graph_;
69 
70  void readSegments();
71  std::vector<int32_t> findNeighbors(std::vector<PathSeg> &_graph, Eigen::Vector2d _point, uint32_t _segment);
72  };
73 }
74 #endif // PLANNER_NODE_H
PathSeg(Eigen::Vector2d _s, Eigen::Vector2d _e, double _w)
tuw_multi_robot_msgs::Graph current_graph_
ros::NodeHandle n_param_
Node handler to the current node.
ros::NodeHandle n_
Node handler to the root node.
std::unique_ptr< ros::Rate > rate_


tuw_voronoi_graph
Author(s): Benjamin Binder
autogenerated on Mon Jun 10 2019 15:42:44