single_robot_router.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 SRR_H
30 #define SRR_H
31 
36 #include <iostream>
37 
38 namespace multi_robot_router
39 {
40 typedef struct Robot
41 {
42  int id;
43  float diameter;
45  Robot(int _id, float _d, float _s) : id(_id), diameter(_d), speedMultiplier(_s) {}
46  Robot(int _id, float _d) : Robot(_id, _d, 1) {}
47 } Robot;
48 
50 {
51  public:
71  bool getRouteCandidate(const uint32_t _start, const uint32_t _goal, const RouteCoordinatorWrapper &path_coordinator, const uint32_t _robotDiameter, const float &_robotSpeed, std::vector<RouteVertex> &path, const uint32_t _maxIterations);
72 
77  const std::vector<uint32_t> &getRobotCollisions() const;
83  void initSearchGraph(const std::vector<Segment> &_graph, const uint32_t minSegmentWidth_ = 0);
87  void setCollisionResolver(const SegmentExpander::CollisionResolverType cRes);
91  bool getLastResult();
95  SegmentExpander::CollisionResolverType getCollisionResolverType() const;
96 
97  private:
98  void resetAttempt();
101  uint32_t robotDiameter_;
102  //unique_ptr to keep references of Vertex (Heap), because the list is updated while runtime
103  std::vector<std::unique_ptr<Vertex>> searchGraph_;
104  bool lastAttempt_ = false;
105  std::vector<RouteVertex> path_;
106 };
107 } // namespace multi_robot_router
108 #endif
Robot(int _id, float _d, float _s)
std::vector< std::unique_ptr< Vertex > > searchGraph_


tuw_multi_robot_router
Author(s): Benjamin Binder
autogenerated on Mon Jun 10 2019 15:42:49