#include <segment_expander.h>
|
void | addExpansoionCandidate (Vertex &_current, Vertex &_next, Vertex &_end) |
|
void | addStartExpansionCandidate (Vertex &_start, Vertex &_current, Vertex &_next, Vertex &_end) |
|
template<class T , class S , class C > |
void | clearpq (std::priority_queue< T, S, C > &q) |
|
bool | containsVertex (const Vertex &_v, const std::vector< std::reference_wrapper< Vertex >> &_list) const |
|
Vertex * | expandVoronoi (Vertex &_start, Vertex &_end, const uint32_t _cycles) |
|
void | resolveStartCollision (Vertex &_start, Vertex &_end) |
|
Definition at line 45 of file segment_expander.h.
constructor
- Parameters
-
_h | the heuristic used (A-Star, Dijkstra, ...) |
_pCalc | the used Potential Calculator for the expander |
_cRes | the used collision resolution strategy |
Definition at line 36 of file segment_expander.cpp.
void multi_robot_router::SegmentExpander::addExpansoionCandidate |
( |
Vertex & |
_current, |
|
|
Vertex & |
_next, |
|
|
Vertex & |
_end |
|
) |
| |
|
private |
void multi_robot_router::SegmentExpander::addStartExpansionCandidate |
( |
Vertex & |
_start, |
|
|
Vertex & |
_current, |
|
|
Vertex & |
_next, |
|
|
Vertex & |
_end |
|
) |
| |
|
private |
bool multi_robot_router::SegmentExpander::calculatePotentials |
( |
const RouteCoordinatorWrapper * |
_p, |
|
|
Vertex & |
_start, |
|
|
Vertex & |
_end, |
|
|
const uint32_t |
_maxIterations, |
|
|
const uint32_t |
_radius |
|
) |
| |
assigns all Vertices in the Search graph with a potential according to the distance to the start
- Parameters
-
_p | the route coordinator to coordinate the route with other robots |
_start | the start Vertex |
_end | the end Vertex |
- Returns
- if the goal was found
Definition at line 144 of file segment_expander.cpp.
template<class T , class S , class C >
void multi_robot_router::SegmentExpander::clearpq |
( |
std::priority_queue< T, S, C > & |
q | ) |
|
|
inlineprivate |
bool multi_robot_router::SegmentExpander::containsVertex |
( |
const Vertex & |
_v, |
|
|
const std::vector< std::reference_wrapper< Vertex >> & |
_list |
|
) |
| const |
|
private |
Vertex * multi_robot_router::SegmentExpander::expandVoronoi |
( |
Vertex & |
_start, |
|
|
Vertex & |
_end, |
|
|
const uint32_t |
_cycles |
|
) |
| |
|
private |
const std::vector< uint32_t > & multi_robot_router::SegmentExpander::getRobotCollisions |
( |
| ) |
const |
void multi_robot_router::SegmentExpander::reset |
( |
| ) |
|
void multi_robot_router::SegmentExpander::resolveStartCollision |
( |
Vertex & |
_start, |
|
|
Vertex & |
_end |
|
) |
| |
|
private |
void multi_robot_router::SegmentExpander::setSpeed |
( |
const float & |
_speed | ) |
|
std::vector<uint32_t> multi_robot_router::SegmentExpander::collisions_robots_ |
|
private |
uint32_t multi_robot_router::SegmentExpander::diameter_ |
|
private |
Heuristic multi_robot_router::SegmentExpander::hx_ |
|
private |
uint32_t multi_robot_router::SegmentExpander::neutral_cost_ = 1 |
|
private |
std::vector<std::unique_ptr<Vertex> > multi_robot_router::SegmentExpander::startSegments_ |
|
private |
The documentation for this class was generated from the following files: