Eclipse SUMO - Simulation of Urban MObility
|
Computes the shortest path through a network using the A* algorithm. More...
#include <AStarLookupTable.h>
Public Member Functions | |
bool | consistent () const |
whether the heuristic ist consistent (found nodes are always visited on the shortest path the first time) | |
LandmarkLookupTable (const std::string &filename, const std::vector< E * > &edges, SUMOAbstractRouter< E, V > *router, SUMOAbstractRouter< ReversedEdge< E, V >, V > *reverseRouter, const V *defaultVehicle, const std::string &outfile, const int maxNumThreads, M *mapMatcher) | |
double | lowerBound (const E *from, const E *to, double speed, double speedFactor, double fromEffort, double toEffort) const |
provide a lower bound on the distance between from and to (excluding traveltime of both edges) | |
virtual | ~LandmarkLookupTable () |
Private Member Functions | |
std::string | getLandmark (int i) const |
Private Attributes | |
int | myFirstNonInternal |
std::vector< std::vector< double > > | myFromLandmarkDists |
std::map< std::string, int > | myLandmarks |
std::vector< std::vector< double > > | myToLandmarkDists |
Computes the shortest path through a network using the A* algorithm.
The template parameters are:
E | The edge class to use (MSEdge/ROEdge) |
V | The vehicle class to use (MSVehicle/ROVehicle) |
PF | The prohibition function to use (prohibited_withPermissions/noProhibitions) |
EC | The class to retrieve the effort for an edge from |
The router is edge-based. It must know the number of edges for internal reasons and whether a missing connection between two given edges (unbuild route) shall be reported as an error or as a warning.
Definition at line 105 of file AStarLookupTable.h.
|
inline |
Definition at line 107 of file AStarLookupTable.h.
References MFXWorkerThread::Pool::add(), SUMOAbstractRouter< E, V >::clone(), SUMOAbstractRouter< E, V >::compute(), StringUtils::endsWith(), StringTokenizer::get(), LandmarkLookupTable< E, V, M >::getLandmark(), MAX2(), LandmarkLookupTable< E, V, M >::myFirstNonInternal, LandmarkLookupTable< E, V, M >::myFromLandmarkDists, LandmarkLookupTable< E, V, M >::myLandmarks, LandmarkLookupTable< E, V, M >::myToLandmarkDists, SUMOAbstractRouter< E, V >::recomputeCosts(), SUMOAbstractRouter< E, V >::setAutoBulkMode(), StringTokenizer::size(), MFXWorkerThread::Pool::size(), SVC_IGNORING, TL, TLF, StringUtils::toDouble(), UNUSED_PARAMETER, MFXWorkerThread::Pool::waitAll(), WRITE_MESSAGE, WRITE_MESSAGEF, and WRITE_WARNINGF.
|
inlinevirtual |
Definition at line 352 of file AStarLookupTable.h.
|
inlinevirtual |
whether the heuristic ist consistent (found nodes are always visited on the shortest path the first time)
Implements AbstractLookupTable< E, V >.
Definition at line 403 of file AStarLookupTable.h.
|
inlineprivate |
Definition at line 483 of file AStarLookupTable.h.
References LandmarkLookupTable< E, V, M >::myLandmarks.
Referenced by LandmarkLookupTable< E, V, M >::LandmarkLookupTable(), and LandmarkLookupTable< E, V, M >::lowerBound().
|
inlinevirtual |
provide a lower bound on the distance between from and to (excluding traveltime of both edges)
Implements AbstractLookupTable< E, V >.
Definition at line 355 of file AStarLookupTable.h.
References LandmarkLookupTable< E, V, M >::getLandmark(), MAX2(), LandmarkLookupTable< E, V, M >::myFirstNonInternal, LandmarkLookupTable< E, V, M >::myFromLandmarkDists, LandmarkLookupTable< E, V, M >::myLandmarks, LandmarkLookupTable< E, V, M >::myToLandmarkDists, and UNREACHABLE.
|
private |
Definition at line 411 of file AStarLookupTable.h.
Referenced by LandmarkLookupTable< E, V, M >::LandmarkLookupTable(), and LandmarkLookupTable< E, V, M >::lowerBound().
|
private |
Definition at line 409 of file AStarLookupTable.h.
Referenced by LandmarkLookupTable< E, V, M >::LandmarkLookupTable(), and LandmarkLookupTable< E, V, M >::lowerBound().
|
private |
Definition at line 408 of file AStarLookupTable.h.
Referenced by LandmarkLookupTable< E, V, M >::getLandmark(), LandmarkLookupTable< E, V, M >::LandmarkLookupTable(), and LandmarkLookupTable< E, V, M >::lowerBound().
|
private |
Definition at line 410 of file AStarLookupTable.h.
Referenced by LandmarkLookupTable< E, V, M >::LandmarkLookupTable(), and LandmarkLookupTable< E, V, M >::lowerBound().